On Support of Ordering in Multidimensional Data Structures

Multidimensional data structures are applied in many areas, e.g. in data mining, indexing multimedia data and text documents, and so on. There are some applications where the range query result must be ordered. A typical case is the result with tuples sorted according to values in one dimension defined by the ORDER BY clause of an SQL statement. If we use a multidimensional data structure, the result set is sorted after the range query is processed. Since the sort operation must often be processed on tuples stored in the secondary storage, an external sorting algorithm must be utilized. Therefore, this operation is time consuming especially for a large result set. In this paper, we introduce a new data structure, a variant of the R-tree, supporting a storage of ordered tuples.

• Type: Conference
• Year: 2010
• Where: ADBIS
• Authors: Filip Krizka, Michal Krátký, Radim Baca
• Keywords: ADBIS 2010, Database, Indexing Multimedia Data, Multidimensional Data Structure, Range Query