Faster adaptive set intersections for text searching (2006)
| Venue: | Experimental Algorithms: 5th International Workshop, WEA 2006, Cala Galdana, Menorca |
| Citations: | 22 - 5 self |
BibTeX
@INPROCEEDINGS{Barbay06fasteradaptive,
author = {Jérémy Barbay and Ro López-ortiz and Tyler Lu},
title = {Faster adaptive set intersections for text searching},
booktitle = {Experimental Algorithms: 5th International Workshop, WEA 2006, Cala Galdana, Menorca},
year = {2006},
pages = {146--157},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. 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.
