Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul and C. Beeri. On the power of languages for the manipulation of complex objects. Technical Report 846, INRIA, 1988.
Proceedings of the Seventh ACM Symposium on Principles of Database Systems. ACM Press, 1988.
S. Abiteboul and P. Kanellakis. Object identity as a query language primitive. In Clifford et al. [CLM89], pages 159–173.
S. Abiteboul and P.C. Kanellakis, editors. Third International Conference on Database Theory, Proceedings, number 470 in Lecture Notes in Computer Science. Springer-Verlag, 1990.
A.V. Aho and J.D. Ullman. Universality of data retrieval languages. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 110–120, 1979.
F. Bancilhon, S. Cluet, and C. Delobel. Query languages for object-oriented database systems. In R. Hull, R. Morrison, and D. Stemple, editors, Proceedings of the Second International Workshop on Database Programming Languages, The Morgan Kaufmann Series in Data Management Systems, pages 122–138. Morgan Kaufmann, 1989.
C. Beeri. A formal approach to object-oriented databases. Data & Knowledge Engineering, 5(4):353–382, 1990.
N. Bidoit. The Verso algebra or how to answer queries with fewer joins. Journal of Computer and System Sciences, 35(3):321–364, 1987.
C. Beeri and Y. Kornatzky Algebraic optimization of object-oriented query languages. In Abiteboul and Kanellakis [AK90], pages 72–88.
F. Bancilhon, P. Richard, and M. Scholl. On line processing of compacted relations. In Proceedings International Conference on VLDB, pages 263–269, 1982.
J. Clifford, B. Lindsay, and D. Maier, editors. Proceedings of the 1989 ACM SIGMOD International Conference on the Management of Data, number 18∶2 in SIGMOD Record. ACM Press, 1989.
L. Colby. A recursive algebra and query optimization for nested relations. In Clifford et al. [CLM89], pages 273–283.
R. Hull and J. Su. On the expressive power of database queries with intermediate types. In ACM [ACM88], pages 39–51.
R. Hull. Relative information capacity of simple relational schemata. SIAM Journal on Computing, 15(3):856–886, 1986.
R. Hull and C.K. Yap. The format model, a theory of database organization. Journal of the ACM, 31(3):518–537, 1984.
M. Kifer, G. Lausen, and J. Wu. Logical foundations of object-oriented and frame-based languages. Technical Report 90/14, Dept. Comp. Science, SUNY Stony Brook, 1990.
G. Kuper and M. Vardi. A new approach to database logic. In Proceedings of the Third ACM Symposium on Principles of Database Systems, pages 86–96. ACM Press, 1984.
C. Lécluse and P. Richard. Modeling complex structures in object-oriented databases. In Proceedings of the Eighth ACM Symposium on Principles of Database Systems, pages 360–368. ACM Press, 1989.
J. Paredaens, P. De Bra, M. Gyssens, and D. Van Gucht. The Structure of the Relational Database Model. Number 17 in EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1989.
H.-B. Paul, H.-J. Schek, M.H. Scholl, G. Weikum, and U. Deppisch. Architecture and implementation of the Darmstadt Database kernel system. In U. Dayal and I. Traiger, editors, Proceedings of the ACM SIGMOD 1987 Annual Conference, number 16∶3 in SIGMOD Record, pages 196–207. ACM Press, 1987.
J. Paredaens and D. Van Gucht. Possibilities and limitations of using flat operators in nested algebra expressions. In ACM [ACM88], pages 29–38.
M. Roth, H. Korth, and A. Silberschatz. Extended algebra and calculus for nested relational databases. ACM Transactions on Database Systems, 13(4):389–417, 1988.
M.H. Scholl. Theoretical foundations of algebraic optimization utilizing unnormalized relations. In G. Ausiello and P. Atzeni, editors, International Conference on Database Theory, Proceedings, number 243 in Lecture Notes in Computer Science, pages 409–420. Springer-Verlag, 1986.
SIGMOD. Session on triggers and derived data. In Clifford et al. [CLM89].
SIGMOD. Special issue on rule management and processing in expert database systems. SIGMOD Record, 18(3), 1989.
SIGMOD. Session on rule processing systems. In H. Garcia-Molina and H.V. Jagadish, editors, Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, number 19∶2 in SIGMOD Record. ACM Press, 1990.
H.-J. Schek and M.H. Scholl. The relational model with relation-valued attributes. Information Systems, 11(2):137–147, 1986.
M.H. Scholl and H.-J. Schek. A relational object model. In Abiteboul and Kanellakis [AK90], pages 89–105.
S. Thomas and P. Fischer. Nested relational structures. In P. Kanellakis, editor, The Theory of Databases, pages 269–307. JAI Press, 1986.
J. Ullman. Principles of Database and Knowledge-Base Systems, volume II. Computer Science Press, 1989.
J. Van den Bussche. Active complex object databases. In J. Göers, A. Heuer, and G. Saake, editors, 3rd Workshop on Foundations of Models and Languages for Data and Objects, number 91/3 in Informatik-Bericht. TU Clausthal, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Van den Bussche, J. (1991). Evaluation and optimization of complex object selections. In: Delobel, C., Kifer, M., Masunaga, Y. (eds) Deductive and Object-Oriented Databases. DOOD 1991. Lecture Notes in Computer Science, vol 566. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55015-1_12
Download citation
DOI: https://doi.org/10.1007/3-540-55015-1_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55015-0
Online ISBN: 978-3-540-46646-8
eBook Packages: Springer Book Archive