Skip to main content

Rekursion im MAD-Modell: Rekursivmoleküle als Objekte des Datenmodells

  • Conference paper

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 204))

Abstract

The molecule atom data-model (MAD model) supports the management of complex objects in a database. There are operations to retrieve, update, delete, and insert sets of dynamically defined objects. The object definitions may contain direct and indirect recursion. Thus, transitive closure computations are possible. In contrast to many proposals for the integration of recursion in a database system published earlier, the transitive closure together with its structure can be represented within the data model. Path problems can be solved by a choice of various aggregation and concatenation operators, which may be applied to the generalized transitive closure.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. Proceedings Datenbank-Systeme für Büro, Technik und Wissenschaft, Gl-Fachtagung, Karlsruhe, März 1985, Springer IFB 94.

    Google Scholar 

  2. Proceedings Datenbank-Systeme für Büro, Technik und Wissenschaft, Gl-Fachtagung, Darmstadt, April 1987, Springer IFB 136.

    Google Scholar 

  3. Dadam, P. et al.: A DBMS Prototype to Support Extended NF2-Relations: An Integrated View on Flat Tables and Hierarchies, in: Proc. ACM SIGMOD, Washington, DC, 1986, pp. 356–367.

    Google Scholar 

  4. Demo, B.: Recursive versus Iterative Schemes for Least Fix Point Computation in Logic Databases, in: Proc. Third Int. Conf. on Data Engineering, Los Angeles, California, Feb. 3–5, 1987, pp. 130–137.

    Google Scholar 

  5. Dayal, U., Smith, J.M.: PROBE: A Knowledge-Oriented Database Management System, in : Brodie, M.L., Mylopoulos, J. (eds.): On Knowledge Base Management Systems, Springer, 1986, pp 227–257.

    Chapter  Google Scholar 

  6. Härder, T., et al.: Datenstrukturen und Datenmodelle für den VLSI-Entwurf, Forschungsbericht 26/85 des SFB 124, Universität Kaiserslautern, 1985.

    Google Scholar 

  7. Härder, T. (ed.): The PRIMA Project — Design and Implementation of a Non–Standard Database System, Forschungsbericht 26/88 des SFB 124, Universität Kaiserslautem, 1988.

    Google Scholar 

  8. Härder, T., Meyer-Wegener, K., Mitschang, B., Sikeler, A.: PRIMA — A DBMS Prototype Supporting Engineering Applications, in: Proc. 13. Int. Conf on VLDB, Brighton, 1987, pp. 433–442.

    Google Scholar 

  9. Henschen, L.J., Naqvi, S.A.: On Compiling Queries in Recursive First-Order Databases, in: Journal of the ACM, Vol. 31, No. 1, January 1984, pp. 47–85.

    Article  MATH  MathSciNet  Google Scholar 

  10. Härder, T., Reuter, A.: Architektur von Datenbanksystemen für Non-Standard-Anwendungen, in /BTW85/, S. 253–286.

    Google Scholar 

  11. loannidis, Y.E.: On the Computation of the Transitive Closure of Relational Operators, in: Proc. 12. Int. Conf on VLDB, Kyoto, August 1986, pp. 403–411.

    Google Scholar 

  12. Kim, W., Chou, H-T., Banerjee, J.: Operations and Implementation of Complex Objects, in: Proc. Third Int. Conf. on Data Engineering, Los Angeles, California, Feb. 3–5, 1987, pp. 626–633.

    Google Scholar 

  13. Linnemann, V.: Non First Normal Form Relations and Recursive Queries: An SQL Based Approach, in: Proc. 3rd IEEE Int. Conf. on Data Engineering, Los Angeles, Feb. 1987, pp. 591–598.

    Google Scholar 

  14. Lu, H., Mikkilineni, K., Richardson, J.P.: Design and Evaluation of Algorithms to Compute the Transitive Closure of a Database Relation, in: Proc. Third Int. Conf. on Data Engineering, Los Angeles, California, Feb. 3–5, 1987, pp. 112–119.

    Google Scholar 

  15. Mitschang, B.: Charakteristiken des Komplex-Objekt-Begriffs und Ansätze zu dessen Realisierung, in:/BTW85/,S. 382–400.

    Google Scholar 

  16. Mitschang, B.: Ein Molekül-Atom-Datenmodell für Non-Standard-Anwendungen –Anwendungs-analyse, Datenmodellentwurf und Implementierungskonzepte, Dissertation, Universität Kaiserslauterm, 1988.

    Google Scholar 

  17. Reuter, A.: Kopplung von Datenbank– und Expertensystemen, in: Informationstechnik it, 29. Jg., Heft 3/87, S. 164–175.

    Google Scholar 

  18. Raschid, L., Su, S.Y.W.: A Parallel Processing Strategy for Evaluating Recursive Queries, in: Proc. 12. Int. Conf on VLDB, Kyoto, August 1986, pp. 412–419.

    Google Scholar 

  19. Stonebraker, M., Rowe, L.A.: The Design of POSTGRES, in: Proc. ACM SIGMOD, Washington, DC, 1986, pp. 340–355.

    Google Scholar 

  20. Scheck, HJ., Scholl, M.H.: The Relational Model with Relation-Valued Attributes, in: Information Systems, Vol. 11, No. 2, 1986, pp. 137–147.

    Google Scholar 

  21. Ullman: Implementation of Logical Query Languages for Databases, in: ACM TODS, Vol. 10, No. 3, pp. 289–321.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schöning, H. (1989). Rekursion im MAD-Modell: Rekursivmoleküle als Objekte des Datenmodells. In: Härder, T. (eds) Datenbanksysteme in Büro, Technik und Wissenschaft. Informatik-Fachberichte, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-74571-3_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-74571-3_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50894-6

  • Online ISBN: 978-3-642-74571-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics