A Fast Set Intersection Algorithm for Sorted Sequences-Reference-Cited by-同舟云学术

A Fast Set Intersection Algorithm for Sorted Sequences

Published:2004 Issue: Volume: Page:400-408
ISSN:0302-9743
Container-title:Combinatorial Pattern Matching
language:
Short-container-title:

Author:

Baeza-Yates Ricardo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-27801-6_30.pdf

Reference15 articles.

1. Baeza-Yates, R.A.: Efficient Text Searching. PhD thesis, Dept. of Computer Science, University of Waterloo, Also as Research Report CS-89-17 (May 1989)

2. Baeza-Yates, R., Bradford, P.G., Culberson, J.C., Rawlins, G.J.E.: The Complexity of Multiple Searching (1993)(unpublished manuscript)

3. Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval, p. 513. ACM Press/Addison-Wesley (1999)

4. Lecture Notes in Computer Science;R. Baeza-Yates,2003

5. Baeza-Yates, R.: Query Usage Mining in Search Engines. In: Scime, A. (ed.) Web Mining: Applications and Techniques, Idea Group (2004)

Cited by 39 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Aggregated Boolean Query Processing for Document Retrieval in Edge Computing;Electronics;2022-06-19

2. A New Fast Intersection Algorithm for Sorted Lists on GPU;Journal of Information Technology Research;2022-04-29

3. Accelerating All-Edge Common Neighbor Counting on Three Processors;Proceedings of the 48th International Conference on Parallel Processing;2019-08-05

4. Efficient set containment join;The VLDB Journal;2018-05-11

5. Dyna: toward a self-optimizing declarative language for machine learning applications;Proceedings of the 1st ACM SIGPLAN International Workshop on Machine Learning and Programming Languages;2017-06-18