EFFICIENT INDEXING OF LINES WITH THE MQR-TREE

Marc Moreau, Wendy Osborn

2011

Abstract

This paper presents an evaluation of the mqr-tree for indexing a database of line data. Many spatial access methods have been proposed for handling either point or region data, with the vast majority able to handle these data types efficiently. However, line segment data presents challenges for most spatial access methods. Recent work on the mqr-tree showed much potential for efficiently indexing line data. We identify limitations of the data sets in the initial evaluation. Then, we further evaluate the ability of the mqr-tree to efficiently index line sets with different organizations that address the limitations of the initial test. A comparison versus the R-tree shows that the mqr-tree achieves significantly lower overlap and overcoverage, which makes the mqr-tree a significant candidate for indexing line and line-segment data.

Paper Citation

in Harvard Style

Moreau M. and Osborn W. (2011). EFFICIENT INDEXING OF LINES WITH THE MQR-TREE . In Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-989-8425-53-9, pages 314-319. DOI: 10.5220/0003554403140319

in Bibtex Style

@conference{iceis11,
author={Marc Moreau and Wendy Osborn},
title={EFFICIENT INDEXING OF LINES WITH THE MQR-TREE},
booktitle={Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2011},
pages={314-319},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003554403140319},
isbn={978-989-8425-53-9},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - EFFICIENT INDEXING OF LINES WITH THE MQR-TREE
SN - 978-989-8425-53-9
AU - Moreau M.
AU - Osborn W.
PY - 2011
SP - 314
EP - 319
DO - 10.5220/0003554403140319