A linear-order based access method for efficient network computations

Sung Ho Woo; Sung Bong Yang

doi:10.1007/3-540-45785-2_23

A linear-order based access method for efficient network computations

Sung Ho Woo, Sung Bong Yang

College of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Engineering and Deployment of Cooperative Information Systems - 1st International Conference, EDCIS 2002, Proceedings
Editors	Yanbo Han, Stefan Tai, Dietmar Wikarski
Publisher	Springer Verlag
Pages	289-302
Number of pages	14
ISBN (Electronic)	9783540442226
DOIs	https://doi.org/10.1007/3-540-45785-2_23
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

Publication series

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

Other

Other	1st International Conference on Engineering and Deployment of Cooperative Information Systems, EDCIS 2002
Country/Territory	China
City	Beijing
Period	02/9/17 → 02/9/20

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-45785-2_23

Cite this

Woo, S. H., & Yang, S. B. (2002). A linear-order based access method for efficient network computations. In Y. Han, S. Tai, & D. Wikarski (Eds.), Engineering and Deployment of Cooperative Information Systems - 1st International Conference, EDCIS 2002, Proceedings (pp. 289-302). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2480). Springer Verlag. https://doi.org/10.1007/3-540-45785-2_23

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. editor / Yanbo Han ; Stefan Tai ; Dietmar Wikarski. 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}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 1st International Conference on Engineering and Deployment of Cooperative Information Systems, EDCIS 2002 ; Conference date: 17-09-2002 Through 20-09-2002",

year = "2002",

doi = "10.1007/3-540-45785-2_23",

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 = "Yanbo Han and Stefan Tai and Dietmar Wikarski",

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 Y Han, S Tai & D Wikarski (eds), Engineering and Deployment of Cooperative Information Systems - 1st International Conference, EDCIS 2002, Proceedings. 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. https://doi.org/10.1007/3-540-45785-2_23

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. ed. / Yanbo Han; Stefan Tai; Dietmar Wikarski. 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 proceeding › Conference contribution

TY - GEN

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

AU - Woo, Sung Ho

AU - Yang, Sung Bong

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2002.

PY - 2002

Y1 - 2002

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

U2 - 10.1007/3-540-45785-2_23

DO - 10.1007/3-540-45785-2_23

M3 - Conference contribution

AN - SCOPUS:84931419802

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

A2 - Han, Yanbo

A2 - Tai, Stefan

A2 - Wikarski, Dietmar

PB - Springer Verlag

T2 - 1st International Conference on Engineering and Deployment of Cooperative Information Systems, EDCIS 2002

Y2 - 17 September 2002 through 20 September 2002

ER -

Woo SH, Yang SB. A linear-order based access method for efficient network computations. In Han Y, Tai S, Wikarski D, editors, Engineering and Deployment of Cooperative Information Systems - 1st International Conference, EDCIS 2002, Proceedings. Springer Verlag. 2002. p. 289-302. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45785-2_23

A linear-order based access method for efficient network computations

Abstract

Publication series

Other

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this