Faster adaptive set intersections for text searching

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

Volumn 4007 LNCS, Issue , 2006, Pages 146-157

  Barbay, Jérémy ^a   López Ortiz, Alejandro ^a   Lu, Tyler ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Evaluation and Fine tuning of Algorithms; Evaluation of Algorithms for Realistic Environments; Implementation; Information Retrieval; Testing

Indexed keywords

ADAPTIVE SYSTEMS; ALGORITHMS; BOOLEAN ALGEBRA; INFORMATION RETRIEVAL; PROBLEM SOLVING; QUERY LANGUAGES; SEARCH ENGINES; TESTING;

EVALUATION AND FINE-TUNING OF ALGORITHMS; EVALUATION OF ALGORITHMS FOR REALISTIC ENVIRONMENTS; IMPLEMENTATION; TEXT SEARCHING;

TEXT PROCESSING;

EID: 33746060491     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11764298_13     Document Type: Conference Paper

References (16)

1. Ricardo A. Baeza-Yates. A Fast Set Intersection Algorithm for Sorted Sequences. In Proceedings of 15th Annual Symposium on Combinatorial Pattern Matching (CPM), 400-408, 2004.
2. Ricardo A. Baeza-Yates, Alejandro Salinger. Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences. In Proceedings of 12th International Conference on String Processing and Information Retrieval (SPIRE), 13-24, 2005.
3. 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 (SODA), 390-399, 2002.
4. Jon Louis Bentley and Andrew Chi-Chih Yao. An almost optimal algorithm for unbounded searching. Information Processing Letters, 5(3):82-87, 1976.
5. Daniel K. Blandford and Guy E. Blelloch. Compact Representations of Ordered Sets. ACM/SIAM Symposium on Discrete Algorithms (SODA), 11-19, 2004.
6. Erik D. Demaine, Thouis R. Jones, Mihai Patrascu. Interpolation search for non-independent data. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 529-530, 2004.
7. 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 (SODA), 743-752, 2000.
8. 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 (ALENEX), 91-104, 2001.
9. V. Estivill-Castro and Derick Wood. A survey of adaptive sorting algorithms. ACM Computing Surveys, 24(4) 441-476, 1992.
10. W. Frakes and R. Baeza-Yates. Information Retrieval Prentice Hall, 1992.
11. G. Gonnet, L. Rogers, and G. George. An algorithmic and complexity analysis of interpolation search. Acta Informatica, 13(1) 39-52, 1980.
12. Frank K. Hwang, Shen Lin. Optimal Merging of 2 Elements with n Elements. Acta Informatica, v.1, 145-158, 1971.
13. Frank K. Hwang, Shen Lin. A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets. SIAM Journal of Computing, v.1, 31-39, 1972.
14. Frank K. Hwang. Optimal M erging of 3 Elements with n Elements. SIAM Journal of Computing, v.9, 298-320, 1980.
15. U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches. In Proceedings of the 1st Symposium on Discrete Algorithms (SODA), 319-327, 1990.
16. Y. Perl, A. Itai, and H. Avni. Interpolation search-A log logn search. CACM, 21(7) 550-554, 1978.