Sciweavers

30 search results - page 2 / 6
» Performance of compressed inverted list caching in search en...
Sort
View
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
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
2008
Springer
13 years 7 months ago
Dynamic faceted search for discovery-driven analysis
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
Debabrata Dash, Jun Rao, Nimrod Megiddo, Anastasia...
SIGIR
2009
ACM
13 years 11 months ago
Compressing term positions in web indexes
Large search engines process thousands of queries per second on billions of pages, making query processing a major factor in their operating costs. This has led to a lot of resear...
Hao Yan, Shuai Ding, Torsten Suel
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. ...