A linear-order based access method for efficient network computations

Sung Ho Woo, Sung Bong Yang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationEngineering and Deployment of Cooperative Information Systems - 1st International Conference, EDCIS 2002, Proceedings
PublisherSpringer Verlag
Pages289-302
Number of pages14
Volume2480
ISBN (Electronic)9783540442226
Publication statusPublished - 2002 Jan 1
Event1st International Conference on Engineering and Deployment of Cooperative Information Systems, EDCIS 2002 - Beijing, China
Duration: 2002 Sep 172002 Sep 20

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2480
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Conference on Engineering and Deployment of Cooperative Information Systems, EDCIS 2002
CountryChina
CityBeijing
Period02/9/1702/9/20

Fingerprint

Linear Order
Costs
Clustering
Experiments
Shortest path
Query
Requirements
Vertex of a graph
Experiment

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Woo, S. H., & Yang, S. B. (2002). A linear-order based access method for efficient network computations. In Engineering and Deployment of Cooperative Information Systems - 1st International Conference, EDCIS 2002, Proceedings (Vol. 2480, pp. 289-302). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2480). Springer Verlag.
Woo, Sung Ho ; Yang, Sung Bong. / A linear-order based access method for efficient network computations. Engineering and Deployment of Cooperative Information Systems - 1st International Conference, EDCIS 2002, Proceedings. Vol. 2480 Springer Verlag, 2002. pp. 289-302 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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 = "1",
day = "1",
language = "English",
volume = "2480",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "289--302",
booktitle = "Engineering and Deployment of Cooperative Information Systems - 1st International Conference, EDCIS 2002, Proceedings",
address = "Germany",

}

Woo, SH & Yang, SB 2002, A linear-order based access method for efficient network computations. in Engineering and Deployment of Cooperative Information Systems - 1st International Conference, EDCIS 2002, Proceedings. vol. 2480, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2480, Springer Verlag, pp. 289-302, 1st International Conference on Engineering and Deployment of Cooperative Information Systems, EDCIS 2002, Beijing, China, 02/9/17.

A linear-order based access method for efficient network computations. / Woo, Sung Ho; Yang, Sung Bong.

Engineering and Deployment of Cooperative Information Systems - 1st International Conference, EDCIS 2002, Proceedings. Vol. 2480 Springer Verlag, 2002. p. 289-302 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2480).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A linear-order based access method for efficient network computations

AU - Woo, Sung Ho

AU - Yang, Sung Bong

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84931419802&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84931419802&partnerID=8YFLogxK

M3 - Conference contribution

VL - 2480

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 289

EP - 302

BT - Engineering and Deployment of Cooperative Information Systems - 1st International Conference, EDCIS 2002, Proceedings

PB - Springer Verlag

ER -

Woo SH, Yang SB. A linear-order based access method for efficient network computations. In Engineering and Deployment of Cooperative Information Systems - 1st International Conference, EDCIS 2002, Proceedings. Vol. 2480. Springer Verlag. 2002. p. 289-302. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).