Sorting AR*-tree: Further improving the performance of partially-dimensional range queries

Yaokai Feng, Kunihiko Kaneko, Akifumi Makinouchi

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

抄録

It is well known that multidimensional indices are helpful to improve the performance of range queries in multi-dimensional spaces. An n-dimensional index is often used for evaluating n-dimensional queries. However in many applications using range queries, the query dimensions of each range query are likely of only part (rather than all) of the index dimensions]. Such range queries are referred to as partially-dimensional (PD) range queries in our previous study [1]. That is, although the index is built in an n-dimensional space, the actual range queries may only use d dimensions of the n dimensional index space (d < n). If the existing multidimensional indices are employed to evaluate PD range queries, then a great deal of information that is irrelevant to the queries also has to be read from disk. In order to solve this problem, we proposed a modification of R*-tree, called Adaptive R*-tree (AR*-tree). This paper is about how to further improve the search performance of the AR*-tree for PD range queries by sorting the entries in AR*-tree nodes.

本文言語英語
ホスト出版物のタイトル2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, Conference Proceedings, PACRIM
ページ375-378
ページ数4
DOI
出版ステータス出版済み - 12月 1 2007
イベント2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM - Victoria, BC, カナダ
継続期間: 8月 22 20078月 24 2007

出版物シリーズ

名前IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings

その他

その他2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM
国/地域カナダ
CityVictoria, BC
Period8/22/078/24/07

!!!All Science Journal Classification (ASJC) codes

  • 信号処理

フィンガープリント

「Sorting AR*-tree: Further improving the performance of partially-dimensional range queries」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル