A polynomial time algorithm for optimizing join queries
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 345-354
- https://doi.org/10.1109/icde.1993.344047
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Randomized algorithms for optimizing large join queriesPublished by Association for Computing Machinery (ACM) ,1990
- Optimization of large join queries: combining heuristics and combinatorial techniquesPublished by Association for Computing Machinery (ACM) ,1989
- Optimization of large join queriesPublished by Association for Computing Machinery (ACM) ,1988
- Query optimization by simulated annealingPublished by Association for Computing Machinery (ACM) ,1987
- A state transition model for distributed query processingACM Transactions on Database Systems, 1986
- On the optimal nesting order for computing N -relational joinsACM Transactions on Database Systems, 1984
- Access path selection in a relational database management systemPublished by Association for Computing Machinery (ACM) ,1979