Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 3,086 papers for “schema mapping”

Schema Mapping

Shashi Shekhar, Hui Xiong, Xun Zhou · Encyclopedia of GIS · 2017

Cited by 0

Schema mapping

Papotti, Paolo · Graduate School and Research Center in Digital Science (EURECOM)

Cited by 0

Schema mapping management . . .

Jorge Perez · 2011

A schema mapping is a high-level specification that describes how data from a source schema is to be mapped to a target schema. In the last few years, a lot of attention has been paid to the specification and subsequent manipulation of schema mappings, a problem which is of fundamental importance in metadata management. In the metadata manage-ment context, schema mappings are first class citizens, and high-level algebraic operators are used to manipulate them. In this dissertation, we present several contributions in the formalization and the the-oretical study of schema-mapping algebraic operators. We begin our study by considering the inverse operator that has been identified as one of the most fundamental operators in schema mappings. We propose a new semantics for inverting mappings, present algorithms for computing inverses and study expressiveness issues. We also generalize the previous iv notion to a family of inverses that allows us to solve the problem of finding a mapping-specification language that is closed under inversion. Inversion together with the composi-

Cited by 0

Schema Mapping Discovery . . .

Georg Gottlob, PIERRE SENELLART · 2010

We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of data exchange. We formalize the problem of understanding the relationship between two instances as that of obtaining a schema mapping so that a minimum repair of this mapping provides a perfect description of the target instance given the source instance. We show that this definition yields “intuitive” results when applied on database instances derived from each other by basic operations. We study the complexity of decision problems related to this optimality notion in the context of different logical languages and show that, even in very restricted cases, the problem is of high complexity.

Cited by 0

XML schema mapping

Leonid Libkin, Filip Murlak, See Profile et al. · 2016

All in-text\treferences\tunderlined\tin\tblue\tare\tlinked\tto\tpublications\ton\tResearchGate, letting you\taccess\tand\tread\tthem\timmediately.

Cited by 0

Schema mapping verification

Angela Bonifati, Giansalvatore Mecca, Alessandro Pappalardo et al. · 2008

Schema mapping algorithms rely on value correspondences - i.e., correspondences among semantically related attributes - to produce complex transformations among data sources. These correspondences are either manually specified or suggested by separate modules called schema matchers. The quality of mappings produced by a mapping generation tool strongly depends on the quality of the input correspondences. In this paper, we introduce the Spicy system, a novel approach to the problem of verifying the quality of mappings. Spicy is based on a three-layer architecture, in which a schema matching module is used to provide input to a mapping generation module. Then, a third module, the mapping verification module, is used to check candidate mappings and choose the ones that represent better transformations of the source into the target. At the core of the system stands a new technique for comparing the structure and actual content of trees, called structural analysis. Experimental results show that, by carefully designing the comparison algorithm, it is possible to achieve both good scalability and high precision in mapping selection.

Cited by 65

SPIDER: a Schema mapPIng DEbuggeR

Bogdan Alexe, et al. · 2006

A schema mapping is a high-level declarative specification of how data structured under one schema, called the source schema, is to be transformed into data structured under a possibly different schema, called the target schema. We demonstrate SPIDER, a prototype tool for debugging schema mappings, where the language for specifying schema mappings is based on a widely adopted formalism. We have built SPIDER on top of a data exchange system, Clio, from IBM Almaden Research Center. At the heart of SPIDER is a data-driven facility for understanding a schema mapping through the display of routes. A route essentially describes the relationship between source and target data with the schema mapping. In this demonstration, we showcase our route engine, where we can display one or all routes starting from either source or target data, as well as the intermediary data and schema elements involved. In addition, we demonstrate “standard” debugging features for schema mappings that we have also built, such as computing and exploring routes step-by-step, stopping or pausing the computation with breakpoints, performing “guided ” computation of routes by taking human input into account, as well as tracking the state of the target instance during the process of computing routes.

Cited by 0

Structural characterizations of schema mapping

Marcelo Arenas, Pablo Barceló, Leonid Libkin et al. · Cambridge University Press eBooks · 2014

Mappings are logical specifications of the relationship between schemas. In data exchange, one typically restricts the kind of dependencies allowed in mappings, either to be able to find more efficient procedures for constructing solutions and answering target queries, or to make mappings have desirable properties, such as closure under composition. These two tasks could be contradictory. For instance, the mapping language of SO tgds ensures closure under composition, but such mappings include a form of second-order quantification that can be difficult to handle in practice. Thus, it is desirable to replace an SO tgd by an equivalent set of st-tgds whenever possible.

Cited by 0

A Short History of Schema Mapping Systems ⋆ A Short History of Schema Mapping Systems

Giansalvatore Mecca, Paolo Papotti, Donatello Santoro et al. · 2013

There are many applications that need to exchange, correlate, and integrate heterogenous data sources. These information integration tasks have long been identified as important problems and unifying theoretical frameworks have been advocated by database researchers [5].

Cited by 0

Revolutionizing Metadata Schema Mapping with ChatGPT

Kristian Garza · 2023

Converting DOI metadata between metadata schemas using ChatGPT Large language models have been making waves in artificial intelligence for a good reason. These models have the ability to understand and generate human language, which has far-reaching implications for the future of technology.

Cited by 0Open access

VMAP: A Visual Schema Mapping Tool

Florin Chertes, Ingo Feinerer · Frontiers in artificial intelligence and applications · 2014

Schema mapping languages are a key technique for data engineers to perform data exchange and integration in the context of the semantic web. Visual schema mapping languages provide an extra benefit as they help to visually describe the flow of data between various sources and destinations in the Internet. We present a tool called VMAP for implementing visual schema mappings. Its focus is on standardization and modularity.

Cited by 0Open access