Query optimization using horizontal class partitioning in object oriented databases
نویسندگان
چکیده
Query processing remains one of the most important challenges of object oriented database systems (OODBSs). A cost model for query processing is very useful in performing the physical query optimization. Horizontal class partitioning (HCP) is a technique for reducing the number of disk accesses for executing a given set of queries by minimizing the number of irrelevant object instances accessed. Moreover, its importance in reduction of query execution time has been widely acknowledged. However, existing cost models for query processing in OODBSs do not take into consideration the HCP criteria. In this paper, we present an analytical cost model for query execution for unpartitioned and horizontally partitioned classes. This cost is necessary for deciding whether to use HCP or to keep all classes unpartitioned. The eeect of HCP upon the query execution process is analyzed.
منابع مشابه
Horizontal Class Partitioning for Queries in Object-Oriented Databases
Horizontal partitioning is a technique for reducing the number of disk accesses to execute a query by minimizing the number of irrelevant instances accessed. In this paper, we develop a cost model for query execution in the case of unpartitioned and horizontally partitioned classes. We present three algorithms to perform horizontal partitioning in OODBSs, namely: Cost-Driven Algorithm(CDA), Pre...
متن کاملQuery-Driven Horizontal Class Partitioning for Object-Oriented Databases
Horizontal partitioning (HP) technique is a logical database design technique rst developed for distributed relational (record struc-tured) databases. Though the main objective of HP is to reduce irrelevant data access, there has been very little work done in quantifying this by means of a cost model, and developing algorithms which derive the horizontal partitioning schemes. In this paper, we ...
متن کاملHorizontal Class Partitioning in Object-Oriented Databases
The Horizontal Fragmentation (HF) is a process for reducing the number of disk access to execute a query by reducing the number of irrelevant objects accessed. In this paper, we present horizontal fragmentation based on a set of queries, and develop strategies for two versions of HF: primary and derived. Primary horizontal fragmentation of a class is performed using predicates of queries access...
متن کاملPartitioning Schemes for Object Oriented Databases 1
In order to support homogeneous distributed object oriented database systems we need to have a clear understanding of what is meant by partitioning a class and what are the diierent ways of doing so. In this paper, we concentrate on studying the diierent types of class partitioning schemes that can arise in object oriented databases. By laying down the foundation by articulating the concepts, r...
متن کاملSemantic Query Optimization based on Class Partitioning Techniques in an Object Relational Data Warehousing Environment*
The conventional star schema model of Data Warehouse (DW) has its limitations due to the nature of the relational data model. Firstly, this model cannot represent the semantics and operations of multi-dimensional data adequately. Due to the hidden semantics, it is difficult to efficiently address the problems of view design. Secondly, as we move up to higher levels of summary data (multiple com...
متن کامل