Experimental analysis of a fast intersection algorithm for sorted sequences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3772 LNCS, Issue , 2005, Pages 13-24

  Baeza Yates, Ricardo ^a   Salinger, Alejandro ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

DATA HANDLING; DATA PROCESSING; OPTIMIZATION; SEARCH ENGINES;

BAEZA-YATES; INTERSECTION ALGORITHMS; QUERY PROCESSING;

ALGORITHMS;

EID: 33646734263     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11575832_2     Document Type: Conference Paper

References (15)

1. R. Baeza-Yates. A Fast Set Intersection Algorithm for Sorted Sequences. In Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching (CPU 2004), Springer LNCS 3109, pp 400-408, Istanbul, Turkey, July 2004.
2. R.A. Baeza-Yates. Efficient Text Serching. PhD thesis, Dept. of Computer Science, University of Waterloo, May 1989. Also as Research Report CS-89-17.
3. Ricardo Baeza-Yates, Phillip G. Bradford, Joseph C. Culberson, and Gregory J.E. Rawlins. The Complexity of Multiple Searching, unpublished manuscript, 1993.
4. R. BaezarYates and B. Ribeiro-Neto, Modern Information Retrieval, ACM Press/Addison-Wesley, England, 513 pages, 1999.
5. R. Baeza-Yates, and Felipe Sainte-Jean. A Three Level Search Engine Index bases in Query Log Distribution. SPIRE 2003, Springer LNCS, Manaus, Brazil, October 2003.
6. Ricardo Baeza-Yates. Query Usage Mining in Search Engines. In Web Mining: Applications and Techniques, Anthony Scime, editor. Idea Group, 2004.
7. Ricardo Baeza-Yates, Carlos Hurtado, Marcelo Mendoza and Georges Dupret. Modeling User Search Behavior, LA-WEB 2005, IEEE CS Press, October 2005.
8. Jérémy Barbay and Claire Kenyon. Adaptive Intersection and t-Threshold Problems. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 390-399, San Francisco, CA, January 2002.
9. S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. In 7th WWW Conference, Brisbane, Australia, April 1998.
10. Erik D. Demaine, Alejandro López-Ortiz, and J. Ian Munro. Adaptive set intersections, unions, and differences. In Proceedings of the 11th Annual ACM-SIAM Symposium, on Discrete Algorithms, pages 743-752, San Francisco, California, January 2000.
11. Erik D. Demaine, Alejandro López-Ortiz, and J. Ian Munro. Experiments on Adaptive Set Intersections for Text Retrieval Systems. In Proceedings of the 3rd Workshop on Algorithm Engineering and Experiments, LNCS, Springer, Washington, DC, January 2001.
12. Dietz, Paul, Mehlhorn, Kurt, Raman, Rajeev, and Uhrig, Christian; "Lower Bounds for Set Intersection Queries", Proceedings of the 4th Annual Symposium on Discrete Algorithms, 194-201, 1993.
13. Dobkin, David and Lipton, Richard; "On the Complexity of Computations Under Varying Sets of Primitives", Journal of Computer and Systems Sciences, 18, 86-91, 1979.
14. F.K. Hwang and S. Lin. A Simple algorithm for merging two disjoint linearly ordered lists, SIAM J. on Computing 1, pp. 31-39, 1972.
15. Rawlins, Gregory J. E.; Compared to What?; An Introduction to the Analysis of Algorithms, Computer Science Press/W. H. Freeman, 1992.