@inproceedings{2ce593198542434aa48943d86a7164a7,
title = "A linear-order based access method for efficient network computations",
abstract = "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.",
author = "Woo, {Sung Ho} and Yang, {Sung Bong}",
year = "2002",
month = jan,
day = "1",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "289--302",
editor = "Stefan Tai and Yanbo Han and Dietmar Wikarski",
booktitle = "Engineering and Deployment of Cooperative Information Systems - 1st International Conference, EDCIS 2002, Proceedings",
address = "Germany",
note = "1st International Conference on Engineering and Deployment of Cooperative Information Systems, EDCIS 2002 ; Conference date: 17-09-2002 Through 20-09-2002",
}