Sciweavers

Share
ALENEX
2007

Intersection in Integer Inverted Indices

11 years 3 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 have vastly varying lengths. We compare previous theoretical approaches, methods used in practice, and one new algorithm which exploits that the intersection uses small integer keys. We also take different data compression techniques into account. The new algorithm is very fast, simple, has good space efficiency, and is the only algorithm that performs well over the entire spectrum of relative list length ratios.
Peter Sanders, Frederik Transier
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2007
Where ALENEX
Authors Peter Sanders, Frederik Transier
Comments (0)
books