Sciweavers

1567 search results - page 5 / 314
» Compressing Relations and Indexes
Sort
View
SODA
2004
ACM
131views Algorithms» more  SODA 2004»
13 years 9 months ago
When indexing equals compression: experiments with compressing suffix arrays and applications
We report on a new experimental analysis of high-order entropy-compressed suffix arrays, which retains the theoretical performance of previous work and represents an improvement in...
Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter
SUTC
2008
IEEE
14 years 2 months ago
Training Data Compression Algorithms and Reliability in Large Wireless Sensor Networks
With the availability of low-cost sensor nodes there have been many standards developed to integrate and network these nodes to form a reliable network allowing many different typ...
Vasanth Iyer, Rammurthy Garimella, M. B. Srinivas
ITCC
2003
IEEE
14 years 29 days ago
On the Mapping of Index Compression Techniques on CSR Information Retrieval
Information retrieval is the selection of documents relevant to a query. Inverted index is the conventional way to store the index of the collection. Because of the large amounts ...
Sterling Stuart Stein, Nazli Goharian
CIKM
2010
Springer
13 years 6 months ago
Improved index compression techniques for versioned document collections
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...
Jinru He, Junyuan Zeng, Torsten Suel
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
12 years 10 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...