Efficient parallel lists intersection and index compression algorithms using graphics processing units
- 1 May 2011
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 4 (8), 470-481
- https://doi.org/10.14778/2002974.2002975
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Inverted files for text search enginesACM Computing Surveys, 2006
- Experimental Analysis of a Fast Intersection Algorithm for Sorted SequencesLecture Notes in Computer Science, 2005
- Inverted Index Compression Using Word-Aligned Binary CodesInformation Retrieval Journal, 2005
- A Fast Set Intersection Algorithm for Sorted SequencesLecture Notes in Computer Science, 2004
- Inverted file compression through document identifier reassignmentInformation Processing & Management, 2003
- Experiments on Adaptive Set Intersections for Text Retrieval SystemsLecture Notes in Computer Science, 2001
- The anatomy of a large-scale hypertextual Web search engineComputer Networks and ISDN Systems, 1998
- A survey of adaptive sorting algorithmsACM Computing Surveys, 1992
- Skip lists: a probabilistic alternative to balanced treesCommunications of the ACM, 1990
- Interpolation search—a log log N searchCommunications of the ACM, 1978