Sakti Pramanik
Abstract
A graph model is presented to analyze the performance of a relational join. The amount of page reaccesses, the page access sequence, and the amount of buffer needed are represented in terms of graph parameters. By using the graph model formed from the index on the join attributes, we determine the relationships between these parameters. Two types of buffer allocation strategies are studied, and the upper bound on the buffer size with no page reaccess is given. This bound is shown to be the maximum cut value of a graph. Hence, the problem of computing this upper bound is NP-hard. We also give algorithms to determine a page access sequence requiring a near optimal buffer size with no page reaccess. The optimal page access sequence for a fixed buffer size has also been considered.
- 1 BABB, E. Implementing a relational database by means of specialized hardware. ACM Trans. Database Syst. 1 (1979). Google Scholar
Digital Library
- 2 BAYER, R., AND MCCREIGHT, E.M. Organization and maintenance of large ordered indexes. Acta Inf. 1, 3 (1972).Google ScholarDigital Library
- 3 BLASGEN,NB.W., AND EASWARAN,K.P. storage and access in relational database.IBM Syst. J.16,4(1977).Google Scholar
- 4 FARLEY, A., AND PROSKUROWSKI, A. Two directed maximal-cut problems'. In Proceedings of the west coast conference on combinatotics,graph theory and computation,(1979).Google Scholar
- 5 GOTLIEB, L. Computing join of relations. In Proceedings of the A CM-SIGMOD Conference, (San Jose, Calif., May 1975). ACM, New York. Google ScholarDigital Library
- 6 KARP, R.M. Reducibility among combinatorial problems. In Complexi~ of Computer Computations, R. E. Miller and J. W. Thatcher, Eds., Plenum Press, 1972.Google Scholar
- 7 KUNG, H. T., AND LEHMAN, D.L. Systolic (VLSI) arrays for relational database operations. In Proceedings of the ACM-SIGMOD Conference, (1980), ACM, New York. Google ScholarDigital Library
- 8 MENON, M. J., AND HSIAO, D.K. Design and analysis of a relational join operation for VLSI. In Proceedings 7th International Conference on Very Large Data Bases, (Cannes, France, 1981).Google Scholar
- 9 MERRETT, T., KAMBAYASHI, Y., AND YASUURA, H. Scheduling of page-fetches in join operations. In Proceedings 7th International Con/ernce on Very Large Data Bases, (Cannes, France, 1981).Google Scholar
- 10 OZKARAHAN, E. A., SCHUSTER, S. A., AND SMITH, K.C. RAP-associative processor for database management. In AFIPS National Computer Conference Proceedings, Vol. 44, (1975).Google Scholar
- 11 PRAMANIK, S. Implementing set-theoretic relational query functions using highly parallel indexprocessing hardware. In AFIPS National Computer Conference Proceedings, (1983).Google Scholar
- 12 PRAMANIK, S., AND ITTNER, D. A solution to the general maximum cut problem. In 1984 Conference on Information Sciences and Systems, (Princeton, N.J.).Google Scholar
- 13 SHAw, D. A relational database machine architecture. In Proceedings of the 5th Annual Workshop on Computer Architecture for Non-Numeric Processing, {Pacific Grove, Calif., 1980). Google ScholarDigital Library
- 14 Su, S., LIPOVSK~, Y. W., AND JACK, G. CASSM: A cellular system for very large databases, in Proceedings of the International Conference on Very Large Databases, (1975).Google Scholar
- 15 YAO, S. B., AND TONG, F. Design of a two-dimensional join processor array, in Proceedings of the 6th Workshop on Computer Architecture {or Non-Numerical Processing, (Hyeres, France, 1981).Google Scholar
Index Terms
- Use of graph-theoretic models for optimal relational database accesses to perform join
Recommendations
An authorization mechanism for a relational database system
A multiuser database system must selectively permit users to share data, while retaining the ability to restrict data access. There must be a mechanism to provide protection and security, permitting information to be accessed only by properly authorized ...
Optimal Secondary Storage Access Sequence for Performing Relational Join
Two graph models are developed to determine the minimum required buffer size for achieving the theoretical lower bound on the number of disk accesses for performing relational joins. Here, the lower bound implies only one disk access per joining block ...
Reviews
Alan Raymond Hevner
The paper studies buffer management strategies for performing relational join operations. The relations are stored in pages on secondary storage and indexes are available on all join attributes. Using graph-theoretic models, the tradeoff between the number of page accesses and the amount of internal buffer storage is analyzed. Several algorithms are given that find page access sequences. These sequences are designed either to minimize the number of page accesses or to minimize buffer requirements. The results of the paper are presented concisely and will be of interest to designers of relational database systems.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments