Adaptive selection of access path and join method
暂无分享,去创建一个
[1] Theo Härder. Implementing a generalized access path structure for a relational database system , 1978, TODS.
[2] Michael Stonebraker,et al. Analysis of Distributed Data Base Processing Strategies , 1980, VLDB.
[3] Guy M. Lohman,et al. Index scans using a finite LRU buffer: a validated I/O model , 1989, ACM Trans. Database Syst..
[4] Gregory Piatetsky-Shapiro,et al. Accurate estimation of the number of tuples satisfying a condition , 1984, SIGMOD '84.
[5] Patricia G. Selinger,et al. Access path selection in a relational database management system , 1979, SIGMOD '79.
[6] Gio Wiederhold,et al. Estimating block accesses in database organizations: a closed noniterative formula , 1983, CACM.
[7] M. W. Blasgen,et al. Storage and Access in Relational Data Bases , 1977, IBM Syst. J..
[8] Michael Stonebraker,et al. Implementation techniques for main memory database systems , 1984, SIGMOD '84.
[9] Alfonso F. Cardenas. Analysis and performance of inverted data base structures , 1975, CACM.
[10] Clement T. Yu,et al. On the design of a query processing strategy in a distributed database environment , 1983, SIGMOD '83.
[11] S. B. Yao,et al. Approximating block accesses in database organizations , 1977, CACM.
[12] Robert B. Hagmann,et al. An Observation on Database Buffering Performance Metrics , 1986, VLDB.
[13] Patrick Valduriez,et al. Join indices , 1987, TODS.