Publication details
Efficient Processing of Narrow Range Queries in Multi-dimensional Data
| Authors | |
|---|---|
| Year of publication | 2006 |
| Type | Article in Proceedings |
| Conference | IDEAS06 Tenth International Database Engineering and Applications Symposium |
| MU Faculty or unit | |
| Citation | |
| Field | Informatics |
| Keywords | range search narrow query index structure |
| Description | Multi-dimensional data structures are applied in many real index applications, i.e. data mining, indexing multimedia data, indexing of text documents and so on. Many index structures and algorithms have been proposed. There are two major approaches to multi-dimensional indexing: data structures to indexing metric and vector spaces. R-trees, R*-trees and (B)UB-trees are representatives of the vector data structures. |
| Related projects: |