skip to main content
article
Free Access

SYSTEM/U: a database system based on the universal relation assumption

Published:01 September 1984Publication History
Skip Abstract Section

Abstract

System/U is a universal relation database system under development at Standford University which uses the language C on UNIX. The system is intended to test the use of the universal view, in which the entire database is seen as one relation. This paper describes the theory behind System/U, in particular the theory of maximal objects and the connection between a set of attributes. We also describe the implementation of the DDL (Data Description Language) and the DML (Data Manipulation Language), and discuss in detail how the DDL finds maximal objects and how the DML determines the connection between the attributes that appear in a query.

References

  1. 1 AHO, A.V. Private communication, June 1981.]]Google ScholarGoogle Scholar
  2. 2 AHO, A. V., BEERI, C., AND ULLMAN, J.D. The theory of joins in relational databases. ACM Trans. Database Syst. 4, 3 (1979), 297-314.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 ATZENI, P., AND PARKER, D.S. Assumptions in relational database theory. In Proceedings ACM Symposium on the Principles of Database Systems (Los Angeles, Mar. 29-31, 1982), 1-9.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 BEERI, C., FAGIN, R., MAIER, D., AND YANNAKAKIS, M. On the desirability of acyclic database schemes. J. ACM 30, 3 (1983), 489-513.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 BEERI, C., AND KORTH, H.K. Compatible attributes in a universal relation. In Proceedings ACM Symposium on the Principles o/Database Systems (Los Angeles, Mar. 29-31, 1982), 55-62.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 BERNSTEIN, P.A. Synthesizing third normal form relations from functional dependencies. ACM Trans. Database Syst. t, 4 (1976), 277-298.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 CHEN, P.P. The entity-relationship model: Toward a unified view of data.ACM Trans. Database Syst. 1, 1 (1976), 9-36.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 CODD, E. F., ARNOLD, R. S., CADIOU, J.-M., CHANG, C.-L., AND ROUSSOPOLOUS, N. Rendezvous version I: An experimental English language query formulation system for casual users of relational databases. Rep. RJ2144, IBM, San Jose, 1978.]]Google ScholarGoogle Scholar
  9. 9 DELL'ORCO, P., SPADAVECCHIO, V. N., AND KING, M. Using knowledge of a database world in interpreting natural language queries. In Proceedings 1977 IFIP Congress, North Holland, Amsterdam.]]Google ScholarGoogle Scholar
  10. 10 FAGIN, R., MENDELZON, A. O., AND ULLMAN, J.D. A simplified universal relation assumption and its properties. ACM Trans. Database Syst. 7, 3 (1982), 343-360.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 FEIGENBAUM, J. The second phase of the System/U query processor. Unpublished manuscript.]]Google ScholarGoogle Scholar
  12. 12 HONEYMAN, P., LADNER, R. E. AND YANNAKAKIS, M. Testing the universal instance assumption. Inf. Proc. Lett. I0, 1 (1980), 14-19.]]Google ScholarGoogle ScholarCross RefCross Ref
  13. 13 KORTH, H.F. On the implementation of the System/U data definition facility. Unpublished memorandum, Stanford Univ., Stanford, Calif., 1981.]]Google ScholarGoogle Scholar
  14. 14 KORTH, H.F. System/U: A progress report. In Proceedings XP/2 Conference, June, 1981.]]Google ScholarGoogle Scholar
  15. 15 KORTH, H. F., AND ULLMAN, J.D. System/U: A database system based on the universal relation assumption. In Proceedings XP/1 Conference (Stony Brook, N.Y., 1980).]]Google ScholarGoogle Scholar
  16. 16 KUPER, G. M. An algorithm for reducing acyclic hypergraphs. STAN-CS-82-892, Dept. of Computer Science, Stanford Univ., Stanford, Calif., 1981.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17 MAIER, D. A., AND ULLMAN, J.D. Maximal objects and the semantics of universal relation databases. ACM Trans. Database Syst. 8, I (1983), 1-14.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18 MAIER, D., AND ULLMAN, J.D. Connections in acyclic hypergraphs. STAN-CS-853, Dept. of Computer Science, Stanford Univ., Stanford, Calif., 1981.]]Google ScholarGoogle Scholar
  19. 19 MAIER, D., ULLMAN, J. D., AND VARDI, M. The revenge of the JD. In Proceedings 2nd ACM Symposium on the Principles of Database Systems, (Atlanta, Ga., Mar. 21-23, 1983), 279-287.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20 MOORE, R.E. Handling complex queries in a distributed database. Tech. Note 170, Artificial Intelligence, SRI International, Menlo Park, Calif., 1979.]]Google ScholarGoogle Scholar
  21. 21 REISS, S.P. Eris: The design and implementation of an experimental relational information system. CS-83-02, Dept. of Computer Science, Brown Univ., Jan. 1983.]]Google ScholarGoogle Scholar
  22. 22 SAGIV, Y. A characterization of globally consistent databases and their correct access paths. Unpublished memorandum, Dept. of Computer Science, Univ. of Illinois, 1981.]]Google ScholarGoogle Scholar
  23. 23 SCIORE, E. Null values, updates, and normalization in relational databases. Ph.D. dissertation, Princeton Univ., Princeton, 1980.]]Google ScholarGoogle Scholar
  24. 24 STONEBRAKER, M., WONG, E., KREPS, P., AND HELD, G. The design and implementation of INGRES. ACM Trans. Database Syst. 1, 3 {1976), 189-222.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. 25 ULLMAN, J.D. Principles of Database Systems. Computer Science Press, Rockville, Md., 1982.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. 26 ULLMAN, j. D. The universal relation strikes back. in Proceedings A CM Symposium on the Principles of Database Systems (Los Angeles, Mar. 29-31, 1982), 10-22.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. 27 WON6, E., AND YOUSSEFI, K. Decomposition--a strategy for query processing. ACM Trans. Database Syst. 1, 3 (1976), 223-241.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. SYSTEM/U: a database system based on the universal relation assumption

                  Recommendations

                  Comments

                  Login options

                  Check if you have access through your login credentials or your institution to get full access on this article.

                  Sign in

                  Full Access

                  • Published in

                    cover image ACM Transactions on Database Systems
                    ACM Transactions on Database Systems  Volume 9, Issue 3
                    Sept. 1984
                    172 pages
                    ISSN:0362-5915
                    EISSN:1557-4644
                    DOI:10.1145/1270
                    Issue’s Table of Contents

                    Copyright © 1984 ACM

                    Publisher

                    Association for Computing Machinery

                    New York, NY, United States

                    Publication History

                    • Published: 1 September 1984
                    Published in tods Volume 9, Issue 3

                    Permissions

                    Request permissions about this article.

                    Request Permissions

                    Check for updates

                    Qualifiers

                    • article

                  PDF Format

                  View or Download as a PDF file.

                  PDF

                  eReader

                  View online with eReader.

                  eReader