Skip to main content
SpringerLink
Log in

Using structural recursion as query mechanism for data models with references

  • Session 3: Query Languages
  • Conference paper
  • First Online:
Conceptual Modeling — ER '96 (ER 1996)

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

Included in the following conference series:

  • 159 Accesses

Abstract

Despite the fact that nearly all important data models include a concept for (explicit) references or referencial integrity, a database query language that directly supports this kind of structures has not been presented yet. This paper proposes an algebraically well-founded query technique that allows generic functional queries and updates on complex data models with references. We use structural recursion on the algebraic representation of data structures as the basic tool to achieve that goal. Before approaching the case of references, we will investigate previous solutions for data models that do not include them. The generalization of these models directly leads to this new proposal.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Serge Abiteboul, Sophie Cluet, and Tova Milo. Querying and updating the file. In VLDB '93. International Conference on Very Large Databases, pages 73–84, Dublin, Ireland, August 1993.

    Google Scholar 

  2. Val Breazu-Tannen, Peter Buneman, and S. Naqvi. Structural recursion as a query language. In Proceedings of 3rd International Workshop on Database Programming Languages, pages 9–19, Naphlion, Greece, August 1991. Morgan Kaufmann Publishers, Inc.

    Google Scholar 

  3. Val Breazu-Tannen, Peter Buneman, and Limsoon Wong. Naturally embedded query languages. In Joachim Biskup and Richard Hull, editors, Database Theory-ICDT '92. 4th International Conference on Database Theory, Berlin, Germany, October 1992. Lecture Notes in Computer Science, 646. Springer-Verlag.

    Google Scholar 

  4. Peter Buneman, Leonid Libkin, Dan Suciu, Val Tannen, and Limsoon Wong. Comprehension syntax. SIGMOD Record, 23(1):87–96, March 1994.

    Google Scholar 

  5. R. G. G. Cattell, editor. The Object Database Standard: ODMG-93. Morgan Kaufmann Publishers, Inc., San Francisco, CA, 1994.

    Google Scholar 

  6. Sudarshan Chawathe, Hector Garcia-Molina, Joachim Hammer, Kelly Ireland, Yannis Papakonstantinou, Jeffrey Ullman, and Jennifer Widom. The TSIMMIS project: Integration of heterogeneous information sources. In Proceedings of the IPSJ Conference, Tokyo, Japan, October 1995.

    Google Scholar 

  7. Peter P. S. Chen. The entity-relationship model: Toward a unified view of data. ACM Transactions on Database Systems, 1(1), 1976.

    Google Scholar 

  8. E. F. Codd. A relational model for large shared data banks. Communications of the ACM, 13(6), 1970.

    Google Scholar 

  9. E. F. Codd. The Relational Model for Database Management: Version 2. Addison-Wesley, Reading, MA, 1990.

    Google Scholar 

  10. Leonidas Fegaras. A uniform calculus for collection types. Technical Report 94-030, Department of Computer Science and Engineering, Oregon Graduate Institute, Beaverton, OR 97006-1999, 1994. Electronic version found at ftp://cse.ogi.edu/pub/crml/papers.html.

    Google Scholar 

  11. Leonidas Fegaras and David Maier. Towards an effective calculus for object query languages. SIGMOD Record, 24(2):47–58, June 1995.

    Google Scholar 

  12. Carl A. Gunter. Semantics of Programming Languages: Structures and Techniques. The MIT Press, Cambridge, MA, 1992.

    Google Scholar 

  13. Jan van Leeuwen, editor. Handbook of Theoretical Computer Science. Elsevier Science Publishers B. V., Amsterdam, The Netherlands, 1990.

    Google Scholar 

  14. Leonid Libkin and Limsoon Wong. Query languages for bags. Technical Report MS-CIS-93-36, University of Pennsylvania, School of Engineering and Applied Science, Computer and Information Science Department, Philadelphia, PA 19104–6389, March 1993.

    Google Scholar 

  15. J. C. Mitchell. Type systems for programming languages. In van Leeuwen [13].

    Google Scholar 

  16. Yannis Papakonstantinou, Hector Garcia-Molina, and Jennifer Widom. Objectexchange accross heterogeneous information sources. In IEEE International Conference on Data Engineering, Taipei, Taiwan, March 1995.

    Google Scholar 

  17. Dzenan Ridjanovic and Michael L. Brodie. Defining database dynamics with attribute grammars. Information Processing Letters, 14(3): 132–138, May 1982.

    Google Scholar 

  18. Tim Sheard and Leonidas Fegaras. A fold for all seasons. In Proceedings of the 6th Conference on Functional Programming Languages and Computer Architecture, pages 233–242, Copenhagen, Denmark, June 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Brandenburg Technical University, PO Box 101344, D-03013, Cottbus

    Wolfram Clauss

Authors
  1. Wolfram Clauss
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bernhard Thalheim

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Clauss, W. (1996). Using structural recursion as query mechanism for data models with references. In: Thalheim, B. (eds) Conceptual Modeling — ER '96. ER 1996. Lecture Notes in Computer Science, vol 1157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019920

Download citation

  • DOI: https://doi.org/10.1007/BFb0019920

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-70685-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation