A consistent hierarchical representation for vector data
SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
A population analysis for hierarchical data structures
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Analysis of object oriented spatial access methods
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Efficient structures for geometric data management
Efficient structures for geometric data management
Redundancy in spatial databases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
Proceedings of the sixteenth international conference on Very large databases
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Storing a collection of polygons using quadtrees
ACM Transactions on Graphics (TOG)
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An Implementation and Performance Analysis of Spatial Data Access Methods
Proceedings of the Fifth International Conference on Data Engineering
Efficient Processing of Spatial Queries in Line Segment Databases
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
A review of recent work on multi-attribute access methods
ACM SIGMOD Record
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
ACM SIGMOD Record
Efficient searching with linear constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Multidimensional access methods
ACM Computing Surveys (CSUR)
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SMR-tree: an efficient index structure for spatial databases
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Energy-performance trade-offs for spatial access methods on memory-resident data
The VLDB Journal — The International Journal on Very Large Data Bases
A Unified Approach for Indexed and Non-Indexed Spatial Joins
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Designing Energy-Efficient Software
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Scalable Sweeping-Based Spatial Join
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Analyzing energy behavior of spatial access methods for memory-resident data
Proceedings of the 27th International Conference on Very Large Data Bases
Performance of Data-Parallel Spatial Operations
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
V-Trees - A Storage Method for Long Vector Data
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The Impact of Global Clustering on Spatial Database Systems
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Benchmarking Spatial Join Operations with Spatial Output
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
A Quadtree Based Dynamic Attribute Index Structure and Query Process
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Object-based and image-based object representations
ACM Computing Surveys (CSUR)
Efficient and compact indexing structure for processing of spatial queries in line-based databases
Data & Knowledge Engineering
Spatial indexing in microsoft SQL server 2008
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Using B+-trees for processing of line segments in large spatial databases
Journal of Intelligent Information Systems
Open user schema guided evaluation of streaming RDF queries
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Multidimensional data structures for spatial applications
Algorithms and theory of computation handbook
Performance comparison of xBR-trees and R*-trees for single dataset spatial queries
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
A spatial index using MBR compression and hashing technique for mobile map service
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Evaluation of RDF queries via equivalence
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
A qualitative comparative study is performed of the performance of three popular spatial indexing methods - the R-tree, R+-tree, and the PMR quadtree-in the context of processing spatial queries in large line segment databases. The data is drawn from the TIGER/Line files used by the Bureau of the Census to deal with the road networks in the US. The goal is not to find the best data structure as this is not generally possible. Instead, their comparability is demonstrated and an indication is given as to when and why their performance differs. Tests are conducted with a number of large datasets and performance is tabulated in terms of the complexity of the disk activity in building them, their storage requirements, and the complexity of the disk activity for a number of tasks that include point and window queries, as well as finding the nearest line segment to a given point and an enclosing polygon.