%0 Journal Article %J IEEE Transactions on Knowledge and Data Engineering %D 2000 %T Logic-based query optimization for object databases %A Grant,J. %A Gryz,J. %A Minker, Jack %A Raschid, Louiqa %K access scope %K application domain %K class hierarchy information %K Constraint optimization %K data integrity %K Data models %K Datalog %K Datalog representation %K deductive databases %K equivalent logic query %K integrity constraints %K Lifting equipment %K Logic %K logic based query optimization %K logic programming %K logic queries %K logic query %K logical representation %K object data model %K object databases %K object queries %K object schema %K object-oriented databases %K ODL %K ODMG database schemas %K optimization technique %K optimized OQL queries %K OQL object query %K query languages %K Query optimization %K query optimization techniques %K Query processing %K Relational databases %K residue technique %K semantic knowledge %K semantic query optimization %X We present a technique for transferring query optimization techniques, developed for relational databases, into object databases. We demonstrate this technique for ODMG database schemas defined in ODL and object queries expressed in OQL. The object schema is represented using a logical representation (Datalog). Semantic knowledge about the object data model, e.g., class hierarchy information, relationship between objects, etc., as well as semantic knowledge about a particular schema and application domain are expressed as integrity constraints. An OQL object query is represented as a logic query and query optimization is performed in the Datalog representation. We obtain equivalent (optimized) logic queries, and subsequently obtain equivalent (optimized) OQL queries for each equivalent logic query. We present one optimization technique for semantic query optimization (SQO) based on the residue technique of U. Charavarthy et al. (1990; 1986; 1988). We show that our technique generalizes previous research on SQO for object databases. We handle a large class of OQL queries, including queries with constructors and methods. We demonstrate how SQO can be used to eliminate queries which contain contradictions and simplify queries, e.g., by eliminating joins, or by reducing the access scope for evaluating a query to some specific subclass(es). We also demonstrate how the definition of a method or integrity constraints describing the method, can be used in optimizing a query with a method %B IEEE Transactions on Knowledge and Data Engineering %V 12 %P 529 - 547 %8 2000/08//Jul %@ 1041-4347 %G eng %N 4 %R 10.1109/69.868906