EFFICIENT INDEXING OF LINES WITH THE MQR-TREE

Marc Moreau, Wendy Osborn

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.

References

  1. Gaede, V. and G √ľnther, O. (1998). Multidimensional access methods. ACM Computing Surveys, 30:170-231.
  2. Geological Survey of Canada (2006). Geoscience Data Repository, http://gdr.nrcan.gc.ca/index e.php. (visited March 2006).
  3. Guttman, A. (1984). R-trees: a dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 47-57.
  4. Hoel, E. and Samet, H. (1991). Efficient processing of spatial queries in line segment databases. In Proceedings of the Second International Symposium on Advances in Spatial Databases (SSD 7891).
  5. Lin, H.-Y. (2008a). Efficient and compact indexing structure for processing of spatial queries in line-based databases. Data and Knowledge Engineering, 64(1).
  6. Lin, H.-Y. (2008b). Using b+-trees for processing of line segments in large spatial databases. Journal of Intelligent Information Systems, 31(1).
  7. Moreau, M. and Osborn, W. (2008). Revisiting 2DR-tree insertion. In Proceedings of the 2008 Canadian Conference on Computer Science and Software Engineering.
  8. Moreau, M., Osborn, W., and Anderson, B. (2009). The mqr-tree: Improving upon a 2-dimensional spatial access method. In Proceedings of the 4th IEEE International Conference on Digital Information Management (ICDIM 2009).
  9. Research Collaboratory For Structural Bioinformatics (2004). Protein data bank, http://www.rcsb.org/pdb. (visited May 2004).
  10. Rigaux, P., Scholl, M., and Voisard, A. (2001). Spatial databases: with application to GIS. MorganKauffman.
  11. Samet, H. (1990). The design and analysis of spatial data structures. Addison-Wesley.
  12. Shekhar, S. and Chawla, S. (2003). Spatial Databases: A Tour. Prentice Hall.
  13. Theodoridis, Y. (2005). R-tree Portal, http://www.rtreeport al.org/. (visited March 2008).
Download


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