S. Bing Yao
ABSTRACT
An evaluation system which estimates the performance of database access paths is presented. The system is based on a generalized model of access paths and is applicable to most access paths for searching a database system. The study brings to light many subtle but important parameters which can have a significant effect on the performance of the access paths, and which, then, must be taken into consideration in the selection of such paths.
- Astrahan, M. M. and D. D. Chamberlin, "Implementation of a structured English query language," Comm. ACM, Vol. 18, No. 10 (Oct.1975), pp. 580-588. Google Scholar
Digital Library
- Astrahan, M. M. et al, "System R: A relational approach to data base management," ACM Trans. on Database Systems, Vol. 1, No. 2 (June 1976). pp. 97-137. Google ScholarDigital Library
- Blasgen, M. W. and K. P. Eswaren, On the evaluation of queries in a data base system, IBM Research Report FJ 1945, IBM Research Laboratory, San Jose, California, 95193 (April 1976).Google Scholar
- Blasgen, M. W. and K. P. Eswaren, "Storage access in relational data bases," IBM Systems J., No. 4, 1977, pp. 363-377.Google Scholar
- Cardenas, A. F., "Analysis and performance of inverted data base structures," Comm. ACM, Vol. 18, No. 5 (May 1975), pp. 253-263. Google ScholarDigital Library
- Codd, E. F., "A relational model of data for large shared data banks," Comm. ACM, Vol. 13, No. 6 (June 1970), pp. 377-387. Google ScholarDigital Library
- Date, C. J., An Introduction to Database Systems, Addison-Wesley, 1977. Google ScholarDigital Library
- Gotleib, L., "Computing joins of relations." Proc. ACM-SIGMOD Conf., San Jose, California, May 1975, New York: ACM, pp. 53-63. Google ScholarDigital Library
- Hsiao, D. and F. Harary, "A formal system for information retrieval from files," Comm. ACM, Vol. 13. No. 2 (Feb 1970), pp. 67-73; "Corrigendum," Comm. ACM, Vol. 13, No. 4 (April 1970), p. 266. Google ScholarDigital Library
- Information Management System, General Information Manual, Form GH20-0765, IBM Corp., Data Processing Division, White Plains,NY 10604.Google Scholar
- Knuth, D. E., The Art of Computer Programming, Vol. 3 Sorting and Searching, Addison-Wesley, 1973. Google ScholarDigital Library
- Palermo, E. P., "A data base search problem," Proc. 4th Int'l Symposium of Computers and Information Science, Miami Beach, Fla., Dec. 1972.Google Scholar
- Pecherer, R. M., "Efficient evaluation of expressions in a relational algebra," Proc. ACM Pacific 75 Conf., April 1975, pp. 44-49.Google Scholar
- Rothnie, J. B., "Evaluating inter-entry retrieval expressions in a relational data base management system," Proc. AFIPS 1975 NCC, Vol. 44, Montvale, NJ; AFIPS, pp. 417-423.Google Scholar
- Severance, D. G., "Some generalized modeling structures for use in design of file organizations," Ph.D.Diss,U of Mich/Ann Arbor,1975. Google ScholarDigital Library
- Smith, J. M., and P. Y. T. Chang, "Optimizing the performance of a relational algebra and database interface," Comm. ACM, Vol. 18, No. 10 (October 1975), pp. 568-579. Google ScholarDigital Library
- Stonebraker, M., E. Wong, P. Kreps and G. Held, "The Design and Implementation of INGRES," ACM Transactions on Database Systems, Vol. 1, No. 3 (Sept. 1976). pp. 189-222. Google ScholarDigital Library
- Wong, E. and K. Youssefi, "Decomposition--a strategy for query processing," ACM Trans. on Database Systems, Vol. 1, No. 3 (Sept 1970, pp. 223-241. Google ScholarDigital Library
- Yao, S. B., "An attribute-based model for database access cost analysis," ACM Transactions on Database Systems, Vol. 2, No. 1 (March 1977). pp. 45-67. Google ScholarDigital Library
- Yao, S. B., "Approximating block accesses in data base organizations," Comm. ACM, Vol. 20, No. 4 (April 1977), pp. 260-261. Google ScholarDigital Library
- Yao, S. B., "Optimization of query evaluation algorithms," January 1978 (submitted for publication).Google Scholar
- Evaluation of database access paths
Recommendations
Conceptual database security access permissions
EC'09: Proceedings of the 10th WSEAS international conference on evolutionary computingHigh-level conceptual database design is a widespread method in database built with conceptual models we will illustrate the "mini world" of the database via Database Management System (DBMS) in an independent form. The form will be mapped by the use of ...
Improved algorithms for the k simple shortest paths and the replacement paths problems
Given a directed, non-negatively weighted graph G=(V,E) and s,t@?V, we consider two problems. In the k simple shortest paths problem, we want to find the k simple paths from s to t with the k smallest weights. In the replacement paths problem, we want ...
Role-Based Access Control for Grid Database Services Using the Community Authorization Service
In this paper, we propose a role-based access control (RBAC) method for Grid database services in Open Grid Services Architecture-Data Access and Integration (OGSA-DAI). OGSA-DAI is an efficient Grid-enabled middleware implementation of interfaces and ...
Comments