A consistent hierarchical representation for vector data
SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
Analysis of object oriented spatial access methods
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Fundamentals of database systems
Fundamentals of database systems
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
A general approach to connected-component labeling for arbitrary image representations
Journal of the ACM (JACM)
Efficient processing of window queries in the pyramid data structure
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Connected Component Labeling Using Quadtrees
Journal of the ACM (JACM)
File Structures
Digital Picture Processing
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The Design of the Cell Tree: An Object-Oriented Index Structure for Geometric Databases
Proceedings of the Fifth International Conference on Data Engineering
Cascaded spatial join algorithms with spatially sorted output
GIS '96 Proceedings of the 4th ACM international workshop on Advances in geographic information systems
ACM Transactions on Database Systems (TODS)
Object-based and image-based object representations
ACM Computing Surveys (CSUR)
Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing
ACM Transactions on Database Systems (TODS)
Remote thin-client access to spatial database systems
dg.o '02 Proceedings of the 2002 annual national conference on Digital government research
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
A sorting approach to indexing spatial data
ACM SIGGRAPH 2008 classes
Multidimensional data structures for spatial applications
Algorithms and theory of computation handbook
ACM SIGGRAPH ASIA 2010 Courses
Multiresolution select-distinct queries on large geographic point sets
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
TOUCH: in-memory spatial join by hierarchical data-oriented partitioning
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Indexing methods for moving object databases: games and other applications
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Hi-index | 0.00 |
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures (e.g., the quadtree, the cell tree, the R+-tree) represent an object by partitioning it into multiple, yet simple, pieces, each of which is stored separately inside the data structure. Many operations on these data structures are likely to produce duplicate results because of the multiplicity of object pieces. A novel approach for duplicate processing based on proximity of spatial objects is presented. This is different from conventional duplicate elimination in database systems because, with spatial databases, different pieces of the same object can span multiple buckets of the underlying data structure. Example algorithms are presented to perform duplicate processing using proximity for quadtree representation of line segments and arbitrary rectangles. The complexity of the algorithms is seen to depend on a geometric classification of different instances of the spatial objects. By using proximity and the spatial properties of the objects, the number of disk-I/O requests as well as the run-time storage during duplicate processing can be reduced.