Evaluation and optimization of complex object selections

We provide a general framework for declarative selection operations for complex object databases, based on the safe calculus for complex objects. Within this framework, we consider a class of “single pass-evaluable” selection operations. We show how such selection operations can be succinctly expressed by programs that use only very simple positive existential selections. Also, a syntactic criterion is developed for the commutation of two such positive existential selections. These two results are then jointly applied to the problem of optimizing complex object selections, which is much more complicated than in classical relational databases.

[1]  Gabriel M. Kuper,et al.  A new approach to database logic , 1984, PODS.

[2]  Catriel Beeri,et al.  Algebraic Optimization of Object-Oriented Query Languages , 1990, Theor. Comput. Sci..

[3]  Christophe Lécluse,et al.  Modeling complex structures in object-oriented logic programming , 1989, PODS '89.

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

[5]  Catriel Beeri,et al.  A Formal Approach to Object-Oriented Databases , 1990, Data Knowl. Eng..

[6]  Catriel Beeri,et al.  On the power of languages for manipulation of complex objects , 1987, VLDB 1987.

[7]  François Bancilhon,et al.  Query Languages for Object-Oriented Database Systems: Analysis and a Proposal , 1989, BTW.

[8]  Marc H. Scholl,et al.  Theoretical Foundation of Algebraic Optimization Utilizing Unnormalized Relations , 1986, ICDT.

[9]  Dirk Van Gucht,et al.  Possibilities and limitations of using flat operators in nested algebra expressions , 1988, PODS '88.

[10]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[11]  Hans-Jörg Schek,et al.  Architecture and implementation of the Darmstadt database kernel system , 1987, SIGMOD '87.

[12]  Jan Van den Bussche.  Active Complex Object Databases (Working Paper) , 1991, FMLDO.

[13]  Serge Abiteboul,et al.  Object identity as a query language primitive , 1989, SIGMOD '89.

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

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

[16]  Hans-Jörg Schek,et al.  A Relational Object Model , 1990, ICDT.

[17]  Patrick C. Fischer,et al.  Nested Relational Structures , 1986, Adv. Comput. Res..

[18]  Jeffrey D. Ullman,et al.  Principles of database and knowledge-base systems, Vol. I , 1988 .

[19]  Michel Scholl,et al.  On Line Processing of Compacted Relations , 1982, VLDB.

[20]  Marc Gyssens,et al.  The Structure of the Relational Database Model , 1989, EATCS Monographs on Theoretical Computer Science.

[21]  Bruce G. Lindsay,et al.  Proceedings of the 1989 ACM SIGMOD International Conference on the Management of Data, Portland, Oregon , 1989 .

[22]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

[23]  Nicole Bidoit,et al.  The Verso Algebra or How to Answer Queries with Fewer Joins , 1987, J. Comput. Syst. Sci..

[24]  Richard Hull,et al.  The Format Model: A Theory of database Organization , 1984, J. ACM.

[25]  Richard Hull.  Relative Information Capacity of Simple Relational Database Schemata , 1986, SIAM J. Comput..

[26]  Latha S. Colby.  A recursive algebra and query optimization for nested relations , 1989, SIGMOD '89.

[27]  Timos K. Sellis,et al.  Special Issue on Rule Management and Processing in Expert Database Systems - Letter from the Guest Editor , 1989, SIGMOD Rec..

[28]  Christophe Lécluse,et al.  Modeling complex structures in object-oriented logic programming , 1989, PODS.