Wcrl: A data model independent language for database systems

  • Sudhir K. Arora
  • K. C. Smith


The need for data model independent languages for database systems has become apparent in recent years. They can be used for the conceptual level of a database system, for communication in a distributed database system, for data restructuring, and so on. This paper proposes a language,wcrl, to fill this need and compares it with the very few other languages which have been developed almost concurrently to fill the same need.

Key words

Data retrieval database language data model independent language 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    ANSI/X3/SPARC Study Group on Data Base Management Systems Interim Report, FDT,ACM SIGMOD 7 (2) (1975).Google Scholar
  2. 2.
    A. V. Aho and J. D. Ullman, “Universality of data retrieval languages,”Sixth Annual ACM Symposium on Principles of Programming Languages, San Antonio, Texas (Jan. 1979), pp. 110–120.Google Scholar
  3. 3.
    S. K. Arora and K. C. Smith, “A theory of Well connected relations,”J. Inform. Sci. (accepted for publication).Google Scholar
  4. 4.
    P. Buneman and R. E. Frankel, “FQL-A Functional Query Language,”ACM SIGMOD, Boston (1979), pp. 52–58.Google Scholar
  5. 5.
    D. Chamberlin and R. Boyce, “SEQUEL: A Structured English Query Language,”ACM SIGMOD Workshop on Data Description, Access and Control (May 1974), pp. 249–264.Google Scholar
  6. 6.
    E. F. Codd, “Relational completeness of data base sublanguages,” inData Base Systems (R. Rustin, Ed.), Courant Computer Science Symposium (Prentice-Hall Englewood Cliffs, New Jersey, 1972), pp. 65–98.Google Scholar
  7. 7.
    A. L. Furtado and L. Kerschberg, “An algebra of quotient relations,”ACM SIGMOD, Toronto, (August 1977), pp. 1–9.Google Scholar
  8. 8.
    B. C. Housel, “QUEST: A High-Level Data Manipulation Language for Network, Hierarchical and Relational Databases,”IBM Res.Rep.RJ2588 (33488), 7/25/79 (1979).Google Scholar
  9. 9.
    L. Kerschberg, E. A. Ozkarahan and J. E. S. Pacheco, “A synthetic English query language for a relational associative processor,”Proceedings of the Second International Conference on Software Engineering, San Francisco (1976), pp. 505–519.Google Scholar
  10. 10.
    R. M. Pecherer, “Efficient evaluation of expressions in a relational algebra,”ACM Pacific 75 Regional Conference (April 1975), pp. 44–49.Google Scholar
  11. 11.
    M. E. Senko, “The DDL in the context of a multilevel structured description: DIAM II with FORAL,” inData Base Description, B. C. M. Douque and G. M. Nijssen, Eds. (North-Holland, Amsterdam, 1975), pp. 239–258.Google Scholar
  12. 12.
    J. M. Smith and P. Y. Chang, “Optimizing the performance of a relational algebra data base interface,”Comm. ACM 18: 568–579 (October 1975).Google Scholar
  13. 13.
    M. R. Stonebraker and E. Wong, “INGRESS: A relational data base system,”Proceedings of the AFIPS 1975 National Computer Conference, AFIPS Press, Montvale, New Jersey.Google Scholar
  14. 14.
    D. Tsichritzis, “LSL: A Link and Selector Language,”ACM SIGMOD, Washington, D. C. (June 1976), pp. 123–134.Google Scholar
  15. 15.
    J. D. Ullman,Principles of Database Systems, Computer Science Press, 1980.Google Scholar
  16. 16.
    M. Zloof, “Query by Example,”Proceedings of the AFIPS 1975 National Computer Conference, AFIPS Press, Montvale, New Jersey, pp. 431–445.Google Scholar

Copyright information

© Plenum Publishing Corporation 1980

Authors and Affiliations

  • Sudhir K. Arora
    • 1
  • K. C. Smith
    • 2
  1. 1.Department of Electrical and Computer EngineeringMcMaster UniversityHamiltonCanada
  2. 2.Department of Electrical EngineeringUniversity of TorontoTorontoCanada

Personalised recommendations