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.
|Title of host publication||Engineering and Deployment of Cooperative Information Systems - 1st International Conference, EDCIS 2002, Proceedings|
|Editors||Yanbo Han, Stefan Tai, Dietmar Wikarski|
|Number of pages||14|
|Publication status||Published - 2002|
|Event||1st International Conference on Engineering and Deployment of Cooperative Information Systems, EDCIS 2002 - Beijing, China|
Duration: 2002 Sept 17 → 2002 Sept 20
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||1st International Conference on Engineering and Deployment of Cooperative Information Systems, EDCIS 2002|
|Period||02/9/17 → 02/9/20|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)