Efficient text searching
Compared to what?: an introduction to the analysis of algorithms
Compared to what?: an introduction to the analysis of algorithms
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Lower bounds for set intersection queries
SODA '93 Proceedings of the fourth 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
Adaptive intersection and t-threshold problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Modern Information Retrieval
Experiments on Adaptive Set Intersections for Text Retrieval Systems
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
LA-WEB '05 Proceedings of the Third Latin American Web Congress
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)
Improving the performance of list intersection
Proceedings of the VLDB Endowment
Engineering basic algorithms of an in-memory text search engine
ACM Transactions on Information Systems (TOIS)
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
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
Word-based self-indexes for natural language text
ACM Transactions on Information Systems (TOIS)
Faster adaptive set intersections for text searching
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Efficient retrieval of tree translation examples for syntax-based machine translation
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
New algorithms on wavelet trees and applications to information retrieval
Theoretical Computer Science
Fast intersection algorithms for sorted sequences
Algorithms and Applications
Dual-Sorted inverted lists in practice
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Faster and smaller inverted indices with treaps
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
| Hi-index | 0.00 |
This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on average less comparisons than the total number of elements of both inputs (n and m respectively) when n=αm (α 1). We can find applications of this algorithm on query processing in Web search engines, where large intersections, or differences, must be performed fast. In this work we concentrate in studying the behavior of the algorithm in practice, using for the experiments test data that is close to the actual conditions of its applications. We compare the efficiency of the algorithm with other intersection algorithm and we study different optimizations, showing that the algorithm is more efficient than the alternatives in most cases, especially when one of the sequences is much larger than the other.