Skip to main content

Design and implementation of KARDAMOM — A set-oriented data flow database machine

  • Architecture
  • Conference paper
  • First Online:
Database Machines (IWDM 1989)

Abstract

Recently, several proposals for multiprocessor database machines have emerged. Most approaches focus upon the solution of the I/O-bottleneck or upon parallel algorithms for relational operations. Other crucial issues in such systems include communication between the software modules of the database management system which are distributed across the processors and efficient control of parallel query execution. In this paper, we argue that strictly set-oriented query execution and data flow control are appropriate mechanisms in order to minimize overheads for communication and control of execution. Then we give an overview of the design of the multiprocessor database machine KARDAMOM which integrates both concepts. An important feature is a two-level system architecture, where the upper level consists of those parts of the system which operate exclusively on tuple sets instead of pages. A dedicated storage manager is proposed which provides a uniform interface for the representation of tuple sets as well as for the exchange of tuple sets between different system components. Other important issues are related to query translation and optimization and to transaction management in a set-oriented environment.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Alexander, G. Copeland: Process and Dataflow Control in Distributed Data-Intensive Systems. Proc. ACM SIGMOD Int. Conf. on Management of Data, Chicago, June 1988

    Google Scholar 

  2. F. Bancilhon, M. Scholl: Design of a Backend Processor for a Data Base Machine. Proc. ACM SIGMOD Int. Conf. on Management of Data, Los Angeles, May 1980

    Google Scholar 

  3. R. Bayer: Integrity, Concurrency and Recovery in Databases. Lecture Notes in Computer Science 44, Springer, 1976, pp. 79–106

    Google Scholar 

  4. A. Bhide, M. Stonebraker: A Performance Comparison of Two Architectures for Fast Transaction Processing. Proc. 4th Int. Conf. on Data Engineering, Los Angeles, February 1988

    Google Scholar 

  5. G. v. Bültzingsloewen, C. Iochpe, R.-P. Liedtke, K.R. Dittrich, P.C. Lockemann: Two-Level Transaction Management in a Multiprocessor Database Machine. 3rd Int. Conf. on Data and Knowledge Bases, Jerusalem, 1988, pp. 374–386

    Google Scholar 

  6. G. v. Bültzingsloewen, R.-P. Liedtke, K. R. Dittrich: Set-Oriented Memory Management In A Multiprocessor Database Machine. Proc. 5th Int. Workshop on Database Machines, Karuizawa, October 1987, pp. 611–625

    Google Scholar 

  7. H. Boral, D.J. DeWitt: Applying Data Flow Techniques to Database Machines. IEEE Computer, August 1982, pp. 57–63

    Google Scholar 

  8. H. Boral, D.J. DeWitt: Data Base Machines: An Idea Whose Time Has Passed? In: H.-O. Leilich, M. Missikoff (eds.): Database Machines. Int. Workshop, Munich, September 1983, Springer-Verlag, 1983

    Google Scholar 

  9. G. v. Bültzingsloewen: Translating and Optimizing SQL Queries Having Aggregates. Proc. 13th Int. Conf. on Very Large Data Bases, Brighton, September 1987

    Google Scholar 

  10. G. Copeland, W. Alexander, E. Boughter, Tom Keller: Data Placement In Bubba. Proc. ACM SIGMOD Int. Conf. on Management of Data, Chicago, June 1988, pp. 99–108

    Google Scholar 

  11. P.Y. Chang: Parallel Processing and Data Driven Implementation of a Relational Database System. Proc. of the 1976 Conf. of the ACM, pp. 314–318

    Google Scholar 

  12. E.G. Coffmann (ed.): Computer and Job-Shop Scheduling Theory. John Wiley & Sons, 1976

    Google Scholar 

  13. U. Dayal: Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers. Proc. 13th Int. Conf. on Very Large Data Bases, Brighton, September 1987, pp. 197–208

    Google Scholar 

  14. D.J. DeWitt, R. Gerber: Multiprocessor Hash-Based Join Algorithms. Proc. 11th Int. Conf. on Very Large Data Bases, Stockholm, 1985

    Google Scholar 

  15. D.J. DeWitt et al.: GAMMA — A High Performance Dataflow Database Machine. Proc. 12th Int. Conf. on Very Large Data Bases, Kyoto, August 1986

    Google Scholar 

  16. S. Fushimi, M. Kitsuregawa, H. Tanaka: An Overview of The System Software of A Parallel Relational Database Machine GRACE. Proc. 12th Int. Conf. on Very Large Data Bases, Kyoto, August 1986

    Google Scholar 

  17. S. Gamerman, M. Scholl: Hardware versus Software Filtering: The VERSO Experience. Proc. 4th Int. Workshop on Database Machines, Grand Bahama Island, March 1985

    Google Scholar 

  18. M. Jarke, J. Koch: Range Nesting: A Fast Method to Evaluate Quantified Queries. Proc. ACM SIGMOD, San Jose, May 1983, pp. 196–206

    Google Scholar 

  19. J.R. Jordan, J. Banerjee, R.B. Batman: Precision Locks. Proc. ACM SIGMOD Int. Conf. on Management of Data, 1981

    Google Scholar 

  20. S. Khoshafian, P. Valduriez: Parallel Execution Strategies for Declustered Databases. In: M. Kitsuregawa, H. Tanaka (eds.): Database Machines and Knowledge Base Machines. Proc. 5th Int. Workshop, Karuizawa/Japan, October 1987, Kluwer Academic Publishers, 1988, pp. 458–471

    Google Scholar 

  21. W. Kiessling: Database Systems for Computers with Intelligent Subsystems: Architecture, Algorithms, Optimization. Report TUM-I8307, Technical University of Munich, Institute of Computer Science, August 1983 (in German)

    Google Scholar 

  22. W. Kiessling: Tuneable Dynamic Filter Algorithms for High Performance Database Systems. Proc. Int. Workshop on High Level Language Computer Architecture, 1984, pp. 10–20

    Google Scholar 

  23. M. Kitsuregawa, H. Tanaka, T. Moto-oka: Application of Hash To Data Base Machine and Its Architecture. New Generation Computing, Vol. 1, No. 1, 1983

    Google Scholar 

  24. M.K. Lee, J.C. Freytag, G.M. Lohman: Implementing an Interpreter for Functional Rules in a Query Optimizer. IBM Research Report RJ 6125, March 1988

    Google Scholar 

  25. E.A. Ozkarahan, M.A. Penaloza: On-the-Fly and Background Data Filtering System for Database Architectures. New Generation Computing, Vol. 5, No. 5, 1987, pp. 281–314

    Google Scholar 

  26. J. Pearl: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison Wesley, 1984

    Google Scholar 

  27. M. Stonebraker: The Case for Shared Nothing. Proc. Int. Workshop on High Performance Transaction Systems, Pacific Grove, CA, Sept. 1985

    Google Scholar 

  28. J.D. Ullman: Principles of Database Systems. 2nd Edition, Pitman, 1982

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Haran Boral Pascal Faudemay

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

von Bültzingsloewen, G. et al. (1989). Design and implementation of KARDAMOM — A set-oriented data flow database machine. In: Boral, H., Faudemay, P. (eds) Database Machines. IWDM 1989. Lecture Notes in Computer Science, vol 368. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51324-8_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-51324-8_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51324-7

  • Online ISBN: 978-3-540-46197-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics