Abstract
Efficient indexing on a class hierarchy is essential for the achievement of high performance in query evaluation for object databases. In this paper, we present a practical indexing scheme, Partition Index Configuration Scheme (PINS), which provides good index configurations for any real database environment. PINS considers the distribution of key values, as well as query patterns such as query frequency on each class. PINS can easily be applied to any database system, since it uses the B +-tree structure. We develop a cost model and, through experiments, demonstrate the performance of the proposed policy over various class hierarchies.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
