Abstract
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire database in a unique graph-based structure, called DBGraph, it fully exploits the direct-access capability of main memory systems. Complex database queries can be processed in either set-oriented or pipelined mode depending on the way the DBGraph is traversed. In this paper we concentrate on the pipelined mode. Its advantages are the ability to produce result tuples as early as possible (during query processing) and the low cost of memory utilization in managing temporary results. We analyze different strategies for translating a query into a pipelined program and compare their performance with the set-oriented mode. Based on these results, we propose a compiler/optimizer algorithm translating relational queries into an optimal pipelined program.
This work has been partially funded by the Esprit project Stretch n∘ 2443.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Agrawal R., Bargia A., and Jagadish H.V., “Efficient Management of Transactions Relationships in Large Data and Knowlage Bases”, Proc.of ACM SIGMOD,Portland,June 1989.
Ammann A., Hanrahan M., and Krishnamurthy R., “Design of a Memory Resident DBMS”, IEEE COMPCON, San Fransisco, California, February 1985.
Bitton D., Turbyfill C., “Performance Evaluation of Main Memory Database Systems”, Cornell University, TR 86-731.
G. Copeland, S. Khoshafian, “The Decomposition Storage Model”, ACM SIGMOD Int. Conf., Austin, May 1985.
DeWitt D., Katz R., Olken F., Shapiro L., Stonebraker M., Wodd D., “Implementation Techniques for Main Memory Database Systems”, ACMSIGMOD Int. Conf., Boston, June 1984.
Eich M.H., “Main Memory Database Research Directions”, Int. Workshop on Database Machines, Deauville, France, June 1989.
Gibbons A., “Algorithmic Graph Theory”, Cambridge University Press, 1985.
Hammer M.,Niamir B.,”A heuristic approach to attribute partitioning”,Proc.ofACMSIGMOD,1979.
Lehman T., Carey M., “A Study of Index Structures for Main Memory Database Management Systems”, Int. Conf. on VLDB, Kyoto, Japan, August 1986.
Lehman T., Carey M., “Query Processing in Main Memory Database Management Systems”, ACM SIGMOD Int. Conf., Washington, D.C., May 1986.
Missikov M., Scholl M., “Relational Queries in a Domain Based DBMS”, ACM SIGMOD Int. Conf., San Jose, May 1983.
Pucheral P., Thévenin J.M., Valduriez P., “Efficient Main Memory Data Management Using the DBGraph Storage Model”, Int Conf. on VLDB, Brisbane, Australia, August 1990.
Shekita E., Carey M., “A Performance Evaluation of Pointer-Based Joins”, ACM SIGMOD Int. Conf., Atlantic City, New Jersey, May 1990.
Ullman J., “Principle of Database Systems”, Computer Science Press, 1982.
Valduriez P., Khoshafian S., Copeland G., “Implementation Techniques of Complex Objects”, Int. Conf. on VLDB, Kyoto, August 1986.
Valduriez P., “Join Indices”, ACM TODS, Vol. 12, No 2, June 87.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pucheral, P., Thévenin, J.M. (1992). Pipelined query processing in the DBgraph storage model. In: Pirotte, A., Delobel, C., Gottlob, G. (eds) Advances in Database Technology — EDBT '92. EDBT 1992. Lecture Notes in Computer Science, vol 580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032452
Download citation
DOI: https://doi.org/10.1007/BFb0032452
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55270-3
Online ISBN: 978-3-540-47003-8
eBook Packages: Springer Book Archive