Sciweavers

Share
ALENEX
2008
192views Algorithms» more  ALENEX 2008»
9 years 1 months ago
Compressed Inverted Indexes for In-Memory Search Engines
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
Frederik Transier, Peter Sanders
ALENEX
2007
127views Algorithms» more  ALENEX 2007»
9 years 1 months ago
Intersection in Integer Inverted Indices
Inverted index data structures are the key to fast search engines. The predominant operation on inverted indices asks for intersecting two sorted lists of document IDs which might...
Peter Sanders, Frederik Transier
SIGMOD
2001
ACM
124views Database» more  SIGMOD 2001»
10 years 6 days ago
Query Optimization In Compressed Database Systems
Over the last decades, improvements in CPU speed have outpaced improvements in main memory and disk access rates by orders of magnitude, enabling the use of data compression techn...
Zhiyuan Chen, Johannes Gehrke, Flip Korn
SIGMOD
2002
ACM
246views Database» more  SIGMOD 2002»
10 years 6 days ago
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neig
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
Charu C. Aggarwal
books