Skip to main content
SpringerLink
Log in

(Time × space)-efficient implementations of hlerarchical conceptual models

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1988)

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

Included in the following conference series:

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. J.R. Abrial, "Data semantics", in Data Base Management Systems, North Holland, 1974.

    Google Scholar 

  2. R.P. Brent, "The parallel evaluation of general arithmetic expressions", JACM 21 (1974).

    Google Scholar 

  3. G. Bracchi, A. Fedeli, P. Paolini, "A relational data base management information system", Proc. 27th ACM Nat. Conf., 1972.

    Google Scholar 

  4. C.C. Gotlieb, A.L. Furtado, "Data schemata based on directed graphs", Int. J. Comp. Inf. Sci. 8 (1979).

    Google Scholar 

  5. R. Munz, "The WELL System: A multiuser database system based on binary relationships and graph pattern-matching", Information Systems 3 (1978).

    Google Scholar 

  6. N. Santoro, "Efficient abstract implementations for relational data structures", Ph.D. Thesis, Computer Science Department, University of Waterloo, 1979.

    Google Scholar 

  7. M.E. Senko, "DIAM II: The binary infological level", Proc. Conf. on Data Abstraction, Definition and Management, 1976.

    Google Scholar 

  8. N. Santoro, F.W. Tompa, "A formalism for describing conceptual models and their abstract implementations", preliminary draft, School of Computer Science, Carleton University, 1988.

    Google Scholar 

  9. F.W. Tompa, "Choosing an efficient interal schema", in Systems for Large Data Bases, North Holland, 1976.

    Google Scholar 

  10. F.W. Tompa, "Data structure design", in Data Structures for Computer Graphics and Pattern Recognition, Academic Press, 1979.

    Google Scholar 

  11. T. Tsuji, J. Toyoda, K. Tanaka, "Relational data graphs and some properties of them", J. Comp. Syst. Sci. 15 (1977).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carleton University, Ottawa, Canada

    Nicola Santoro

  2. Istituto di Scienze dell'Informazione, Universitá di Bari, Bari, Italy

    Nicola Santoro

Authors
  1. Nicola Santoro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Santoro, N. (1989). (Time × space)-efficient implementations of hlerarchical conceptual models. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1988. Lecture Notes in Computer Science, vol 344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50728-0_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-50728-0_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50728-4

  • Online ISBN: 978-3-540-46076-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation