By Topic

Answering Queries in the Presence of XML Keys

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Essid, M. ; LSIS, Univ. Paul Cezanne, Marseille ; Boucelma, O. ; Bressan, S.

As XML seems to become the preferred candidate language for the interchange of data on the Internet, the integration of distributed, heterogeneous, and autonomous XML data sources in a mediation architecture is becoming a critical issue. In this paper, we present a novel and original query rewriting algorithm for the answering of queries to XML disparate sources in the presence of XML keys. The algorithm combines features of the MiniCon (Mini-Con descriptions) and the Styx algorithms (prefix and suffix queries) into an algorithm that returns more rewritings

Published in:

Database and Expert Systems Applications, 2006. DEXA '06. 17th International Workshop on

Date of Conference:

0-0 0