Other formats:
BibTeX
LaTeX
RIS
@inproceedings{701598,
author = {Kratky, Michal and Snasel, Vaclav and Pokorny, Jaroslav and Zezula, Pavel},
address = {USA},
booktitle = {IDEAS06 Tenth International Database Engineering and Applications Symposium},
keywords = {range search narrow query index structure},
language = {eng},
location = {USA},
isbn = {0-7695-2577-6},
pages = {37-46},
publisher = {IEEE},
title = {Efficient Processing of Narrow Range Queries in Multi-dimensional Data},
year = {2006}
}
TY - JOUR
ID - 701598
AU - Kratky, Michal - Snasel, Vaclav - Pokorny, Jaroslav - Zezula, Pavel
PY - 2006
TI - Efficient Processing of Narrow Range Queries in Multi-dimensional Data
PB - IEEE
CY - USA
SN - 0769525776
KW - range search narrow query index structure
N2 - 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.
ER -
KRATKY, Michal, Vaclav SNASEL, Jaroslav POKORNY and Pavel ZEZULA. Efficient Processing of Narrow Range Queries in Multi-dimensional Data. In \textit{IDEAS06 Tenth International Database Engineering and Applications Symposium}. USA: IEEE, 2006, p.~37-46. ISBN~0-7695-2577-6.
|
