Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences-Reference-Cited by-同舟云学术

Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences

Published:2005 Issue: Volume: Page:13-24
ISSN:0302-9743
Container-title:String Processing and Information Retrieval
language:
Short-container-title:

Author:

Baeza-Yates Ricardo,Salinger Alejandro

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11575832_2.pdf

Reference15 articles.

1. Lecture Notes in Computer Science;R. Baeza-Yates,2004

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

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

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

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

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

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

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

3. SIMD-Based Multiple Sets Intersection with Dual-Scale Search Algorithm;Proceedings of the 2017 ACM on Conference on Information and Knowledge Management;2017-11-06

4. Inverted Treaps;ACM Transactions on Information Systems;2017-06-09

5. Set containment join revisited;Knowledge and Information Systems;2015-10-26