Skip to main content

An Abstract Database Machine for Cost Driven Design of Object-Oriented Database Schemas

  • Conference paper
  • First Online:
Advances in Databases and Information Systems (ADBIS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2151))

Abstract

The process of designing an object-oriented database schema consists of several phases. During the phase of abstract logical formalisation one of many possible abstract object-oriented database schemas must be chosen. This choice can be driven by the costs of the ultimately implemented schema: How much space is needed? How long does it take to compute queries and updates including enforcement of semantic constraints? Because abstract logical formalisation is done independently of an actual database management system, we need an abstract database machine. Queries and updates are formulated as programs for this database machine. Such programs are composed of steps which are connected by channels for typed streams of value lists. In each step, a basic or compound operation is executed, accepting input streams and further parameters, delivering output streams for subsequent steps, and accessing the persistent database state. The abstract database machine is designed to meet two goals: to be expressive enough to implement queries and updates, as considered for schema design, and to be simple enough to allow cost estimations.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. American National Standards Institute, 11 West 42nd Street, New York, NY, 10036. ANSI/ISO/IEC 9075-2-1999, Information Technology-Database Languages-SQL-Part 2: Foundation (SQL/Foundation), Dec. 8, 1999.

    Google Scholar 

  2. E. Bertino and P. Foscoli. On modeling cost functions for object-oriented databases. IEEE Transaction on Knowledge and Data Engineering, 9(3):500–508, May/June 1997.

    Google Scholar 

  3. J. Biskup. Database schema design theory: Achievements and challenges. In S. Bhalla, editor, Proc. of the 6th Intl. Conf. Information Systems and Management of Data, number 1006 in LNCS, pages 14–44, Bombay, 1995. Springer.

    Google Scholar 

  4. J. Biskup and R. Menzel An abstract database machine for cost driven design of object-oriented database schema. Technical Report, Universität Dortmund, 2001. http://ls6-www.cs.uni-dortmund.de/issi/archive/literature/2001/BiskupMenzel:2001.ps.gz

  5. J. Biskup, R. Menzel, and T. Polle. Transforming an entity-relationship schema into object-oriented database schemas. In J. Eder and L. A. Kalinichenko, editors, Advances in Databases and Information Systems, Moscow 95, Workshops in Computing, pages 109–136. Springer-Verlag, 1996.

    Google Scholar 

  6. R. G. G. Cattell and D. K. Barry, editors. The Object Data Standard: ODMG 3.0. Morgan Kaufmann, 2000.

    Google Scholar 

  7. A. Gupta and J. Widom. Local verification of global integrity constraints in distributed databases. In P. Buneman and S. Jajodia, editors, Proc. of the 1993 ACM SIGMOD Intl. Conf. on Management of Data, pages 49–58, 1993.

    Google Scholar 

  8. H. V. Jagadish and Xiaolei Qian. Integrity maintenance in an object-oriented database. In Li-Yan Yuan, editor, Proc. of the 18th Intl. Conf. on Very Large Data Bases, pages 469–480, British Columbia, Canada, 1992.

    Google Scholar 

  9. M. Kifer, G. Lausen, and J. Wu. Logical foundations of object-oriented and framebased languages. Journal of the ACM, 42(4):741–843, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  10. U. Lipeck. Transformation of dynamic integrity constraints into transaction specifications. Theoretical Computer Science, 76:115–142, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  11. W. W. McCune and L. J. Henschen. Maintaining state constraints in relational databases: A proof theoretic basis. Journal of the ACM, 36(1):46–68, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  12. J.-M. Nicolas. Logic for improving integrity checking in relational databases. Acta Informatica, 18(3):227–253, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  13. B. A. Nixon. Representing and using performance requirements during the development of information systems. In M. Jarke, J. Bubenko, and K. Jeffery, editors, Advances in Database Technology—EDBT’ 94, number 779 in LNCS, pages 187–200. Springer, 1994.

    Google Scholar 

  14. S. L. Osborn. Identity, equality and query optimization. In K. R. Dittrich, editor, Advances in Object-Oriented Database Systems, 2nd Intl. Workshop on Object-Oriented Database Systems, number 334 in LNCS, pages 346–351, Bad Münster am Stein-Ebernburg, Germany, Sept. 27–30, 1988. Springer-Verlag.

    Google Scholar 

  15. E. J. Shekita. High-Performance Implementation Techniques For Next-Generation Database Systems. PhD thesis, U. of Wisconsin, Madison, 1990.

    Google Scholar 

  16. M. Steeg. The conceptual database design optimizer CoDO-concepts, implementation, application. In B. Thalheim, editor, Proc. of the 15th Intl. Conf. on Conceptual Modeling, number 1157 in LNCS, pages 105–120, Cottbus, Germany, Oct. 7-10, 1996. Springer.

    Google Scholar 

  17. M. Steeg and B. Thalheim. A computational approach to conceptual database optimization. Technical report, BTU Cottbus, May 1995.

    Google Scholar 

  18. M. Stonebraker, P. Brown, and D. Moore. Object-Relational DBMSs: Tracking the Next Great Wave. Morgan Kaufmann, Second edition, 1999.

    Google Scholar 

  19. P. van Bommel. Experiences with EDO: An evolutionary database optimizer. Data & Knowledge Engineering, 13(1994):243–263, 1994.

    Google Scholar 

  20. P. van Bommel and T. P. van der Weide. Reducing the search space for conceptual schema transformation. Data & Knowledge Engineering, 8(1992):269–292, 1992.

    MATH  Google Scholar 

  21. B. Vance. An abstract object-oriented query execution language. In C. Beeri, A. Ohori, and D. E. Shasha, editors, Proc. of the Fourth Intl. Workshop on Data Base Programming Languages-Object Models and Languages, Workshops in Computing, pages 176–199, New York City, 30 Aug.-1 Sept. 1993. Springer.

    Google Scholar 

  22. F. Velez, G. Bernard, and V. Darnis. The O2 object manager: An overview. In P. M. G. Apers and G. Wiederhold, editors, Proc. of the 15th Intl. Conf. on Very Large Data Bases, pages 357–366, Amsterdam, 1989.

    Google Scholar 

  23. S. Bing Yao. Optimization of query evaluation algorithms. ACM Transactions on Database Systems, 4(2):133–155, June 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Biskup, J., Menzel, R. (2001). An Abstract Database Machine for Cost Driven Design of Object-Oriented Database Schemas. In: Caplinskas, A., Eder, J. (eds) Advances in Databases and Information Systems. ADBIS 2001. Lecture Notes in Computer Science, vol 2151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44803-9_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-44803-9_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44803-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics