Sciweavers

1098 search results - page 12 / 220
» Compressed web indexes
Sort
View
ICDE
1998
IEEE
124views Database» more  ICDE 1998»
15 years 1 months ago
Compressing Relations and Indexes
We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially e ective for records with many lo...
Jonathan Goldstein, Raghu Ramakrishnan, Uri Shaft
CIKM
2009
Springer
15 years 4 months ago
Inverted indexes vs. bitmap indexes in decision support systems
Bitmap indexes are widely used in Decision Support Systems (DSSs) to improve query performance. In this paper, we evaluate the use of compressed inverted indexes with adapted quer...
Truls A. Bjørklund, Nils Grimsmo, Johannes ...
ESA
2011
Springer
231views Algorithms» more  ESA 2011»
13 years 9 months ago
Distribution-Aware Compressed Full-Text Indexes
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 ...
Paolo Ferragina, Jouni Sirén, Rossano Ventu...
ALENEX
2008
192views Algorithms» more  ALENEX 2008»
14 years 10 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
ESA
2011
Springer
269views Algorithms» more  ESA 2011»
13 years 9 months ago
Alphabet-Independent Compressed Text Indexing
Self-indexes can represent a text in asymptotically optimal space under the k-th order entropy model, give access to text substrings, and support indexed pattern searches. Their ti...
Djamal Belazzougui, Gonzalo Navarro