For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Design and Performance Analysis of Indexing Schemes for Set Retrieval of Nested Objects
Yoshiharu ISHIKAWA Hiroyuki KITAGAWA
IEICE TRANSACTIONS on Information and Systems
Publication Date: 1995/11/25
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Issue on Advanced Database Technologies)
set retrieval, nested object, signature file, nested index, access method, performance analysis,
Full Text: PDF(678.1KB)
>>Buy this Article
Efficient retrieval of nested objects is an important issue in advanced database systems. So far, a number of indexing methods for nested objects have been proposed. However, they do not consider retrieval of nested objects based on the set comparison operators such as and . Previouly, we proposed four set access facilities for nested objects and compared their performance in terms of retrieval cost, storage cost, and update cost. In this paper, we extend the study and present refined algorithms and cost formulas applicable to more generalized situations. Our cost models and analysis not only contribute to the study of set-valued retrieval but also to cost estimation of various indexing methods for nested objects in general.