Compressed perfect embedded skip lists for quick inverted-index lookups

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3772 LNCS, Issue , 2005, Pages 25-28

  Boldi, Paolo ^a   Vigna, Sebastiano ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EMBEDDED SKIP LISTS; INVERTED-INDEX LOOKUPS; WEB-SCALE SEARCH ENGINES;

DATA COMPRESSION; EMBEDDED SYSTEMS; INFORMATION RETRIEVAL SYSTEMS; SEARCH ENGINES;

TABLE LOOKUP;

EID: 33646740599     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11575832_3     Document Type: Conference Paper

References (4)

1. Alistair Moffat and Justin Zobel. Self-indexing inverted files for fast text retrieval. ACM Trans. Inf. Syst., 14(4):349-379, 1996.
2. William Pugh. A skip list cookbook. Technical report UMIACS-TR-89-72.1, Univ. of Maryland Institute for Advanced Computer Studies, College Park, College Park, MD, USA, 1990.
3. William Pugh. Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 33(6):668-676, 1990.
4. Ian H. Witten, Alistair Moffat, and Timothy C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers, Los Altos, CA 94022, USA, second edition, 1999.