An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Traversal recursion: a practical approach to supporting recursive applications
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
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
Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Direct transitive closure algorithms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
Performance evaluation of algorithms for transitive closure
Information Systems
IEEE Transactions on Knowledge and Data Engineering
Evaluating Recursive Queries in Distributed Databases
IEEE Transactions on Knowledge and Data Engineering
On the Computation of the Transitive Closure of Relational Operators
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
New Strategies for Computing the Transitive Closure of a Database Relation
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Effective graph clustering for path queries in digital map databases
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
| Hi-index | 0.00 |
Spatial data are found in geographic information systems such as digital road map databases where city and road attributes are associated with nodes and links in a directed graph. Queries on spatial data are expensive because of the recursive property of graph traversal. We propose a graph indexing technique to expedite spatial queries where the graph topology remains relatively stationary. Using a probabilistic analysis, this paper shows that the graph indexing technique significantly improves the efficiency of constrained spatial queries.