An XML data allocation method on disks

Jung Hoon Kim, Yon Dohn Chung, Myoung H. Kim

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

XML recently has expanded its application areas: data formats in various information systems, communication protocols in distributed systems, and so on. Generally, XML data can be logically modeled as rooted tree. For the query processing of such data, path queries are widely used. In this paper, we present an optimal algorithm that places XML data on disks such that the number of disk accesses for path query processing is minimized. The proposed algorithm consists of two steps. First, we assign a number (called the mapping indicator) for each node of a tree in a bottom-up fashion, and in the next step we map the nodes to disk blocks using the assigned number. We analyze the optimality of the proposed method with some relevant proofs. We also show the proposed method provides good performance for various query types with XML data set.

Original languageEnglish
Pages (from-to)578-588
Number of pages11
JournalJournal of Systems Architecture
Volume52
Issue number10
DOIs
Publication statusPublished - 2006 Oct 1

Fingerprint

XML
Query processing
Information systems
Computer systems
Network protocols

Keywords

  • Data allocation
  • Databases
  • Query processing
  • Semistructured data
  • XML

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Cite this

An XML data allocation method on disks. / Kim, Jung Hoon; Chung, Yon Dohn; Kim, Myoung H.

In: Journal of Systems Architecture, Vol. 52, No. 10, 01.10.2006, p. 578-588.

Research output: Contribution to journalArticle

Kim, Jung Hoon ; Chung, Yon Dohn ; Kim, Myoung H. / An XML data allocation method on disks. In: Journal of Systems Architecture. 2006 ; Vol. 52, No. 10. pp. 578-588.
@article{08d91aadd46a4ef4b15f6c0c8750fe76,
title = "An XML data allocation method on disks",
abstract = "XML recently has expanded its application areas: data formats in various information systems, communication protocols in distributed systems, and so on. Generally, XML data can be logically modeled as rooted tree. For the query processing of such data, path queries are widely used. In this paper, we present an optimal algorithm that places XML data on disks such that the number of disk accesses for path query processing is minimized. The proposed algorithm consists of two steps. First, we assign a number (called the mapping indicator) for each node of a tree in a bottom-up fashion, and in the next step we map the nodes to disk blocks using the assigned number. We analyze the optimality of the proposed method with some relevant proofs. We also show the proposed method provides good performance for various query types with XML data set.",
keywords = "Data allocation, Databases, Query processing, Semistructured data, XML",
author = "Kim, {Jung Hoon} and Chung, {Yon Dohn} and Kim, {Myoung H.}",
year = "2006",
month = "10",
day = "1",
doi = "10.1016/j.sysarc.2006.06.003",
language = "English",
volume = "52",
pages = "578--588",
journal = "Journal of Systems Architecture",
issn = "1383-7621",
publisher = "Elsevier",
number = "10",

}

TY - JOUR

T1 - An XML data allocation method on disks

AU - Kim, Jung Hoon

AU - Chung, Yon Dohn

AU - Kim, Myoung H.

PY - 2006/10/1

Y1 - 2006/10/1

N2 - XML recently has expanded its application areas: data formats in various information systems, communication protocols in distributed systems, and so on. Generally, XML data can be logically modeled as rooted tree. For the query processing of such data, path queries are widely used. In this paper, we present an optimal algorithm that places XML data on disks such that the number of disk accesses for path query processing is minimized. The proposed algorithm consists of two steps. First, we assign a number (called the mapping indicator) for each node of a tree in a bottom-up fashion, and in the next step we map the nodes to disk blocks using the assigned number. We analyze the optimality of the proposed method with some relevant proofs. We also show the proposed method provides good performance for various query types with XML data set.

AB - XML recently has expanded its application areas: data formats in various information systems, communication protocols in distributed systems, and so on. Generally, XML data can be logically modeled as rooted tree. For the query processing of such data, path queries are widely used. In this paper, we present an optimal algorithm that places XML data on disks such that the number of disk accesses for path query processing is minimized. The proposed algorithm consists of two steps. First, we assign a number (called the mapping indicator) for each node of a tree in a bottom-up fashion, and in the next step we map the nodes to disk blocks using the assigned number. We analyze the optimality of the proposed method with some relevant proofs. We also show the proposed method provides good performance for various query types with XML data set.

KW - Data allocation

KW - Databases

KW - Query processing

KW - Semistructured data

KW - XML

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

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

U2 - 10.1016/j.sysarc.2006.06.003

DO - 10.1016/j.sysarc.2006.06.003

M3 - Article

VL - 52

SP - 578

EP - 588

JO - Journal of Systems Architecture

JF - Journal of Systems Architecture

SN - 1383-7621

IS - 10

ER -