EFFICIENT INDEXING OF LINES WITH THE MQR-TREE
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.
Spatial access methods Lines
Marc Moreau Wendy Osborn
Department of Mathematics and Computer Science, University of Lethbridge 4401 University Drive West, Lethbridge, Alberta, Canada
国际会议
13th International Conference on Enterprise Information System(第13届企业信息系统国际会议 ICEIS 2011)
北京
英文
2200-2205
2011-06-08(万方平台首次上网日期,不代表论文的发表时间)