A survey of adaptive sorting algorithms
ACM Computing Surveys (CSUR)
Suffix arrays: a new method for on-line string searches
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Adaptive set intersections, unions, and differences
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Interpolation search—a log logN search
Communications of the ACM
Adaptive intersection and t-threshold problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Experiments on Adaptive Set Intersections for Text Retrieval Systems
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Compact representations of ordered sets
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Interpolation search for non-independent data
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Experimental analysis of a fast intersection algorithm for sorted sequences
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Lazy, adaptive rid-list intersection, and its application to index anding
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Adaptive searching in succinctly encoded binary relations and tree-structured documents
Theoretical Computer Science
On placing skips optimally in expectation
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Self-indexing Natural Language
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
An experimental investigation of set intersection algorithms for text searching
Journal of Experimental Algorithmics (JEA)
On efficient posting list intersection with multicore processors
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
Improving the performance of list intersection
Proceedings of the VLDB Endowment
Index compression using 64-bit words
Software—Practice & Experience
Compact set representation for information retrieval
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Note: Fast set intersection and two-patterns matching
Theoretical Computer Science
Efficient set intersection for inverted indexing
ACM Transactions on Information Systems (TOIS)
Engineering basic algorithms of an in-memory text search engine
ACM Transactions on Information Systems (TOIS)
Fast set intersection in memory
Proceedings of the VLDB Endowment
Indexing methods for approximate dictionary searching: Comparative analysis
Journal of Experimental Algorithmics (JEA)
Proceedings of the VLDB Endowment
Posting list intersection on multicore architectures
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Efficiently encoding term co-occurrences in inverted indexes
Proceedings of the 20th ACM international conference on Information and knowledge management
Indexes for highly repetitive document collections
Proceedings of the 20th ACM international conference on Information and knowledge management
Word-based self-indexes for natural language text
ACM Transactions on Information Systems (TOIS)
Fast set intersection and two-patterns matching
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
New algorithms on wavelet trees and applications to information retrieval
Theoretical Computer Science
Proceedings of the 21st ACM international conference on Information and knowledge management
Faster upper bounding of intersection sizes
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Fast candidate generation for real-time tweet search with bloom filter chains
ACM Transactions on Information Systems (TOIS)
Document vector representations for feature extraction in multi-stage document ranking
Information Retrieval
Efficient query processing for XML keyword queries based on the IDList index
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
The intersection of large ordered sets is a common problem in the context of the evaluation of boolean queries to a search engine. In this paper we engineer a better algorithm for this task, which improves over those proposed by Demaine, Munro and López-Ortiz [SODA 2000/ALENEX 2001], by using a variant of interpolation search. More specifically, our contributions are threefold. First, we corroborate and complete the practical study from Demaine et al. on comparison based intersection algorithms. Second, we show that in practice replacing binary search and galloping (one-sided binary) search [4] by interpolation search improves the performance of each main intersection algorithms. Third, we introduce and test variants of interpolation search: this results in an even better intersection algorithm.