Clustering a DAG for CAD Databases
IEEE Transactions on Software Engineering
A file structure supporting traversal recursion
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A stochastic approach for clustering in object bases
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
A general purpose multiple way partitioning algorithm
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Transitive closure algorithms based on graph traversal
ACM Transactions on Database Systems (TODS)
The SEQUOIA 2000 storage benchmark
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
IEEE Spectrum
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation
IEEE Transactions on Knowledge and Data Engineering
Algorithms for Searching Massive Graphs
IEEE Transactions on Knowledge and Data Engineering
The Design of the Cell Tree: An Object-Oriented Index Structure for Geometric Databases
Proceedings of the Fifth International Conference on Data Engineering
DOT: A Spatial Access Method Using Fractals
Proceedings of the Seventh International Conference on Data Engineering
A Spanning Tree Transitive Closure Algorithm
Proceedings of the Eighth International Conference on Data Engineering
I/O-Efficiency of Shortest Path Algorithms: An Analysis
Proceedings of the Eighth International Conference on Data Engineering
Efficient Evaluation of Traversal Recursive Queries Using Connectivity Index
Proceedings of the Ninth International Conference on Data Engineering
An Access Structure for Generalized Transitive Closure Queries
Proceedings of the Ninth International Conference on Data Engineering
Path Computation Algorithms for Advanced Traveller Information System (ATIS)
Proceedings of the Ninth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Bulk Loading into an OODB: A Performance Study
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Sibling clustering of tree-based spatial indexes for efficient spatial query processing
Proceedings of the seventh international conference on Information and knowledge management
Direction as a spatial object: a summary of results
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
An improved network clustering method for I/O-efficient query processing
Proceedings of the 8th ACM international symposium on Advances in geographic information systems
Detecting graph-based spatial outliers: algorithms and applications (a summary of results)
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
An Object Model of Direction and Its Implications
Geoinformatica
Spatial Databases-Accomplishments and Research Needs
IEEE Transactions on Knowledge and Data Engineering
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
IEEE Transactions on Knowledge and Data Engineering
A Linear-Order Based Access Method for Efficient Network Computations
EDCIS '02 Proceedings of the First International Conference on Engineering and Deployment of Cooperative Information Systems
Dynamic Spatial Clustering for Intelligent Mobile Information Sharing and Dissemination
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Clustering objects on a spatial network
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Aggregate Nearest Neighbor Queries in Road Networks
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the 2006 ACM symposium on Applied computing
Modeling and querying moving objects in networks
The VLDB Journal — The International Journal on Very Large Data Bases
Distance indexing on road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Detecting graph-based spatial outliers
Intelligent Data Analysis
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
A multi-resolution surface distance model for k-NN query processing
The VLDB Journal — The International Journal on Very Large Data Bases
Should SDBMS support a join index?: a case study from CrimeStat
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Time-Aggregated Graphs for Modeling Spatio-temporal Networks
Journal on Data Semantics XI
Fast object search on road networks
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Versioning of Network Models in a Multiuser Environment
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
SP-TAG: a routing algorithm in non-stationary transportation networks
Proceedings of the 5th Annual International Conference on Mobile and Ubiquitous Systems: Computing, Networking, and Services
Navigational path privacy protection: navigational path privacy protection
Proceedings of the 18th ACM conference on Information and knowledge management
Monitoring minimum cost paths on road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Modeling spatio-temporal network computations: a summary of results
GeoS'07 Proceedings of the 2nd international conference on GeoSpatial semantics
S-GRID: a versatile approach to efficient query processing in spatial networks
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Spatio-temporal network databases and routing algorithms: a summary of results
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Efficient successor retrieval operations for aggregate query processing on clustered road networks
Information Sciences: an International Journal
A Lagrangian approach for storage of spatio-temporal network datasets: a summary of results
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
STS: complex spatio-temporal sequence mining in flickr
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
The detection of scene features in Flickr
ICWL'10 Proceedings of the 2010 international conference on New horizons in web-based learning
An incremental approach to closest pair queries in spatial networks using best-first search
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Multi-approximate-keyword routing in GIS data
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Fast nearest neighbor search on road networks
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
The islands approach to nearest neighbor querying in spatial networks
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
On trip planning queries in spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Multiple k nearest neighbor query processing in spatial network databases
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Moving objects in networks databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Moving Query Monitoring in Spatial Network Environments
Mobile Networks and Applications
A P2P technique for continuous k-nearest-neighbor query in road networks
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Hi-index | 0.00 |
Current Spatial Database Management Systems (SDBMS) provide efficient access methods and operators for point and range queries over collections of spatial points, line segments, and polygons. However, it is not clear if existing spatial access methods can efficiently support network computations which traverse line-segments in a spatial network based on connectivity rather than geographic proximity. The expected I/O cost for many network operations can be reduced by maximizing the Weighted Connectivity Residue Ratio (WCRR), i.e., the chance that a pair of connected nodes that are more likely to be accessed together are allocated to a common page of the file. CCAM is an access method for general networks that uses connectivity clustering. CCAM supports the operations of insert, delete, create, and find as well as the new operations, get-A-successor and get-successors, which retrieve one or all successors of a node to facilitate aggregate computations on networks. The nodes of the network are assigned to disk pages via a graph partitioning approach to maximize the WCRR. CCAM includes methods for static clustering, as well as dynamic incremental reclustering, to maintain high WCRR in the face of updates, without incurring high overheads. We also describe possible modifications to improve the WCRR that can be achieved by existing spatial access methods. Experiments with network computations on the Minneapolis road map show that CCAM outperforms existing access methods, even though the proposed modifications also substantially improve the performance of existing spatial access methods.