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
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Transitive closure algorithms based on graph traversal
ACM Transactions on Database Systems (TODS)
Multidimensional access methods
ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithms for Searching Massive Graphs
IEEE Transactions on Knowledge and Data Engineering
Path Signatures: A Way to Speed Up Recursion in Relational Databases
IEEE Transactions on Knowledge and Data Engineering
CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve
IEEE Transactions on Knowledge and 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 Impact of Global Clustering on Spatial Database Systems
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
It is well known that the disk-I/O costs of network computations, for example, finding a shortest path between two vertices, can be reduced by clustering the connected vertices in the network to the same disk page. This paper studies a network access method which is based from a linear order for the vertices in a given network. In order to compute network queries efficiently, a linear order should preserve a "good" clustering property of a network. For this requirement, we present a hierarchical vertex ordering method which obtains a linear order of the vertices in a simple but effective way. In experiments, various access methods are evaluated by comparing the I/O costs of the network computations. The access method constructed from the proposed ordering method outperforms other methods in most cases.