Sciweavers

69 search results - page 2 / 14
» Compressed Inverted Indexes for In-Memory Search Engines
Sort
View
SPIRE
2005
Springer
13 years 10 months ago
Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups
Large inverted indices are by now common in the construction of web-scale search engines. For faster access, inverted indices are indexed internally so that it is possible to skip...
Paolo Boldi, Sebastiano Vigna
CIKM
2007
Springer
13 years 11 months ago
Sigma encoded inverted files
Compression of term frequency lists and very long document-id lists within an inverted file search engine are examined. Several compression schemes are compared including Elias γ...
Andrew Trotman, Vikram Subramanya
IR
2000
13 years 5 months ago
Adding Compression to Block Addressing Inverted Indexes
Inverted index compression, block addressing and sequential search on compressed text are three techniques that have been separately developed for e cient, low-overhead text retrie...
Gonzalo Navarro, Edleno Silva de Moura, Marden S. ...
CIKM
2009
Springer
13 years 12 months ago
Compact full-text indexing of versioned document collections
We study the problem of creating highly compressed fulltext index structures for versioned document collections, that is, collections that contain multiple versions of each docume...
Jinru He, Hao Yan, Torsten Suel
ALENEX
2007
127views Algorithms» more  ALENEX 2007»
13 years 6 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