Design and Performance Analysis of Indexing Schemes for Set Retrieval of Nested Objects
スポンサーリンク
概要
- 論文の詳細を見る
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 ⫅. Previously, 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.
- 社団法人電子情報通信学会の論文
- 1995-11-25
著者
-
Ishikawa Yoshiharu
Graduate Institute Of Information Science Nara Institute Of Science And Technology (naist)
-
Ishikawa Yoshiharu
Graduate Institute Of Information Science Nara Institute Of Science And Technology
-
KITAGAWA Hiroyuki
Institute of Information Sciences and Electronics, University of Tsukuba
-
Kitagawa Hiroyuki
Institute Of Information Sciences And Electronics University Of Tsukuba
-
Kitagawa Hiroyuki
Institute Of Information Science And Electronics University Of Tsukuba
関連論文
- False Drop Analysis of Set Retrieval with Signature Files
- Requirement Specification and Derivation of ECA Rules for Integrating Multiple Dissemination-Based Information Sources (the 2002 IEICE Excellent Paper Award)
- Requirement Specification and Derivation of ECA Rules for Integrating Multiple Dissemination-Based Information Sources
- Design and Performance Analysis of Indexing Schemes for Set Retrieval of Nested Objects
- Optimization of Join-Type Queries in Nested Relational Databases
- Join Query Optimization in Object-Oriented Database
- A Web Search Method Integrating Taxonomy-based and Crawler-based Search Engines