Access Path Selection in a Relational Database Management System
cost-based optimisation, and dynamic programming over join orders
Read it
EnglishTiếng Việt (abstract only)
- 8 sections
- 0 figures
- 0 equations
- 0 references
- cited by 1 here
- difficulty 4 of 5
- the publisher's page
Contents
- 1Introduction
- 2Processing of an SQL statement
- 3The Research Storage System
- 4Costs for single relation access paths
- 5Access path selection for joins
- 6Nested Queries
- 7Conclusion