Deductive Query Languages for Recursively Typed Complex Objects

Abstract Deductive database query languages for recursively typed complex objects based on the set and tuple constructs are studied. A fundamental characteristic of such complex objects is that in them, sets may contain members with arbitrarily deep nesting of tuple and set constructs. Relative to mappings from flat relations to flat relations, two extensions of COL in this context (with stratified semantics and inflationary semantics, respectively) are shown to have the expressive power of computable queries. Although the deductive calculus of Bancilhon and Khoshafian has the ability to simulate Turing machines, when restricted to flat input and output its expressive power is characterized by a weak variant of the conjunctive queries.

[1]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[2]  Patrick Valduriez,et al.  A FAD for Data Intensive Applications , 1992, IEEE Trans. Knowl. Data Eng..

[3]  Serge Abiteboul,et al.  Non First Normal Form Relations: An Algebra Allowing Data Restructuring , 1986, J. Comput. Syst. Sci..

[4]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[5]  Serge Abiteboul,et al.  A rule-based language with functions and sets , 1991, TODS.

[6]  Luca Cabibbo,et al.  The Expressive Power of Stratified Logic Programs with Value Invention , 1998, Inf. Comput..

[7]  K. Apt.  Fundamenta informaticae on Logic Programming , 1990 .

[8]  David Maier,et al.  Development of an object-oriented DBMS , 1986, OOPLSA '86.

[9]  Alan van Gelser.  Negation as failure using tight derivations for general logic programs , 1989 .

[10]  Johann A. Makowsky,et al.  Query Languages for Hierarchic Databases , 1992, Inf. Comput..

[11]  Roger King,et al.  Semantic database modeling: survey, applications, and research issues , 1987, CSUR.

[12]  Jianwen Su,et al.  On bulk data type constructors and manipulation primitives: a framework for analyzing expressive power and complexity , 1989 .

[13]  Serge Abiteboul,et al.  Datalog Extensions for Database Queries and Updates , 1991, J. Comput. Syst. Sci..

[14]  Serge Abiteboul,et al.  IFO: A Formal Semantic Database Model , 1987, ACM Trans. Database Syst..

[15]  Hans-Jörg Schek,et al.  The relational model with relation-valued attributes , 1986, Inf. Syst..

[16]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[17]  Dennis McLeod,et al.  Database description with SDM: a semantic database model , 1981, TODS.

[18]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[19]  Marc Gyssens,et al.  The Powerset Algebra as a Natural Tool to Handle Nested Database Relations , 1992, J. Comput. Syst. Sci..

[20]  W. Shipman David,et al.  The functional data model and the data language DAPLEX , 1988 .

[21]  Jianwen Su,et al.  Algebraic and Calculus Query Languages for Recursively Typed Complex Objects , 1993, J. Comput. Syst. Sci..

[22]  E. F. CODD,et al.  A relational model of data for large shared data banks , 1970, CACM.

[23]  Gabriel M. Kuper,et al.  Logic programming with sets , 1987, PODS '87.

[24]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[25]  Gabriel M. Kuper.  On the expressive power of logic programming languages with sets , 1988, PODS '88.

[26]  Masatoshi Yoshikawa,et al.  ILOG: Declarative Creation and Manipulation of Object Identifiers , 1990, VLDB.

[27]  Victor Vianu,et al.  Tractable query languages for complex object databases , 1991, ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems.

[28]  David Maier,et al.  Making smalltalk a database system , 1984, SIGMOD '84.

[29]  Gabriel M. Kuper,et al.  On the Complexity of Queries in the Logical Data Model , 1993, Theor. Comput. Sci..

[30]  Victor Vianu,et al.  Procedural Languages for Database Queries and Updates , 1990, J. Comput. Syst. Sci..

[31]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[32]  Krzysztof R. Apt,et al.  Arithmetic classification of perfect models of stratified programs , 1991, Fundam. Informaticae.

[33]  Patrick Valduriez,et al.  FAD, a Powerful and Simple Database Language , 1987, VLDB.

[34]  Serge Abiteboul,et al.  IFO: a formal semantic database model , 1987, TODS.

[35]  Martin Otto,et al.  Inductive Definability with Counting on Finite Structures , 1992, CSL.

[36]  Setrag Khoshafian,et al.  A calculus for complex objects , 1985, PODS '86.

[37]  Luca Cabibbo.  On the Power of Stratified Logic Programs with Value Invention for Expressing Database Transformations , 1995, ICDT.

[38]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[39]  Gabriel M. Kuper,et al.  The logical data model , 1993, TODS.

[40]  Dennis McLeod,et al.  Research Foundations in Object-Oriented and Semantic Database System , 1990 .

[41]  Catriel Beeri,et al.  Set Constructors in a Logic Database Language , 1991, J. Log. Program..

[42]  Victor Vianu,et al.  Expressiveness and Complexity of Restricted Languages for Complex Objects , 1991, DBPL.

[43]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[44]  Abraham Silberschatz,et al.  Extended algebra and calculus for nested relational databases , 1988, TODS.

[45]  Aaron Watters,et al.  A Semantics for Complex Objects and Approximate Answers , 1991, J. Comput. Syst. Sci..

[46]  Christos H. Papadimitriou,et al.  Why not negation by fixpoint? , 1988, PODS '88.

[47]  Dirk Van Gucht,et al.  Converting nested algebra expressions into flat algebra expressions , 1992, TODS.

[48]  Richard Hull,et al.  A Survey of Theoretical Research on Typed Complex Database Objects , 1988, XP7.52 Workshop on Database Theory.

[49]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[50]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

[51]  Patrick Valduriez,et al.  The data model of FAD, a database programming language , 1992, Inf. Sci..

[52]  Jianwen Su,et al.  On the expressive power of database queries with intermediate types , 1988, PODS '88.

[53]  Peter Buneman,et al.  Using Powerdomains to Generalize Relational Databases , 1991, Theor. Comput. Sci..

[54]  Barry E. Jacobs,et al.  On Database Logic , 1982, JACM.