Query language-based inverses of schema mappings: semantics, computation, and closure properties

Query language-based inverses of schema mappings: semantics, computation, and closure properties The inversion of schema mappings has been identified as one of the fundamental operators for the development of a general framework for metadata management. During the last few years, three alternative notions of inversion for schema mappings have been proposed (Fagin-inverse (Fagin, TODS 32(4), 25:1–25:53, 2007 ), quasi-inverse (Fagin et al., TODS 33(2), 11:1–11:52, 2008 ), and maximum recovery (Arenas et al., TODS 34(4), 22:1–22:48, 2009 )). However, these notions lack some fundamental properties that limit their practical applicability: most of them are expressed in languages including features that are difficult to use in practice, some of these inverses are not guaranteed to exist for mappings specified with source-to-target tuple-generating dependencies (st-tgds), and it has been futile to search for a meaningful mapping language that is closed under any of these notions of inverse. In this paper, we develop a framework for the inversion of schema mappings that fulfills all of the above requirements. It is based on the notion of $${\mathcal{C}}$$ -maximum recovery, for a query language $${\mathcal{C}}$$ , a notion designed to generate inverse mappings that recover back only the information that can be retrieved with queries in $${\mathcal{C}}$$ . By focusing on the language of conjunctive queries (CQ), we are able to find a mapping language that contains the class of st-tgds, is closed under CQ-maximum recovery, and for which the chase procedure can be used to exchange data efficiently. Furthermore, we show that our choices of inverse notion and mapping language are optimal, in the sense that choosing a more expressive inverse operator or mapping language causes the loss of these properties. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png The VLDB Journal Springer Journals

Query language-based inverses of schema mappings: semantics, computation, and closure properties

Loading next page...
 
/lp/springer_journal/query-language-based-inverses-of-schema-mappings-semantics-computation-CBDw3lqseF
Publisher
Springer-Verlag
Copyright
Copyright © 2012 by Springer-Verlag Berlin Heidelberg
Subject
Computer Science; Database Management
ISSN
1066-8888
eISSN
0949-877X
D.O.I.
10.1007/s00778-012-0272-z
Publisher site
See Article on Publisher Site

Abstract

The inversion of schema mappings has been identified as one of the fundamental operators for the development of a general framework for metadata management. During the last few years, three alternative notions of inversion for schema mappings have been proposed (Fagin-inverse (Fagin, TODS 32(4), 25:1–25:53, 2007 ), quasi-inverse (Fagin et al., TODS 33(2), 11:1–11:52, 2008 ), and maximum recovery (Arenas et al., TODS 34(4), 22:1–22:48, 2009 )). However, these notions lack some fundamental properties that limit their practical applicability: most of them are expressed in languages including features that are difficult to use in practice, some of these inverses are not guaranteed to exist for mappings specified with source-to-target tuple-generating dependencies (st-tgds), and it has been futile to search for a meaningful mapping language that is closed under any of these notions of inverse. In this paper, we develop a framework for the inversion of schema mappings that fulfills all of the above requirements. It is based on the notion of $${\mathcal{C}}$$ -maximum recovery, for a query language $${\mathcal{C}}$$ , a notion designed to generate inverse mappings that recover back only the information that can be retrieved with queries in $${\mathcal{C}}$$ . By focusing on the language of conjunctive queries (CQ), we are able to find a mapping language that contains the class of st-tgds, is closed under CQ-maximum recovery, and for which the chase procedure can be used to exchange data efficiently. Furthermore, we show that our choices of inverse notion and mapping language are optimal, in the sense that choosing a more expressive inverse operator or mapping language causes the loss of these properties.

Journal

The VLDB JournalSpringer Journals

Published: Dec 1, 2012

References

  • Composition and inversion of schema mappings
    Arenas, M.; Pérez, J.; Reutter, J.L.; Riveros, C.
  • The structure of inverses in schema mappings
    Fagin, R.; Nash, A.

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