Abstract
A heuristic query optimizer must choose the best way to process an incoming query. This choice is based on comparing the expected cost of many (or all) of the ways that a command might be processed. This expected cost calculation is determined by statistics on the sizes of the relations involved and the selectivities of the operations being performed. Of course, such estimates are subject to error, and in this paper we investigate the sensitivity of the best query plan to errors in the selectivity estimates. We treat the common case of join queries and show that the optimal plan for most queries is very insensitive to selectivity inaccuracies. Hence, there is little reason for a data manager to spend a lot of effort making accurate estimates of join selectivities.
- [CHRI83] Christodoulakis, S., "Estimating Block Transfers and Join Sizes," Proc. 1983 ACM-SIGMOD Conference on Management of Data, San Jose, CA. May 1983. Google ScholarDigital Library
- [DATE84] Date, C. J., A Guide to DB2, Addison-Wesley Publishing Co., 1986.Google Scholar
- [EPST80] Epstein, R. and Stonebraker, M., "Analysis of Distributed Database Processing Strategies," Proc. VLDB Conference, Montreal, Canada. Sept. 1980.Google Scholar
- [HELD75] Held, G., et. al., "INGRES: A Relational Database System," Proc. 1975 National Computer Conference, Anaheim, CA. June 1975.Google Scholar
- [KOOI82] Kooi, R. and Frankfurth, D., "Query Optimization in INGRES," IEEE Data-base Engineering, September 1982.Google Scholar
- [PIAT84] Piatetsky-Shapiro, G. and Connell, C., "Accurate Estimation of the Number of Tuples Satisfying a Condition," Proc. 1984 ACM-SIGMOD Conference on Management of Data, Boston, Mass. June 1984. Google ScholarDigital Library
- [ROWE83] Rowe, N., "Top Down Statistical Estimation on a Database," Proc. 1983 ACM-SIGMOD Conference on Management of Data, San Jose, CA. May 1983. Google ScholarDigital Library
- [SELI79] Selinger, P. et. al., "Access Path Selection in a Relational Database Management System," Proc. 1979 ACM-SIGMOD Conference on Management of Data, Boston, Mass., June 1979. Google ScholarDigital Library
Index Terms
- The effect of join selectives on optimal nesting order
Recommendations
Multi-way spatial join selectivity for the ring join graph
Efficient spatial query processing is very important since the applications of the spatial DBMS (e.g. GIS, CAD/CAM, LBS) handle massive amount of data and consume much time. Many spatial queries contain the multi-way spatial join due to the fact that ...
Coral: federated query join order optimization based on deep reinforcement learning
AbstractThe rise of diversified data engines has created the need for federated queries. A federated query can take a query and provide data analysis based on data from various data engines. Since the query data originates from multiple data engines, ...
Comments