Formal verification and performance evaluation of user query pattern-based relational schema-to-XML schema translation algorithm

Jinhyung Kim, Dongwon Jeong, Doo Kwon Baik

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

Abstract

This paper describes formal verification and quantitative performance evaluation for validating of query pattern-based relational schema-to-XML Schema translation (QP-T) algorithm. Many translation algorithms such as FT, NeT, CoT, ConvRel, and VP-T have been introduced on structural and/or semantic aspect for exact and effective translation. However, conventional algorithms consider only explicit referential integrity specified by relational schema or limitations regarding on reflection of implicit referential integrity information. It causes several problems such as incorrect translation, abnormal relational model transition, and so on. The QP-T algorithm analyzes query pattern and extract implicit referential integrities by interrelationship of equi-join in user queries. The QP-T algorithm can make up for weak points of the VP-T algorithm and create more exact XML Schema as a result by using with VP-T algorithm together.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages337-346
Number of pages10
Volume4742 LNCS
Publication statusPublished - 2007 Dec 1
Event5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007 - Niagara Falls, Canada
Duration: 2007 Aug 292007 Aug 31

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4742 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007
CountryCanada
CityNiagara Falls
Period07/8/2907/8/31

Fingerprint

XML Schema
Formal Verification
XML
Schema
Performance Evaluation
Query
Integrity
Relational Model
Quantitative Evaluation
Formal verification
Semantics
Join

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Kim, J., Jeong, D., & Baik, D. K. (2007). Formal verification and performance evaluation of user query pattern-based relational schema-to-XML schema translation algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4742 LNCS, pp. 337-346). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4742 LNCS).

Formal verification and performance evaluation of user query pattern-based relational schema-to-XML schema translation algorithm. / Kim, Jinhyung; Jeong, Dongwon; Baik, Doo Kwon.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4742 LNCS 2007. p. 337-346 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4742 LNCS).

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

Kim, J, Jeong, D & Baik, DK 2007, Formal verification and performance evaluation of user query pattern-based relational schema-to-XML schema translation algorithm. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4742 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4742 LNCS, pp. 337-346, 5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007, Niagara Falls, Canada, 07/8/29.
Kim J, Jeong D, Baik DK. Formal verification and performance evaluation of user query pattern-based relational schema-to-XML schema translation algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4742 LNCS. 2007. p. 337-346. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Kim, Jinhyung ; Jeong, Dongwon ; Baik, Doo Kwon. / Formal verification and performance evaluation of user query pattern-based relational schema-to-XML schema translation algorithm. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4742 LNCS 2007. pp. 337-346 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{029a0e4d71574d28ba54ea6894ba8448,
title = "Formal verification and performance evaluation of user query pattern-based relational schema-to-XML schema translation algorithm",
abstract = "This paper describes formal verification and quantitative performance evaluation for validating of query pattern-based relational schema-to-XML Schema translation (QP-T) algorithm. Many translation algorithms such as FT, NeT, CoT, ConvRel, and VP-T have been introduced on structural and/or semantic aspect for exact and effective translation. However, conventional algorithms consider only explicit referential integrity specified by relational schema or limitations regarding on reflection of implicit referential integrity information. It causes several problems such as incorrect translation, abnormal relational model transition, and so on. The QP-T algorithm analyzes query pattern and extract implicit referential integrities by interrelationship of equi-join in user queries. The QP-T algorithm can make up for weak points of the VP-T algorithm and create more exact XML Schema as a result by using with VP-T algorithm together.",
author = "Jinhyung Kim and Dongwon Jeong and Baik, {Doo Kwon}",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "3540747419",
volume = "4742 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "337--346",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Formal verification and performance evaluation of user query pattern-based relational schema-to-XML schema translation algorithm

AU - Kim, Jinhyung

AU - Jeong, Dongwon

AU - Baik, Doo Kwon

PY - 2007/12/1

Y1 - 2007/12/1

N2 - This paper describes formal verification and quantitative performance evaluation for validating of query pattern-based relational schema-to-XML Schema translation (QP-T) algorithm. Many translation algorithms such as FT, NeT, CoT, ConvRel, and VP-T have been introduced on structural and/or semantic aspect for exact and effective translation. However, conventional algorithms consider only explicit referential integrity specified by relational schema or limitations regarding on reflection of implicit referential integrity information. It causes several problems such as incorrect translation, abnormal relational model transition, and so on. The QP-T algorithm analyzes query pattern and extract implicit referential integrities by interrelationship of equi-join in user queries. The QP-T algorithm can make up for weak points of the VP-T algorithm and create more exact XML Schema as a result by using with VP-T algorithm together.

AB - This paper describes formal verification and quantitative performance evaluation for validating of query pattern-based relational schema-to-XML Schema translation (QP-T) algorithm. Many translation algorithms such as FT, NeT, CoT, ConvRel, and VP-T have been introduced on structural and/or semantic aspect for exact and effective translation. However, conventional algorithms consider only explicit referential integrity specified by relational schema or limitations regarding on reflection of implicit referential integrity information. It causes several problems such as incorrect translation, abnormal relational model transition, and so on. The QP-T algorithm analyzes query pattern and extract implicit referential integrities by interrelationship of equi-join in user queries. The QP-T algorithm can make up for weak points of the VP-T algorithm and create more exact XML Schema as a result by using with VP-T algorithm together.

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

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

M3 - Conference contribution

AN - SCOPUS:38349044609

SN - 3540747419

SN - 9783540747413

VL - 4742 LNCS

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

SP - 337

EP - 346

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

ER -