Optimizing large join queries in mediation systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1540, Issue , 1998, Pages 348-364

  Yerneni, Ramana ^a   Li, Chen ^a   Ullman, Jeffrey ^a   Garcia Molina, Hector ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA INTEGRATION;

CONJUNCTIVE QUERIES; DATA INTEGRATION SYSTEM; GREEDY STRATEGIES; HETEROGENEOUS ENVIRONMENTS; MEDIATION SYSTEMS; QUERY CAPABILITIES; SIMPLE COST MODEL; WORST-CASE PERFORMANCE;

QUERY PROCESSING;

EID: 84947235770     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (32)

1. P. Apers, A. Hevner, S. Yao. Optimization Algorithms for Distributed Queries. In IEEE Trans. Software Engineering, 9(1), 1983.
2. P. Bernstein, N. Goodman, E. Wong, C. Reeve, J. Rothnie. Query Processing in a System for Distributed Databases (SDD-1). In ACM Trans. Database Systems, 6(4), 1981.
3. S. Chawathe, H. Garcia-Molina, J. Hammer, K. Ireland, Y. Papakonstantinou, J. Ullman, J. Widom. The TSIMMIS project: Integration of heterogeneous information sources. In IPSJ, Japan, 1994.
4. S. Cluet, G. Moerkotte. On the Complexity of Generating Optimal Left-deep Processing Trees with Cross Products. In ICDT Conference, 1995.
5. R. Epstein, M. Stonebraker. Analysis of Distributed Database Strategies. In VLDB Conference, 1980.
6. C. Galindo-Legaria, A. Pellenkoft, M. Kersten. Fast, Randomized Join Order Selection - Why Use Transformations? In VLDB Conference, 1994.
7. M. Garey, D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
8. L. Haas, D. Kossman, E.L. Wimmers, J. Yang. Optimizing queries across diverse data sources. In VLDB Conference, 1997.
9. J. Hammer, H. Garcia-Molina, S. Nestorov, R. Yerneni, M. Breunig, V. Vassalos. Template-Based Wrappers in the TSIMMIS System. In SIGMOD Conference, 1997.
10. T. Ibaraki, T. Kameda. On the Optimal Nesting Order for Computing N-relational Joins. In ACM Trans. Database Systems, 9(3), 1984.
11. Y. Ioannidis, Y. Kang. Randomized Algorithms for Optimizing Large Join Queries. In SIGMOD Conference, 1990.
12. Y. Ioannidis, E. Wong. Query Optimization by Simulated Annealing. In SIGMOD Conference, 1987.
13. R. Krishnamurthy, H. Boral, C. Zaniolo. Optimization of Non-recursive Queries. In VLDB Conference, 1986.
14. A. Levy, A. Rajaraman, J. Ordille. Querying Heterogeneous Information Sources Using Source Descriptions. In VLDB Conference, 1996.
15. C. Li, R. Yerneni, V. Vassalos, H. Garcia-Molina, Y. Papakonstantinou, J. Ullman, M. Valiveti. Capability Based Mediation in TSIMMIS. In SIGMOD Conference, 1998.
16. K. Morris. An algorithm for ordering subgoals in NAIL!. In ACM PODS, 1988.
17. K. Ono, G. Lohman. Measuring the Complexity of Join Enumeration in Query Optimization. In VLDB Conference, 1990.
18. C. Papadimitriou, K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.
19. Y. Papakonstantinou, A. Gupta, L. Haas. Capabilities-based Query Rewriting in Mediator Systems. In PDIS Conference, 1996.
20. A. Pellenkoft, C. Galindo-Legaria, M. Kersten. The Complexity of Transformation-Based Join Enumeration. In VLDB Conference, 1997.
21. W. Scheufele, G. Moerkotte. On the Comlexity of Generating Optimal Plans with Cartesian Products. In PODS Conference, 1997.
22. P. Selinger, M. Adiba. Access Path Selection in Distributed Databases Management Systems. In Readings in Database Systems. Edited by M. Stonebraker. Morgan-Kaufman Publishers, 1994.
23. M. Steinbrunn, G. Moerkotte, A. Kemper. Heuristic and Randomized Optimization for the Join Ordering Problem. In VLDB Journal, 6(3), 1997.
24. A. Swami. Optimization of Large Join Queries: Combining Heuristic and Combinatorial Techniques. In SIGMOD Conference, 1989.
25. A. Swami, A. Gupta. Optimization of Large Join Queries. In SIGMOD Conference, 1988.
26. A. Tomasic, L. Raschid, P. Valduriez. Scaling Heterogeneous Databases and the Design of Disco. In Int. Conf. on Distributed Computing Systems, 1996.
27. J. Ullman. Principles of Database and Knowledge-base Systems, Volumes 1, 2. Computer Science Press, Rockville MD.
28. J. Ullman, M. Vardi. The Complexity of Ordering Subgoals. In ACM PODS, 1988.
29. B. Vance, D. Maier. Rapid Bushy Join-Order Optimization with Cross Products. In SIGMOD Conference, 1996.
30. V. Vassalos, Y. Papakonstantinou. Describing and using query capabilities of heterogeneous sources. In VLDB Conference, 1997.
31. G. Wiederhold. Mediators in the Architecture of Future Information Systems. In IEEE Computer, 25:38-49, 1992.
32. R. Yerneni, C. Li, J. Ullman, H. Garcia-Molina. Optimizing Large Join Queries in Mediation Systems. http://www-db.stanford.edu/pub/papers/ljq.ps