50 search results - page 6 / 10 » Compressing Bitmap Indexes for Faster Search Operations |
SIGIR
2006
ACM
14 years 20 days ago
2006
ACM
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
CIKM
2005
Springer
13 years 8 months ago
2005
Springer
Inverted index structures are the mainstay of modern text retrieval systems. They can be constructed quickly using off-line mergebased methods, and provide efficient support for ...
ICDE
2003
IEEE
14 years 8 months ago
2003
IEEE
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
ESA
2010
Springer
13 years 7 months ago
2010
Springer
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
SIGMOD
2001
ACM
14 years 6 months ago
2001
ACM
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...