S. Zdonik, Query Optimization in Object-Oriented Databases. Proc., the 23rd annual Hawaii intl. conf. on system sciences. 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Approximation-based Query Evaluation, Expensive.. - Alexander Brodsky And (1995) (Correct)
....Logic Programming. December 1995. The work of Brodsky was supported in part by NSF RIA grant IRI 9409770, and by Office of Naval Research under prime grant No. N00014 94 1 1153. The work of Wang was supported in part by NSF RIA grant IRI 9409769, and by NSF grant BIR 9404831 [S86] ENCORE [Z89], O2 [D90] ORION [JWKL90] POSTGRESS [SRH90] and Illustra) Object Store [OHMS92] Open OODB [BKG93] and UniSQL. Surprising is that while these systems targeted to a large extent the above mentioned application realms, little was done to address the problem of optimization in the presence of ....
S. Zdonik, Query Optimization in Object-Oriented Databases. Proc., the 23rd annual Hawaii intl. conf. on system sciences. 1989.
Constraint Object-Oriented Database System - Victor (1996) (Correct)
....again with monoid comprehension queries. For example, SAT(D) where D is of type Gen Disj T , is represented as SELECT SAT(c) INTO Some satisfflag FROM D AS T c 5 Optimization by Approximation based Filtering and Indexing General optimization of object oriented queries (e.g. ENCORE [Zdo] O2 [ea90], POSTGRESS [SRH90] and monoid comprehensions in particular, e.g. FM] as well as optimization in presence of expensive predicates [CS, HS] is outside the scope of this paper; We concentrate here on approximation based filtering, regrouping and indexing [BW95] that C 3 is designed to ....
S. Zdonik. Query optimization in object-oriented databases. In Proc. 23rd annual Hawaii Intl. Conf. on System Sciences. 24
On Approximation-based Query Evaluation, Expensive.. - Alexander Brodsky And (Correct)
....optimization techniques are not sufficient and require considerable re design. There has been extensive work on object oriented and extensible database processing, which led to the development of research prototypes as well as commercially available systems, such as Starburst [S86] ENCORE [Z89], O2 [D90] ORION [JWKL90] POSTGRESS [SRH90] and Illustra) Object Store The work of Brodsky was supported in part by NSF RIA grant IRI 9409770, and by Office of Naval Research under prime grant No. N00014 94 1 1153. y The work of Wang was supported in part by NSF RIA grant IRI 9409769, and by ....
S. Zdonik, Query Optimization in Object-Oriented Databases. Proc., the 23rd annual Hawaii intl. conf. on system sciences. 1989.
Compiling Object-Oriented Queries - Leung (1993) (Correct)
....data structure used to improve database query performance[22, 67] Indices make use of a search data structure like b tree to reduce the amount of data that must be searched in order to find the answer to a query. There have been a number of proposals for indices in object oriented databases[68, 10, 9, 93, 54, 55], each with their own strengths and weaknesses. The ability to make use of indices is a crucial requirement for a plan generation system. 2.7.3 Clustering The objective of clustering is place related objects close together physically, so that retrieving one object from disk causes all the related ....
Stanley B. Zdonik. Query optimization in object oriented databases. In Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences, pages 19--25. IEEE, IEEE Computer Society Press, January 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC