This paper presents and analyzes a simple intersection algorithm for sorted sequences that is fast on average. It is related to the multiple searching problem and to merging. We present the worst and average case analysis, showing that in the former, the complexity nicely adapts to the smallest list size. In the latter case, it performs less comparisons than the total number of elements on both inputs, n and m, when n = αm (α > 1), achieving O(m log(n/m)) complexity. The algorithm is motivated by its application to fast query processing in Web search engines, where large intersections, or differences, must be performed fast. In this case we experimentally show that the algorithm is faster than previous solutions. © Springer-Verlag Berlin Heidelberg 2010.
CITATION STYLE
Ricardo, B. Y., & Alejandro, S. (2010). Fast intersection algorithms for sorted sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6060 LNCS, pp. 45–61). https://doi.org/10.1007/978-3-642-12476-1_3
Mendeley helps you to discover research relevant for your work.