Fast set intersection in memory

Proceedings of the VLDB Endowment

Volumn 4, Issue 4, 2011, Pages 255-266

  Ding, Bolin ^a   König, Arnd Christian ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXPECTED TIME; FUNDAMENTAL OPERATIONS; LINEAR SPACES; SET INTERSECTION; STATE-OF-THE-ART TECHNIQUES; SYNTHETIC AND REAL DATA;

SEARCH ENGINES;

EID: 83055178898     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1938545.1938550     Document Type: Article

References (23)

1. R. A. Baeza-Yates. A fast set intersection algorithm for sorted sequences. In CPM, pages 400-408, 2004.
2. R. A. Baeza-Yates and A. Salinger. Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences. In SPIRE, pages 13-24, 2005.
3. J. Barbay and C. Kenyon. Adaptive intersection and t-threshold problems. In SODA, pages 390-399, 2002.
4. J. Barbay, A. López-Ortiz, and T. Lu. Faster Adaptive Set Intersections for Text Searching. In 5th WEA, pages 146-157, 2006.
5. J. Barbay, A. Ĺopez-Ortiz, T. Lu, and A. Salinger. An experimental investigation of set intersection algorithms for text searching. ACM Journal of Experimental Algorithmics, 14:7-24, 2010.
6. P. Bille, A. Pagh, and R. Pagh. Fast Evaluation of Union-Intersection Expressions. In ISAAC, pages 739-750, 2007.
7. G. E. Blelloch and M. Reid-Miller. Fast Set Operations using Treaps. In ACM SPAA, pages 16-26, 1998.
8. A. Z. Broder, D. Carmel, M. Herscovici, A. Soffer, and J. Zien. Efficient query evaluation using a two-level retrieval process. In CIKM, pages 426-434, 2003.
9. M. R. Brown and R. E. Tarjan. A Fast Merging Algorithm. Journal of the ACM, 26(2):211-226, 1979.
10. J. Brutlag. Speed Matters for Google Web Search. http://code.google.com/speed/files/delayexp.pdf, 2009.
11. E. Chiniforooshan, A. Farzan, and M. Mirzazadeh. Worst case optimal union-intersection expression evaluation. In ALENEX, pages 179-190, 2001.
12. E. Demaine, A. Ĺopez-Ortiz, and J. Munro. Adaptive Set Intersections, Unions, and Differences. In SODA, pages 743-752, 2000.
13. E. Demaine, A. Ĺopez-Ortiz, and J. Munro. Experiments on Adaptive Set Intersections for Text Retrieval Systems. In ALENEX, pages 91-104, 2001.
14. D. P. Dubhashi and A. Panconesi. Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge, 2009.
15. R. Fagin, A. Lotem, and M. Naor. Optimal Aggregation Algorithms for Middleware. In PODS, pages 102-113, 2001.
16. F. K. Hwang and S. Lin. A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets. SIAM Journal, 1(1):31-39, 1972.
17. G. Linden. http://glinden.blogspot.com/2006/11/marissa-mayer-at-web-20.html.
18. W. Pugh. A skip list cookbook. Technical Report UMIACS-TR-89-72.1, University of Maryland, 1990.
19. P. Sanders and F. Transier. Intersection in Integer Inverted Indices. In ALENEX, pages 71-83, 2007.
20. S. Tatikonda, F. Junqueira, B. B. Cambazoglu, and V. Plachouras. On Efficient Posting List Intersection with Multicore Processors. In ACM SIGIR, pages 738-739, 2009.
21. F. Transier and P. Sanders. Compressed inverted indexes for in-memory search engines. In ALENEX, pages 3-12, 2008.
22. D. Tsirogiannis, S. Guha, and N. Koudas. Improving the performance of list intersection. PVLDB, 2(1):838-849, 2009.
23. I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes -Compressing and Indexing Documents and Images. Morgan Kaufman Publishers, 1999.