Query translation from XPath to SQL in the presence of recursive DTDs

Query translation from XPath to SQL in the presence of recursive DTDs We study the problem of evaluating xp ath queries over xml data that is stored in an rdbms via schema-based shredding. The interaction between recursion (descendants-axis) in xp ath queries and recursion in dtd s makes it challenging to answer xp ath queries using rdbms . We present a new approach to translating xp ath queries into sql queries based on a notion of extended XP ath expressions and a simple least fixpoint ( lfp ) operator. Extended xp ath expressions are a mild extension of xp ath, and the lfp operator takes a single input relation and is already supported by most commercial rdbms . We show that extended xp ath expressions are capable of capturing both dtd recursion and xp ath queries in a uniform framework. Furthermore, they can be translated into an equivalent sequence of sql queries with the lfp operator. We present algorithms for rewriting xp ath queries over a (possibly recursive) dtd into extended xp ath expressions and for translating extended xp ath expressions to sql queries, as well as optimization techniques. The novelty of our approach consists in its capability to answer a large class of xp ath queries by means of only low-end rdbms features already available in most rdbms , as well as its flexibility to accommodate existing relational query optimization techniques. In addition, these translation algorithms provide a solution to query answering for certain (possibly recursive) xml views of xml data. Our experimental results verify the effectiveness of our techniques. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png The VLDB Journal Springer Journals

Query translation from XPath to SQL in the presence of recursive DTDs

Loading next page...
 
/lp/springer_journal/query-translation-from-xpath-to-sql-in-the-presence-of-recursive-dtds-JyOpsDghPG
Publisher
Springer-Verlag
Copyright
Copyright © 2009 by Springer-Verlag
Subject
Computer Science; Database Management
ISSN
1066-8888
eISSN
0949-877X
D.O.I.
10.1007/s00778-008-0131-0
Publisher site
See Article on Publisher Site

Abstract

We study the problem of evaluating xp ath queries over xml data that is stored in an rdbms via schema-based shredding. The interaction between recursion (descendants-axis) in xp ath queries and recursion in dtd s makes it challenging to answer xp ath queries using rdbms . We present a new approach to translating xp ath queries into sql queries based on a notion of extended XP ath expressions and a simple least fixpoint ( lfp ) operator. Extended xp ath expressions are a mild extension of xp ath, and the lfp operator takes a single input relation and is already supported by most commercial rdbms . We show that extended xp ath expressions are capable of capturing both dtd recursion and xp ath queries in a uniform framework. Furthermore, they can be translated into an equivalent sequence of sql queries with the lfp operator. We present algorithms for rewriting xp ath queries over a (possibly recursive) dtd into extended xp ath expressions and for translating extended xp ath expressions to sql queries, as well as optimization techniques. The novelty of our approach consists in its capability to answer a large class of xp ath queries by means of only low-end rdbms features already available in most rdbms , as well as its flexibility to accommodate existing relational query optimization techniques. In addition, these translation algorithms provide a solution to query answering for certain (possibly recursive) xml views of xml data. Our experimental results verify the effectiveness of our techniques.

Journal

The VLDB JournalSpringer Journals

Published: Aug 1, 2009

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off