The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Database Systems: The Complete Book
Database Systems: The Complete Book
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The Universal B-Tree for Multidimensional Indexing: general Concepts
WWCA '97 Proceedings of the International Conference on Worldwide Computing and Its Applications
Relational Database Index Design and the Optimizers
Relational Database Index Design and the Optimizers
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
A new range query algorithm for universal B-trees
Information Systems
Physical Database Design: the database professional's guide to exploiting indexes, views, storage, and more
Algorithms and Data Structures for External Memory
Algorithms and Data Structures for External Memory
Multidimensional implementation of stream ADT
WAIM'11 Proceedings of the 2011 international conference on Web-Age Information Management
| Hi-index | 0.00 |
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.