Efficient evaluation of partially-dimensional range queries using adaptive R*-tree

Yaokai Feng, Akifumi Makinouchi

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

4 被引用数 (Scopus)

抄録

This paper is about how to efficiently evaluate partially-dimensional range queries, which are often used in many actual applications. If the existing multidimensional indices are employed to evaluate partially-dimensional range queries, then a great deal of information that is irrelevant to the queries also has to be read from disk. A modification of R*-tree is described in this paper to ameliorate such a situation. Discussions and experiments indicate that the proposed modification can clearly improve the performance of partially-dimensional range queries, especially for large datasets.

本文言語英語
ホスト出版物のタイトルDatabase and Expert Systems Applications - 17th International Conference, DEXA 2006, Proceedings
出版社Springer Verlag
ページ687-696
ページ数10
4080 LNCS
ISBN(印刷版)3540378715, 9783540378716
出版ステータス出版済み - 2006
イベント17th International Conference on Database and Expert Systems Applications, DEXA 2006 - Krakow, ポーランド
継続期間: 9 4 20069 8 2006

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4080 LNCS
ISSN(印刷版)03029743
ISSN(電子版)16113349

その他

その他17th International Conference on Database and Expert Systems Applications, DEXA 2006
Countryポーランド
CityKrakow
Period9/4/069/8/06

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Theoretical Computer Science

フィンガープリント 「Efficient evaluation of partially-dimensional range queries using adaptive R*-tree」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル