Answering XML twig queries with automata

Bing Sun, Bo Zhou, Nan Tang, Guoren Wang, Ge Yu, Fulin Jia

Research output: Contribution to journalArticle

Abstract

XML is emerging as a de facto standard for information representation and data exchange over the web. Evaluation of twig queries, which allows users to find all occurrence of a multiple branch pattern in an XML database, is a core and complicate operation for XML query processing. Performance of conventional evaluation approaches based on structural join declines with the expansion of data size and query complexity. In this paper, a novel approach is proposed to compute twig queries with matching twig query automata and path schema trees. Moreover, we give the performance evaluation to demonstrate the high performance of our approach.

Original languageEnglish
Pages (from-to)170-179
Number of pages10
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3007
Publication statusPublished - 1 Dec 2004
Externally publishedYes

Fingerprint

XML
Automata
Query
XML Database
Query Complexity
Query processing
Data Exchange
Evaluation
Electronic data interchange
Query Processing
Schema
Join
Performance Evaluation
Branch
High Performance
Databases
Path
Demonstrate
Standards

ASJC Scopus subject areas

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

Cite this

Answering XML twig queries with automata. / Sun, Bing; Zhou, Bo; Tang, Nan; Wang, Guoren; Yu, Ge; Jia, Fulin.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 3007, 01.12.2004, p. 170-179.

Research output: Contribution to journalArticle

@article{ec5f0afd292e43eabb30f4e62c6b8c89,
title = "Answering XML twig queries with automata",
abstract = "XML is emerging as a de facto standard for information representation and data exchange over the web. Evaluation of twig queries, which allows users to find all occurrence of a multiple branch pattern in an XML database, is a core and complicate operation for XML query processing. Performance of conventional evaluation approaches based on structural join declines with the expansion of data size and query complexity. In this paper, a novel approach is proposed to compute twig queries with matching twig query automata and path schema trees. Moreover, we give the performance evaluation to demonstrate the high performance of our approach.",
author = "Bing Sun and Bo Zhou and Nan Tang and Guoren Wang and Ge Yu and Fulin Jia",
year = "2004",
month = "12",
day = "1",
language = "English",
volume = "3007",
pages = "170--179",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Answering XML twig queries with automata

AU - Sun, Bing

AU - Zhou, Bo

AU - Tang, Nan

AU - Wang, Guoren

AU - Yu, Ge

AU - Jia, Fulin

PY - 2004/12/1

Y1 - 2004/12/1

N2 - XML is emerging as a de facto standard for information representation and data exchange over the web. Evaluation of twig queries, which allows users to find all occurrence of a multiple branch pattern in an XML database, is a core and complicate operation for XML query processing. Performance of conventional evaluation approaches based on structural join declines with the expansion of data size and query complexity. In this paper, a novel approach is proposed to compute twig queries with matching twig query automata and path schema trees. Moreover, we give the performance evaluation to demonstrate the high performance of our approach.

AB - XML is emerging as a de facto standard for information representation and data exchange over the web. Evaluation of twig queries, which allows users to find all occurrence of a multiple branch pattern in an XML database, is a core and complicate operation for XML query processing. Performance of conventional evaluation approaches based on structural join declines with the expansion of data size and query complexity. In this paper, a novel approach is proposed to compute twig queries with matching twig query automata and path schema trees. Moreover, we give the performance evaluation to demonstrate the high performance of our approach.

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

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

M3 - Article

VL - 3007

SP - 170

EP - 179

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

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

SN - 0302-9743

ER -