### 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 | Stefan Tai, Yanbo Han, Dietmar Wikarski |

Publisher | Springer Verlag |

Pages | 289-302 |

Number of pages | 14 |

ISBN (Electronic) | 9783540442226 |

Publication status | Published - 2002 Jan 1 |

Event | 1st International Conference on Engineering and Deployment of Cooperative Information Systems, EDCIS 2002 - Beijing, China Duration: 2002 Sep 17 → 2002 Sep 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 | China |

City | Beijing |

Period | 02/9/17 → 02/9/20 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cite this

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

}

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

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

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

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

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 - Tai, Stefan

A2 - Han, Yanbo

A2 - Wikarski, Dietmar

PB - Springer Verlag

ER -