Sciweavers

371 search results - page 1 / 75
» On Two-Dimensional Indexability and Optimal Range Search Ind...
Sort
View
PODS
1999
ACM
88views Database» more  PODS 1999»
13 years 11 months ago
On Two-Dimensional Indexability and Optimal Range Search Indexing
Lars Arge, Vasilis Samoladas, Jeffrey Scott Vitter
IFIPTCS
2000
13 years 11 months ago
An Index for Two Dimensional String Matching Allowing Rotations
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
EDBT
2012
ACM
216views Database» more  EDBT 2012»
11 years 9 months ago
Effectively indexing the multi-dimensional uncertain objects for range searching
The range searching problem is fundamental in a wide spectrum of applications such as radio frequency identification (RFID) networks, location based services (LBS), and global po...
Ying Zhang, Wenjie Zhang, Qianlu Lin, Xuemin Lin
SIGIR
2012
ACM
11 years 9 months ago
To index or not to index: time-space trade-offs in search engines with positional ranking functions
Positional ranking functions, widely used in web search engines, improve result quality by exploiting the positions of the query terms within documents. However, it is well known ...
Diego Arroyuelo, Senén González, Mau...
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 8 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi