Skip to main content
SpringerLink
Log in

Concluding remarks and ongoing research

  • Chapter
  • First Online:
The Nested Universal Relation Database Model

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

  • 124 Accesses

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

References

  • Abiteboul S., Beeri C., Gyssens M. & Van Gucht D. 1989a. An introduction to the completeness of languages for complex objects. In: Nested Relations and Complex Objects in Databases, pp. 117–138. Lecture Notes in Computer Science 361, Berlin: Springer-Verlag.

    Google Scholar 

  • Abiteboul S., Fischer P. C. & Schek H.-J. (eds.) 1989b. Nested Relations and Complex Objects in Databases. Lecture Notes in Computer Science 361, Berlin: Springer-Verlag.

    Google Scholar 

  • Abiteboul S. & Bidoit N. 1986 Non first normal form relations: An algebra allowing data restructuring. Journal of Computer and System Sciences 33, 361–393.

    Google Scholar 

  • Abiteboul S., Scholl M., Gardarin G. & Simon E. 1986 Towards DBMSs for supporting new applications. Proceedings of 12th International Conference on Very Large Data Bases, Kyoto, pp. 423–435.

    Google Scholar 

  • Agrawal R. 1987 Alpha: An extension of relational algebra to express a class of recursive queries. Proceedings of 3rd IEEE Conference on Data Engineering, Los Angeles, pp. 580–590.

    Google Scholar 

  • ANSI/X3/SPARC 1975 Study group on database management systems, interim report. FDT 7, Bulletin of ACM SIGFIDET.

    Google Scholar 

  • Arisawa H., Moriya K. & Miura T. 1983 Operations and the properties on non-first-normal-form relational databases. Proceedings of 9th International Conference on Very Large Data Bases, Florence, pp. 197–204.

    Google Scholar 

  • Atzeni P. & Bernardis M. C. 1987 A new basis for the weak instance model. Proceedings of 6th ACM Symposium on Principles of Database Systems, San Diego, pp. 79–86.

    Google Scholar 

  • Atzeni P. & Chan E. P. F. 1989 Efficient optimization of simple chase join expressions. ACM Transactions on Database Systems 14, 212–230.

    Google Scholar 

  • Atzeni P. & Morfuni N. M. 1986 Functional dependencies and constraints on null values in database relations. Information and Control 70, 1–31.

    Google Scholar 

  • Atzeni P. & Parker D. S. 1982 Assumptions in relational database theory. Proceedings of 1st ACM Symposium on Principles of Database Systems, Los Angeles, pp. 1–9.

    Google Scholar 

  • Babb E. 1982 Joined normal form: A storage encoding for relational databases. ACM Transactions on Database Systems 7, 588–614.

    Google Scholar 

  • Bachman C. W. 1969 Data structure diagrams. Data Base 1, 4–10.

    Google Scholar 

  • Bancilhon F., Richard P. & Scholl M. 1982 On line processing of compacted relations. Proceedings of 8th International Conference on Very Large Data Bases, Mexico City, 263–269.

    Google Scholar 

  • Beeri C. 1988 Data models and languages for databases. Proceedings of International Conference on Database Theory, Bruges, Belgium, pp. 19–40.

    Google Scholar 

  • Beeri C., Fagin R., Maier D. & Yannakakis M. 1983 On the desirability of acyclic data-base schemes. Journal of the ACM 30, 479–513.

    Google Scholar 

  • Beeri C. & Kifer M. 1986 An integrated approach to logical design of relational database schemes. ACM Transactions on Database Systems 11, 134–158.

    Google Scholar 

  • Beeri C. & Vardi M. Y. 1981 On the properties of join dependencies. In: Advances in Database Theory (eds. Gallaire H., Minker J. & Nicholas J. M.), Volume 1, New York: Plenum Press, pp. 25–72.

    Google Scholar 

  • Beeri C. & Vardi M. Y. 1984 A proof procedure for data dependencies. Journal of the ACM 31, 718–741.

    Google Scholar 

  • Berge C. 1973 Graphs and Hypergraphs. Amsterdam: North-Holland.

    Google Scholar 

  • Bidoit N. 1987 The Verso algebra or how to answer queries with fewer joins. Journal of Computer and System Sciences 35, 321–364.

    Google Scholar 

  • Biskup J. 1981 A formal approach to null values in database relations. In: Advances in Database Theory (eds. Gallaire H., Minker J. & Nicholas J. M.), Volume 1, New York: Plenum Press, pp. 299–341.

    Google Scholar 

  • Biskup J. 1983 A foundation of Codd's relational maybe-operations. ACM Transactions on Database Systems 8, 608–636.

    Google Scholar 

  • Biskup J. & Bruggemann H. H. 1983 Universal relation views: A pragmatic approach. Proceedings of 9th International Conference on Very Large Data Bases, Florence, pp. 172–185.

    Google Scholar 

  • Biskup J. & Bruggemann H. H. 1987 Data manipulation languages for the universal relation view DURST. Proceedings of Conference on Mathematical Foundations of Data Base Systems, Dresden, pp. 20–41.

    Google Scholar 

  • Biskup J., Bruggemann H. H., Schnetgoke L. & Kramer M. 1986 One flavor assumption and γ-acyclicity for universal relation views. Proceedings of 5th ACM Symposium on Principles of Database Systems, Cambridge, Ma, pp. 148–159.

    Google Scholar 

  • Brosda V. & Vossen G. 1988 Update and retrieval in a relational database through a universal schema interface. ACM Transactions on Database Systems 13, 449–485.

    Google Scholar 

  • Bullers Jr. W. I. 1987 A processing algorithm for master-detail records in a relational database. Software-Practice and Experience 17, 701–717.

    Google Scholar 

  • Carlson C. R. & Kaplan R. S. 1976 A generalized access path model and its application to a relational database system. Proceedings of ACM SIGMOD Conference on Management of data, Washington D.C., pp. 143–154.

    Google Scholar 

  • Casanova M. A., Fagin R. & Papadimitriou C. H. 1984 Inclusion dependencies and their interaction with functional dependencies. Journal of Computer and System Sciences 28, 29–59.

    Google Scholar 

  • Chan E. P. F. & Atzeni P. 1986 On the properties and characteristics of connection-trap-free schemes. Proceedings of 5th ACM Symposium on Principles of Database Systems, Cambridge, Ma, pp. 140–147.

    Google Scholar 

  • Chan E. P. F. & Hernández H. J. 1988a On the desirability of γ-acyclic BCNF database schemes. Theoretical Computer Science 62, 67–104.

    Google Scholar 

  • Chan E. P. F. & Hernández H. J. 1988b On generating database schemes bounded or constant-time-maintainable by extensibility. Acta Informatica 25, 475–496.

    Google Scholar 

  • Codd E. F. 1970 A relational model of data for large shared data banks. Communications of the ACM 13, 377–387.

    Google Scholar 

  • Codd E. F. 1979 Extending the database relational model to capture more meaning. ACM Transactions on Database Systems 4, 397–434.

    Google Scholar 

  • Codd E. F. 1986 Missing information (applicable and inapplicable) in relational data-bases. ACM SIGMOD Record 15, 53–78.

    Google Scholar 

  • Codd E. F. 1987 More commentary on missing information in relational databases (applicable and inapplicable information). ACM SIGMOD Record 16, 42–50.

    Google Scholar 

  • Colby L. S. 1989 A recursive algebra and query optimization for nested relations. Proceedings of ACM SIGMOD Conference on Management of Data, Portland, pp. 273–283.

    Google Scholar 

  • Dadam P., Kuespert K., Anderson F., Blanken H., Erbe R., Guenauer J., Lum V., Pistor P. & Walcn G. 1986 A DBMS prototype to support extended NF 2 relations: An integrated view on flat tables and hierarchies. Proceedings of ACM SIGMOD Conference on Management of Data, Washington D. C, pp. 356–367.

    Google Scholar 

  • Date C. J. 1987a Referential integrity. In: Relational Databases Selected Writings, Reading, Ma: Addison-Welsey, pp. 41–63.

    Google Scholar 

  • Date C. J. 1987b The outer join. In: Relational Databases Selected Writings, Reading, Ma: Addison-Welsey, pp. 335–366.

    Google Scholar 

  • Date C. J. 1987c A Guide to the SQL Standard. Reading, Ma: Addison-Wesley.

    Google Scholar 

  • Delobel C. 1978 Normalization and hierarchical dependencies in the relational data model. ACM Transactions on Database Systems 3, 201–222.

    Google Scholar 

  • Desai B. C., Goyal P. & Sadri F. 1987 Non-first normal form universal relations: An application to information retrieval systems. Information Systems 12, 49–55.

    Google Scholar 

  • Deshpande V. & Larson P.-A. 1987 An algebra for nested relations. Research Report CS-87-65, Department of Computer Science, University of Waterloo, Ontario.

    Google Scholar 

  • Fagin R. 1977 Multivalued dependencies and a new normal form for relational databases. ACM Transactions on Database Systems 2, 262–278.

    Google Scholar 

  • Fagin R. 1983 Degrees of acyclicity for hypergraphs and relational database systems. Journal of the ACM 30, 514–550.

    Google Scholar 

  • Fagin R., Mendelzon A. O. & Ullman J. D. 1982 A simplified universal relation assumption and its properties. ACM Transactions on Database Systems 7, 343–360.

    Google Scholar 

  • Fagin R. & Vardi M. Y. 1984 The theory of data dependencies — A survey. IBM Research Report RJ4321 (47149), San Jose, Ca.

    Google Scholar 

  • Fischer P. C., Saxton L. V., Thomas S. J. & Van Gucht D. 1985 Interactions between dependencies and nested relational structures. Journal of Computer and System Sciences 31, 343–354.

    Google Scholar 

  • Fischer P. C. & Van Gucht D. 1984 Weak multivalued dependencies. Proceedings of 3rd ACM Symposium on Principles of Database Systems, Waterloo, pp. 266–274.

    Google Scholar 

  • Fischer P. C. & Van Gucht D. 1985 Determining when a structure is a nested relation. Proceedings of 11th International Conference on Very Large Data Bases, Stockholm, pp. 171–180.

    Google Scholar 

  • Goldstein B. S. 1981 Constraints on null values in relational databases. Proceedings of 7th International Conference on Very Large Data Bases, Cannes, pp. 101–110.

    Google Scholar 

  • Gottlob G. & Zicari R. 1988 Closed world databases opened through null values. Proceedings of 14th International Conference on Very Large Data Bases, Los Angeles, pp. 50–61.

    Google Scholar 

  • Grahne G. 1984 Dependency satisfaction in databases with incomplete information. Proceedings of 10th International Conference on Very Large Data Bases, Singapore, pp. 37–45.

    Google Scholar 

  • Graham M. H., Mendelzon A. O. & Vardi M. Y. 1986 Notions of dependency satisfaction. Journal of the ACM 33, 105–129.

    Google Scholar 

  • Graham M. H. & Wang K. 1986 Constant time maintenance or the triumph of the fd. Proceedings of 5th ACM Symposium on Principles of Database Systems, Cambridge, Ma, pp. 202–216.

    Google Scholar 

  • Grant J. 1980 Incomplete information in a relational database. Fundamenta Informaticae 3, 363–378.

    Google Scholar 

  • Guting R. H., Zicari R. & Choy D. M. 1987 An algebra for structured office documents. IBM Research Report RJ5559 (56648), San Jose, Ca.

    Google Scholar 

  • Gyssens M. 1987 The extended nested relational algebra. Technical Report 87-11, Department of Mathematics and Computer Science, University of Antwerp.

    Google Scholar 

  • Gyssens M. & Van Gucht D. 1987 The powerset algebra operator as an algebraic tool for understanding least fixpoint semantics in the context of nested relations. Technical Report no. 233, Department of Computer Science, University of Indiana.

    Google Scholar 

  • Gyssens M. & Van Gucht D. 1988 The powerset algebra as a result of adding programming constructs to the nested relational algebra. Proceedings of ACM SIGMOD Conference on Management of Data, Chicago, pp. 225–232.

    Google Scholar 

  • Hernández H. J. & Chan E. P. F. 1988 A characterization of constant-time-maintainability for BCNF database schemes. Proceedings of ACM SIGMOD Conference on Management of Data, Chicago, pp. 209–217.

    Google Scholar 

  • Honeyman P. 1982 Testing satisfaction of functional dependencies. Journal of the ACM 29, 668–677.

    Google Scholar 

  • Houben G. J. & Paredaens J. 1987 The R2-algebra: an extension of an algebra for nested relations. Technical Report 87/20, Department of Mathematics and Computing Science, Eindhoven University of Technology.

    Google Scholar 

  • Imielinski T. & Lipski Jr. W. 1983 Incomplete information and dependencies in relational databases. Proceedings of ACM SIGMOD Conference on Management of Data, San Jose, pp. 177–184.

    Google Scholar 

  • Imielinski T. & Lipski Jr. W. 1984 Incomplete information in relational databases. Journal of the ACM 31, 761–791.

    Google Scholar 

  • Imielinski T. & Rozenshtein D. 1984 Towards a flexible user interface to relational data-base systems: Processing simple second order queries. Proceedings of 4th Conference on Information Technology, Jerusalem, Israel, pp. 358–367.

    Google Scholar 

  • Jaeschke G. 1985a Nonrecursive algebra for relations with relation valued attributes. Report TR.85.03.001, IBM Hiedelburg Scientific Center.

    Google Scholar 

  • Jaeschke G. 1985b Recursive algebra for relations with relation valued attributes. Report TR.85.03.002, IBM Hiedelburg Scientific Center.

    Google Scholar 

  • Jaeschke G. & Schek H.-J. 1982 Remarks on the algebra of non first normal form relations. Proceedings of 1st ACM Symposium on Principles of Database Systems, Los Angeles, pp. 124–138.

    Google Scholar 

  • Jajodia S. & Ng P. A. 1984 Representative instances and γ-acyclic relational schemes. IEEE Transactions on Software Engineering SE-10, 614–618.

    Google Scholar 

  • Jajodia S. 1987 An extension of “Representative instances and γ-acyclic relational schemes”. IEEE Transactions on Software Engineering SE-13, 1047–1048.

    Google Scholar 

  • Jajodia S. & Springsteel F. N. 1987 Construction of universal instances of loop-free network databases using a join-like operation. IEEE Transactions on Software Engineering SE-13, 811–819.

    Google Scholar 

  • Kambayashi Y., Tanaka K. & Takeda K. 1983 Synthesis of unnormalized relations incorporating more meaning. Information Sciences 29, 201–247.

    Google Scholar 

  • Kambayashi Y. & Yamamoto H. 1987 Efficient procedures to generate unnormalized database outputs. Report 87C-15, Department of Computer Science and Comm. Eng., Kyushu University.

    Google Scholar 

  • Keller A. & Wilkins M. 1985 On the use of an extended relational model to handle changing incomplete information. IEEE Transactions on Software Engineering SE-11, 620–633.

    Google Scholar 

  • Kent W. 1981 Consequences of assuming a universal relation. ACM Transactions on Database Systems 6, 539–556.

    Google Scholar 

  • Kent W. 1983 Technical correspondence: The universal relation revisited. ACM Transactions on Database Systems 8, 644–648.

    Google Scholar 

  • Kobayashi I. 1985 An overview of database management technology. In: Advances in Information Systems Sciences (ed. Tou J. T.), Volume 9, New York: Plenum Press, pp. 49–219.

    Google Scholar 

  • Korth H. F. 1986 Extending the scope of relational languages. IEEE Software 3, 19–28.

    Google Scholar 

  • Korth H. F. 1988 Optimization of object-retrieval queries. Proceedings of 2nd International Workshop on Object-Oriented Database Systems, Bad Munster am Stein-Ebemburg, pp. 352–357

    Google Scholar 

  • Korth H. F., Kuper G. M., Fiegenbaum J., Van Gelder A. & Ullman J. D. 1984 System/U: A database system based on the Universal Relation Assumption. ACM Transactions on Database Systems 9, 331–347.

    Google Scholar 

  • Korth H. F. & Roth M. A. 1989 Query languages for nested relational databases. In: Nested Relations and Complex Objects in Databases, pp. 190–204. Lecture Notes in Computer Science 361, Berlin: Springer-Verlag.

    Google Scholar 

  • Kuck S. M. & Sagiv Y. 1982 A universal relation database system implemented via the network model. Proceedings of 1st ACM Symposium on Principles of Database Systems, Los Angeles, pp. 147–157.

    Google Scholar 

  • Lerat N. & Lipski Jr. W. 1986 Nonapplicable nulls. Theoretical Computer Science 46, 67–82.

    Google Scholar 

  • Levene M. & Loizou G. 1987a Project-join constructibility in the context of NF2 relational databases. Proceedings of Bases de Données Avancées, BD3, Port Camargue, France, pp. 143–163.

    Google Scholar 

  • Levene M. & Loizou G. 1987b An optimized fourth normal form utilizing nested relations. Research Report LL-87-01, Department of Computer Science, Birkbeck College, University of London.

    Google Scholar 

  • Levene M. & Loizou G. 1988 A universal relation model for nested relations. Proceedings of 1st International Conference on Extending Data Base Technology, Venice, pp. 294–308.

    Google Scholar 

  • Levene M. & Loizou G. 1989a A domain theoretic approach to incomplete information in nested relational databases. Proceedings of the 3rd International Conference on Foundations of Data Organization and Algorithms, Paris, pp. 439–456.

    Google Scholar 

  • Levene M. & Loizou G. 1989b NURQL: A nested universal relation query language. Information Systems 14, 307–316.

    Google Scholar 

  • Levene M. & Loizou G. 1989c Modelling incomplete information in complex objects. Proceedings of 7th British National Conference on Databases, Edinburgh, pp. 241–259.

    Google Scholar 

  • Levene M. & Loizou G. 1989d γ-acyclic database schemes and nested relations. In: Nested Relations and Complex Objects in Databases, pp. 313–323. Lecture Notes in Computer Science 361, Berlin: Springer-Verlag.

    Google Scholar 

  • Levene M. & Loizou G. 1989e The nested representative instance in the presence of null functional dependencies. Research Report LL-89-01, Department of Computer Science, Birkbeck College, University of London.

    Google Scholar 

  • Levene M. & Loizou G. 1991a. A domain theoretic characterisation of the universal relation. International Journal of Computer Mathematics 40, 69–74.

    Google Scholar 

  • Levene M. & Loizou G. 1991b. Set Generating Data Dependencies in Nested Relations. Research Note RN/91/82, Department of Computer Science, University College London.

    Google Scholar 

  • Lien Y. E. 1979 Multivalued dependencies with null values in relational databases. Proceedings of 5th International Conference on Very Large Data Bases, Rio de Janeiro, pp. 61–66.

    Google Scholar 

  • Lien Y. E. 1982 On the equivalence of database models. Journal of the ACM 29, 333–362.

    Google Scholar 

  • Linnemann V. 1987 Non first normal form relations and recursive queries: An SQL-based approach. Proceedings of 3rd IEEE Conference on Data Engineering, Los Angeles, pp. 591–598.

    Google Scholar 

  • Lipski Jr. W. 1979 On semantic issues connected with incomplete information databases. ACM Transactions on Database Systems 3, 262–296.

    Google Scholar 

  • Lipski Jr. W. 1981 On databases with incomplete information. Journal of the ACM 28, 41–70.

    Google Scholar 

  • Maier D. 1983 The Theory of Relational Databases. Rockville, Maryland: Computer Science Press.

    Google Scholar 

  • Maier D., Mendelzon A. O. & Sagiv Y. 1979 Testing implication of data dependencies. ACM Transactions on Database Systems 4, 455–469.

    Google Scholar 

  • Maier D., Rozenshtein D., Salveter S., Stein J. & Warren D. S. 1987 PIQUE: A relational query language without relations. Information Systems 12, 317–335.

    Google Scholar 

  • Maier D., Rozenshtein D. & Warren D. S. 1986 Window functions. In: Advances in Computing Research (eds. Kanellakis P. C. & Preparata F.), Volume 3, Greenwich: JAI Press, pp. 213–246.

    Google Scholar 

  • Maier D., Sagiv Y. & Yannakakis M. 1981 On the complexity of testing implications of functional and join dependencies. Journal of the ACM 28, 680–695.

    Google Scholar 

  • Maier D. & Ullman J. D. 1983 Maximal objects and the semantics of universal relation databases. ACM Transactions on Database Systems 8, 1–14.

    Google Scholar 

  • Maier D., Ullman J. D. & Vardi M. Y. 1984 On the foundations of the universal relation model. ACM Transactions on Database Systems 9, 283–308.

    Google Scholar 

  • Maier D. & Warren D. S. 1982 Specifying connections for a universal relation scheme database. Proceedings of ACM SIGMOD Conference on Management of Data, Orlando, pp. 1–7.

    Google Scholar 

  • Makinouchi A. 1977 A consideration on normal form of not-necessarily-normalized relation in the relational data model. Proceedings of 3rd International Conference on Very Large Data Bases, Tokyo, pp. 447–453.

    Google Scholar 

  • Mendelzon A. O. 1984 Database states and their tableaux. ACM Transactions on Data-base Systems 9, 264–282.

    Google Scholar 

  • Miller L. L., Gadia S. K., Kothari S. & Liu K. C. 1988 Completeness issues for join dependencies derived from the universal relation join dependency. Information Processing Letters 28, 269–274.

    Google Scholar 

  • Miura T., Moriya K. & Arisawa H. 1986 Normalizing non first normal form relations. Proceedings of 6th Advanced Database Symposium, Information Processing Society of Japan, pp. 65–71.

    Google Scholar 

  • Miura T., Moriya K. & Arisawa H. 1987 On the irreducible non first normal form relations. Information Systems 12, 229–238.

    Google Scholar 

  • Osborn S. L. 1979 Towards a universal relation interface. Proceedings of 5th International Conference on Very Large Data Bases, Rio de Janeiro, pp. 52–60.

    Google Scholar 

  • Ozsoyoglu G., Ozsoyoglu Z. M. & Matos V. 1987 Extending relational algebra and relational calculus with set-valued attributes and aggregate functions. ACM Transactions on Database Systems 12, 566–592.

    Google Scholar 

  • Ozsoyoglu Z. M. & Yuan L.-Y. 1987a A new normal form for nested relations. ACM Transactions on Database Systems 12, 111–136.

    Google Scholar 

  • Ozsoyoglu Z. M. & Yuan L.-Y. 1987b A design method for nested relational databases. Proceedings of 3rd IEEE Conference on Data Engineering, Los Angeles, pp. 599–608.

    Google Scholar 

  • Paredaens J., De Bra P., Gyssens M. & Van Gucht D. 1989. The Structure of the Relational Database Model. EATCS Monographs on Theoretical Computer Science, Volume 17, Berlin: Spinger-Verlag.

    Google Scholar 

  • Pistor P. & Anderson F. 1986 Designing a generalized NF2 model with an SQL-type language interface. Proceedings of 12th International Conference on Very Large Data Bases, Kyoto, pp. 278–285.

    Google Scholar 

  • Pistor P. & Traunmueller R. 1986 A database language for sets, lists and tables. Information Systems 11, 323–336.

    Google Scholar 

  • Reiter R. 1978 On closed world databases. In: Logic and Databases (eds. Gallaire H. & Minker J.), New York: Plenum Press, pp. 55–76.

    Google Scholar 

  • Roth M. A. & Korth H. F. 1987 The design of ⌝-1NF relational databases into nested normal form. Proceedings of ACM SIGMOD Conference on Management of Data, San Francisco, pp. 143–159.

    Google Scholar 

  • Roth M. A., Korth H. F. & Batory D. S. 1987 SQL/NF: A query language for ⌝-1NF relational databases. Information Systems 12, 99–114.

    Google Scholar 

  • Roth M. A., Korth H. F. & Silberschatz A. 1985 Null values in ⌝-1NF relational data-bases. Research Report TR-85-32, Department of Computer Science, University of Texas at Austin.

    Google Scholar 

  • Roth M. A., Korth H. F. & Silberschatz A. 1988 Extended algebra and calculus for nested relational databases. ACM Transactions on Database Systems 13, 389–417.

    Google Scholar 

  • Roth M. A., Korth H. F. & Silberschatz A. 1989 Null values in nested relational databases. Acta Informatica 26, 615–642.

    Google Scholar 

  • Rowe L. A. & Stonebraker M. R. 1987 The POSTGRES data model. Proceedings of 13th International Conference on Very Large Data Bases, Brighton, pp. 83–96.

    Google Scholar 

  • Sagiv Y. 1981 Can we use the universal instance assumption without null values? Proceedings of ACM SIGMOD Conference on Management of Data, Ann Arbor, pp. 108–120.

    Google Scholar 

  • Sagiv Y. 1983 A characterization of globally consistent databases and their correct access paths. ACM Transactions on Database Systems 8, 266–286.

    Google Scholar 

  • Sagiv Y. 1987 Optimizing datalog programs. Proceedings of 6th ACM Symposium on Principles of Database Systems, San Diego, pp. 349–362.

    Google Scholar 

  • Sagiv Y. 1988 On bounded database schemes and bounded horn-clause programs. SIAM Journal of Computing 12, 1–22.

    Google Scholar 

  • Schek H.-J. 1985 Towards a basic relational NF2 algebra processor. Proceedings of 2nd International Conference on Foundations of Data Organization and Algorithms, Kyoto, pp. 173–182.

    Google Scholar 

  • Schek H.-J. & Pistor P. 1982 Structures for an integrated database management and information retrieval system. Proceedings of 8th International Conference on Very Large Data Bases, Mexico City, pp. 197–207.

    Google Scholar 

  • Schek H.-J. & Scholl M. H. 1986 The relational model with relation-valued attributes. Information Systems 11, 137–147.

    Google Scholar 

  • Schenk K. L. & Pinkert J. R. 1977 An algorithm for servicing multirelational queries. Proceedings of ACM SIGMOD Conference on Management of Data, Toronto, pp. 10–19.

    Google Scholar 

  • Scholl M. H. 1986 Theoretical foundation of algebraic optimization utilizing unnormalized relations. Proceedings of International Conference on Database Theory, Rome, pp. 380–396.

    Google Scholar 

  • Scholl M., Paul H. B. & Schek H.-J. 1987 Supporting flat relations by a nested relational kernel. Proceedings of 13th International Conference on Very Large Data Bases, Brighton, pp. 137–146.

    Google Scholar 

  • Scholl M. H. & Schek H.-J. (eds.) 1987 Theory and Applications of Nested Relations and Complex Objects. An international Workshop: Workshop Material, Darmstadt, West Germany.

    Google Scholar 

  • Sciore E. 1982 A complete axiomatization of join dependencies. Journal of the ACM 29, 373–393.

    Google Scholar 

  • Sciore E. 1983 Inclusion dependencies and the universal instance. Proceedings of 2nd ACM Symposium on Principles of Database Systems, Atlanta, pp. 48–57.

    Google Scholar 

  • Stein J. & Maier D. 1985 Relaxing the universal relation scheme assumption. Proceedings of 4th ACM Symposium on Principles of Database Systems, Portland, pp. 76–85.

    Google Scholar 

  • Takeda K. 1989 On the uniqueness of nested relations. In: Nested Relations and Complex Objects in Databases, pp. 139–150. Lecture Notes in Computer Science 361, Berlin: Springer-Verlag.

    Google Scholar 

  • Thomas S. J. & Fischer P. C. 1986 Nested relational structures. In: Advances in Computing Research (eds. Kanellakis P. C. & Preparata F.), Volume 3, Greenwich: JAI Press, pp. 269–307.

    Google Scholar 

  • Ullman J. D. 1982a Principles of Database Systems. Rockville, Maryland: Computer Science Press.

    Google Scholar 

  • Ullman J. D. 1982b The U.R. strikes back. Proceedings of 1st ACM Symposium on Principles of Database Systems, Los Angeles, pp. 10–22.

    Google Scholar 

  • Ullman J. D. 1983a Universal relation interfaces for database systems. Proceedings of 9th IFIP World Computer Congress, Paris, pp. 243–252.

    Google Scholar 

  • Ullman J. D. 1983b Technical correspondence: On Kent's “Consequences of assuming a universal relation”. ACM Transactions on Database Systems 8, 637–643.

    Google Scholar 

  • Ullman J. D. 1987 Database theory: Past and future. Proceedings of 6th ACM Symposium on Principles of Database Systems, San Diego, pp. 1–10.

    Google Scholar 

  • Van Gucht D. & Fischer P. C. 1986 Some classes of multilevel relational structures. Proceedings of 5th ACM Symposium on Principles of Database Systems, Cambridge, Ma, pp. 60–69.

    Google Scholar 

  • Van Gucht D. 1987 On the expressive power of the extended relational algebra for the unnormalized relational model. Proceedings of 6th ACM Symposium on Principles of Database Systems, San Diego, pp. 302–312.

    Google Scholar 

  • Van Gucht D. & Fischer P. C. 1988 Multilevel nested relational structures. Journal of Computer and System Sciences 36, 77–105.

    Google Scholar 

  • Vardi M. Y. 1988 The universal-relation data model for logical independence. IEEE Software 5, 80–85.

    Google Scholar 

  • Vassiliou Y. 1979 Null values in data base management: a denotational semantics approach. Proceedings of ACM SIGMOD Conference on Management of Data, Boston, pp. 162–169.

    Google Scholar 

  • Vassiliou Y. 1980 Functional dependencies and incomplete information. Proceedings of 6th International Conference on Very Large Data Bases, Montreal, pp. 260–269.

    Google Scholar 

  • Yannakakis M. 1981 Algorithms for acyclic database schemes. Proceedings of 7th International Conference on Very Large Data Bases, Cannes, pp. 82–94.

    Google Scholar 

  • Zaniolo C. 1984 Database relations with null values. Journal of Computer and System Sciences 28, 142–166.

    Google Scholar 

Download references

Editor information

M. Levene

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(1992). Concluding remarks and ongoing research. In: Levene, M. (eds) The Nested Universal Relation Database Model. Lecture Notes in Computer Science, vol 595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55493-9_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-55493-9_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation