79 search results - page 9 / 16 » Optimizing Queries on Compressed Bitmaps |
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...
JSS
2007
13 years 7 months ago
2007
A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually of very large size and therefore commonly stored in com...
ESA
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
CIKM
2011
Springer
12 years 7 months ago
2011
Springer
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...