Improving the performance of list intersection

Proceedings of the VLDB Endowment

Volumn 2, Issue 1, 2009, Pages 838-849

  Tsirogiannis, Dimitris ^a   Guha, Sudipto ^b   Koudas, Nick ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY NUMBER; CHIP MULTIPROCESSOR; DOCUMENT IDENTIFIERS; DYNAMIC PROBES; EXPERIMENTAL EVALUATION; HARDWARE ARCHITECTURE; INTERSECTION ALGORITHMS; NON-UNIFORM DISTRIBUTION;

PROBES;

EID: 77954064857     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1687627.1687722     Document Type: Article

References (28)

1. A. Ailamaki, D. J. DeWitt, M. D. Hill, and D. A. Wood. DBMSs on a modern processor: Where does time go? In VLDB, pp. 266-277, 1999.
2. AMD. Multi-core processors - the next evolution in computing, AMD white paper, 2005.
3. R. A. Baeza-Yates. A fast set intersection algorithm for sorted sequences. LNCS, 3109:400-408, 2004.
4. R. A. Baeza-Yates and B. A. Ribeiro-Neto. Modern Information Retrieval. ACM Press / Addison-Wesley, 1999.
5. R. A. Baeza-Yates and A. Salinger. Experimental analysis of a fast intersection algorithm for sorted sequences. In SPIRE, pp. 13-24, 2005.
6. N. Bansal and N. Koudas. Blogscope: A system for online analysis of high volume text streams. In VLDB, pp. 1410-1413, 2007.
7. J. Barbay and C. Kenyon. Adaptive intersection and t-threshold problems. In SODA, pp. 390-399, 2002.
8. J. Barbay, A. Lopez-Ortiz, and T. Lu1. Faster adaptive set intersections for text searching. LNCS, 4007:146-157, 2006.
9. J. L. Bentley and A. C.-C. Yao. An almost optimal algorithm for unbounded searching. Information Processing Letters, 5:82-87, 1976.
10. S. Chen, A. Ailamaki, P. B. Gibbons, and T. C. Mowry. Inspector joins. In VLDB, pp. 817-828, 2005.
11. J. Cieslewicz and K. A. Ross. Adaptive aggregation on chip multiprocessors. In VLDB, pp. 339-350, 2007.
12. G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava. Spaceand time-efficient deterministic algorithms for biased quantiles over data streams. In PODS, pp. 263-272, 2006.
13. E. D.Demaine, A. L. Ortiz, and J. I. Munro. Adaptive set intersections, unions, and differences. In SODA, pp. 743-752, 2000.
14. E. D. Demaine, A. López-Ortiz, and J. I. Munro. Experiments on adaptive set intersections for text retrieval systems. In ALENEX, pp 91-104, 2001.
15. D. J. DeWitt, J. F. Naughton, and D. A. Schneider. Parallel sorting on a shared-nothing architecture using probabilistic splitting. In Parallel and Distributed Information Systems, pp. 280-291, 1991.
16. B. Gedik, P. S. Yu, and R. R. Bordawekar. Executing stream joins on the cell processor. In VLDB, pp. 363-374, 2007.
17. J. Gray, P. Sundaresan, S. Englert, K. Baclawski, and P. J. Weinberger. Quickly generating billion-record synthetic databases. In SIGMOD, pp. 243-252, 1994.
18. M. B. Greenwald and S. Khanna. Power-conserving computation of order-statistics over sensor networks. In PODS, pp. 275-285, 2004.
19. F. K. Hwang and S. Lin. Optimal merging of 2 elements with n elements. Acta Informatica, 1(2):145-158, 1971.
20. F. K. Hwang and S. Lin. A simple algorithm for merging two disjoint linearly ordered sets. SIAM Journal on Computing, 1(1):31-39, 1972.
21. Intel. Intel multi-core processor architectur development backgrounder, white paper, 2005.
22. B. R. Iyer, G. R. Ricard, and P. J. Varman. Percentile finding algorithm for multiple sorted runs. In VLDB, pp. 135-144, 1989.
23. R. Kalla, B. Sinharoy, and J. M. Tendler. IBM POWER5 chip: A dual-core multithreaded processor. IEEE Micro, 24(2):40-47, 2004.
24. S. Manegold, P. A. Boncz, and M. L. Kersten. Generic database cost models for hierarchical memory systems. In VLDB, pp. 191-202, 2002.
25. G. S. Manku, S. Rajagopalan, and B. G. Lindsay. Approximate medians and other quantiles in one pass and with limited memory. In SIGMOD, pp. 426-435, 1998.
26. C. Nyberg, T. Barclay, Z. Cvetanovic, J. Gray, and D. Lomet. Alphasort: a risc machine sort. In SIGMOD, pp. 233-242, 1994.
27. V. Raman, L. Qiao, W. Han, I. Narang, Y.-L. Chen, K.-H. Yang, and F.-L. Ling. Lazy, adaptive RID-list intersection, and its application to index anding. In SIGMOD, pp. 773-784, 2007.
28. A. Shatdal, C. Kant, and J. F. Naughton. Cache conscious algorithms for relational query processing. In VLDB, pp. 510-521, 1994.