TY - GEN
T1 - Derived horizontal class partitioning in OODBs
T2 - 17th International Conference on Conceptual Modeling, ER 1998
AU - Bellatreche, Ladjel
AU - Karlapalem, Kamalakar
AU - Li, Qing
PY - 1998
Y1 - 1998
N2 - Object oriented database systems (OODBSs) have been used for advanced applications that require not only additional data modeling capabilities, but also for efficient query processing. In this paper, we apply the derived horizontal class partitioning (DHCP) technique to facilitate efficient execution of a set of queries. We apply the existing algorithms for determining horizontal class partitioning of a class for a given set of queries. Our contribution is in developing strategies for deciding the derived horizontal class partitioning of the classes, developing an analytical cost model for determining the cost of processing queries under horizontal class partitioning, and conducting experiments to evaluate the utility of DHCP in efficiently executing the queries. The experimental results show that DHCP improves the overall efficiency of query execution under different object sizes and cardinality of classes, fan-out of the classes and DHCP of all classes along the class-composition hierarchy gives the best result. Further, we have classified the queries to determine the effect of DHCP on different types of queries. In particular, we find that DHCP has detrimental affect on queries that access only one class. Thus, the results from this work can be used to design object-oriented databases to efficiently process a set of queries.
AB - Object oriented database systems (OODBSs) have been used for advanced applications that require not only additional data modeling capabilities, but also for efficient query processing. In this paper, we apply the derived horizontal class partitioning (DHCP) technique to facilitate efficient execution of a set of queries. We apply the existing algorithms for determining horizontal class partitioning of a class for a given set of queries. Our contribution is in developing strategies for deciding the derived horizontal class partitioning of the classes, developing an analytical cost model for determining the cost of processing queries under horizontal class partitioning, and conducting experiments to evaluate the utility of DHCP in efficiently executing the queries. The experimental results show that DHCP improves the overall efficiency of query execution under different object sizes and cardinality of classes, fan-out of the classes and DHCP of all classes along the class-composition hierarchy gives the best result. Further, we have classified the queries to determine the effect of DHCP on different types of queries. In particular, we find that DHCP has detrimental affect on queries that access only one class. Thus, the results from this work can be used to design object-oriented databases to efficiently process a set of queries.
UR - https://www.scopus.com/pages/publications/84957798063
UR - https://www.scopus.com/pages/publications/84957798063#tab=impact
U2 - 10.1007/978-3-540-49524-6_36
DO - 10.1007/978-3-540-49524-6_36
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 3540651896
SN - 9783540651895
VL - 1507
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 465
EP - 479
BT - Conceptual Modeling - ER 1998
A2 - Ram, Sudha
A2 - Ling, Tok Wang
A2 - Lee, Mong Li
PB - Springer Verlag
Y2 - 16 November 1998 through 19 November 1998
ER -