Vertical class partitioning and complex object retrieval in object oriented databases

Fung, Chi-Wai

doi:10.14711/thesis-b612488

Cited by 5 publications

(5 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A cost model for processing the queries and maintaining the indices is developed. Our performance results [8] demonstrated the utility of the three SJIHs, and showed the superiority of a selected SJIH over other indexing schemes, such as nested index, multi-index and access support relation. Example applications that can benefit from our SJIH framework for OODBs include manufacturing engineering design (CAD/CAM) systems, and data warehousing/OLAP query processing [18].…”

Section: Discussionmentioning

confidence: 63%

“…Table 1 presents the basic cost model parameters, some of the parameter values used are taken from [17,2,15,19,9,1,6,7,8]. To better compare with previous work and evaluate the usefulness of the different indices in SJIH, as in [15,19], we neglect the disk access cost for evaluating the predicates, which is assumed to be the same for the different indices.…”

Section: Cost Model For Evaluating Sjihmentioning

confidence: 99%

“…As derived in [8], the MF is calculated by: , where K (a constant) and OP (an operation on the forward fan-out values) are summarized in Table 2.…”

Section: Definition 8 -Multiplying Factormentioning

confidence: 99%

“…Due to the space limit, interested readers are referred to [8] for the detailed index update cost model for SJIH. The general features are summarized as follows: (a) Similar to the storage cost (Section 4.1) and index retrieval costs (Section 4.2), the constrained/unconstrained pair-ups between the different branches of the CCH have a great impact on the index update cost.…”

Section: Index Update Costmentioning

confidence: 99%

“…(c) We perform analytical experiments to show that there is a wide range of parameters for which SJIH is beneficial. (Due to the page limit, refer to [8] for details.) (d) We present and conduct experiments on the SJIH selection algorithm for optimal or near-optimal index selection.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Complex object retrieval via structural join index hierarchy mechanisms

Fung

Karlapalem

2000

Proceedings of the Ninth International Conference on Information and Knowledge Management

Self Cite

View full text Add to dashboard Cite

In this paper, we introduce structural join index hierarchy (SJIH) mechanisms that mimic the class composition hierarchy of the complex objects to provide direct access to complex objects and/or their component objects. SJIH extends the work on join index hierarchies by providing efficient and flexible access to complex objects, thus unifying various previous indexing methods proposed for object oriented database (OODB). A cost model for processing the queries and maintaining the indices is developed. A heuristic algorithm is designed to select appropriate indices to efficiently process a given set of queries. We show that SJIH indexing mechanisms facilitate efficient retrieval of complex objects. Given a set of queries and a limited index storage space, the heuristic algorithm facilitates fast selection of near-optimal set of indices for efficiently executing the queries.

show abstract

Section: Discussionmentioning

confidence: 63%