Greedy list intersection

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 1033-1042

  Krauthgamer, Robert ^a,b   Mehta, Aranyak ^c   Raman, Vijayshankar ^b   Rudra, Atri ^d  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c GOOGLE INC   (United States)

^d UNIVERSITY AT BUFFALO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERSECTIONS; TECHNOLOGY;

CONJUNCTIVE QUERIES; DATA ENGINEERING; DATA-SETS; INTERNATIONAL CONFERENCES; NEW ALGORITHM;

TREES (MATHEMATICS);

EID: 52649158132     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497512     Document Type: Conference Paper

References (16)

1. I. Ilyas et al., "CORDS: automatic discovery of correlations and soft functional dependencies," in SIGMOD, 2004.
2. V. Markl et al., "Consistent selectivity estimation using maximum entropy," The VLDB Journal, vol. 16, 2007.
3. M. Stonebraker et al., "C-store: A column-oriented dbms," in VLDB, 2005.
4. M. Stillger, G. Lohman, V. Markl, and M. Kandil, "LEO: DB2's L.Earning Optimizer," in VLDB, 2001.
5. E. D. Demuiue, A. López-Ortiz. and J. I. Munro, "Adaptive set intersections, unions, and differences," in 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 2000.
6. _, "Experiments on adaptive set intersections for rext retrieval systems," in 3rd International Workshop on Algorithm Engineering and Experimentation (ALENEX), 2001.
7. C. Mohan et al., "Single table access using multiple indexes: Optimization, execution, and concurrency control techniques." in EDBT, 1990.
8. J. Barbay and C. Kenyon. "Adaptive intersection and t-threshold problems," in SODA, 2002.
9. J. Barbay, A. López-Ortiz, and T. Lu, "Faster adaptive set intersections for text searching," in Intl. Workshop on Experimental Algorithms, 2006.
10. V. Raman, L. Qiao, et al., "Lazy adaptive rid-list intersection and application to starjoins," in SIGMOD, 2007.
11. N. Bruno, N. Koudas, and D. Srivastava, "Holistic twig joins: Optimal XML pattern matching." in SIGMOD, 2002.
12. A. Balmin, T. Eliaz, J. Hornibrook, L. Lim, G. M. Lohman, D. Simmen, M. Wang, and C. Zhang, "Cost-based optimization in DB2 XML," IBM Systems Journal, vol. 45, no. 2, 2006.
13. U. Feige, L. Lovász, and P. Tetali, "Approximating min sum set cover," Algorithmica, vol. 40, no. 4. pp. 219-234, 2004.
14. K. Munagala, S. Babu, R. Motwani, and J. Widom, "The pipelined set cover problem." in 10th International Conference on Database Theory (ICDT), 2005.
15. R. Krauthgamer, A. Mehta, V. Raman, and A. Rudra, "Greedy list intersection." Department of Computer Science and Engineering, University at Buffalo, Tech. Rep. 2007-11, 2007. [Online]. Available. http://www.cse. buffalo.edu/tech reps.listing.shtml
16. V. Markl et al., "Robust Query Processing through Progressive Optimization." in SIGMOD, 2004.