An intelligent search method for query optimization by semijoins
- 1 June 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 1 (2) , 226-237
- https://doi.org/10.1109/69.87962
Abstract
The problem of finding an optimal semijoin sequence that fully reduces a given tree query is discussed. A method is presented that intelligently navigates the space of all semijoin sequences and returns an optimal solution. Experiments are reported that show that this method performs very efficiently: on average, less than 5% of the search space is searched before an optimal solution is found. Other advantages of the method are ease of implementation, generality of the cost mode considered, and ability to handle tree queries with arbitrary target lists.Keywords
This publication has 19 references indexed in Scilit:
- A state transition model for distributed query processingACM Transactions on Database Systems, 1986
- Optimization of distributed tree queriesJournal of Computer and System Sciences, 1984
- Distributed query processingACM Computing Surveys, 1984
- Query Optimization in Database SystemsACM Computing Surveys, 1984
- On the design of a query processing strategy in a distributed database environmentPublished by Association for Computing Machinery (ACM) ,1983
- Query optimization in star computer networksACM Transactions on Database Systems, 1982
- Using Semi-Joins to Solve Relational QueriesJournal of the ACM, 1981
- Optimal semijoin schedules for query processing in local distributed database systemsPublished by Association for Computing Machinery (ACM) ,1981
- Query Processing in Distributed Database SystemIEEE Transactions on Software Engineering, 1979
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968