This work is supported in part by NSF under grant IRI-9509955.
References
S. Cluet and C, Delobel. A General Framework for the Optimization of Object-Oriented Queries. SIGMOD'92, pp 383–392, June 1992.
L. Fegaras. An Experimental Optimizer for OQL. Submitted to ICDE97. Available at http://www-cse.uta.edu/fegaras/icde97.ps.gz.
Y. Ioannidis and Y, Kang. Randomized Algorithms for Optimizing Large Join Queries. SIGMOD'90, pp 312–321, May 1990.
P. Selinger, M. Astrahan, D. Chamberlin, R. Lorie, and T. Price, Access Path Selection in a Relational Database Management System. SIGMOD'79, pp 23–34, May 1979
M. Stoer and F. Wagner. A Simple Min Cut Algorithm, Jan van Leeuwen (Ed.): Algorithms — ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, pp 141–147, September 1994. LNCS 855.
A. Swami. Optimization of Large Join Queries: Combining Heuristics and Combinatorial Techniques, SIGMOD'89, pp 367–376, May 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fegaras, L. (1997). Optimizing large OODB queries. In: Bry, F., Ramakrishnan, R., Ramamohanarao, K. (eds) Deductive and Object-Oriented Databases. DOOD 1997. Lecture Notes in Computer Science, vol 1341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63792-3_31
Download citation
DOI: https://doi.org/10.1007/3-540-63792-3_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63792-9
Online ISBN: 978-3-540-69647-6
eBook Packages: Springer Book Archive