Sigmod / VLDB

Managing knowledge about information system evolution

Authors: 
Jarke, M; Rose, T
Year: 
1988
Venue: 
Proceedings of the 1988 ACM SIGMOD international conference

This paper describes the design and initial prototype implementation of a knowledge base management system (KBMS) for controlling database software development and maintenance. The KBMS employs a version of the conceptual modelling language CML to represent knowledge about the tool-aided development process of an information system from requirements analysis to conceptual design to implementation, together with the relationship of these system components to the real-world environment in which the information system is intended to function.

A Unifying Framework for Version Control in a CAD Environment

Authors: 
Chou, HT; Kim, W
Year: 
1986
Venue: 
Proc. VLDB 1986

Version control is one of the most important functions which need to be supported in integrated computer-aided design (CAD) systems. In this paper we address a broad spectrum of semantic and operational issues in version control for a public/private distributed architecture of CAD systems. The research issues we address include the semantics of version creation and manipulation, version naming and name binding, and version change notification. We develop solutions to these issues under a unifying framework, and discuss implementation and application interface issues.

Maintenance of views

Authors: 
Shmueli, O; Itai, A
Year: 
1984
Venue: 
Proc. 1984 ACM SIGMOD

In relational databases a view definition is a query against the database, and a view materialization is the result of applying the view definition to the current database A view materialization over a database may change as relations in the database undergo modificationsIn this paper a mechanism is proposed in which the view is materialized at all times The problem which this mechanism addresses is how to quickly update the view in response to database changes A structure is maintained which provides information useful in minimizing the amount of work caused by updatesMethods are presented fo

Schema and ontology matching with COMA++

Authors: 
Aumueller, David; Do, Hong Hai; Massmann, Sabine; Rahm, Erhard
Year: 
2005
Venue: 
SIGMOD Conference 2005: 906-908

We demonstrate the schema and ontology matching tool COMA++. It extends our previous prototype COMA utilizing a composite approach to combine different match algorithms [3]. COMA++ implements significant improvements and offers a comprehensive infrastructure to solve large real-world match problems. It comes with a graphical interface enabling a variety of user interactions. Using a generic data representation, COMA++ uniformly supports schemas and ontologies, e.g. the powerful standard languages W3C XML Schema and OWL.

Interactive schema translation with instance-level mappings

Authors: 
Bernstein, PA; Melnik, S; Mork, P
Year: 
2005
Venue: 
Proc. VLDB 2005 (Demo)

We demonstrate a prototype that translates schemas from a source metamodel (e.g., OO, relational, XML) to a target metamodel. The prototype is integrated with Microsoft Visual Studio 2005 to generate relational schemas from an object-oriented design. It has four novel features. First, it produces instance mappings to round-trip the data between the source schema and the generated target schema. It compiles the instance mappings into SQL views to reassemble the objects stored in relational tables.

Implementing Lazy Database Updates for an Object Database System

Authors: 
Ferrandina, F; Meyer, T; Zicari, R
Year: 
1994
Venue: 
Proc. 20th VLDB, 1994

Current object database management systems support user-defined conversion functions to update the database once the schema has been modified. Two main strategies are possible when implementing such database conversion functions: immediate or lazy database updates. In this paper, we concentrate our attention to the definition of implementation strategies for conversion functions implemented as lazy database updates.

Generic Schema Matching With Cupid

Authors: 
Madhavan, J.; Bernstein, P. A.; Rahm, E.
Year: 
2001
Venue: 
VLDB, 2001

Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past solutions, showing that a rich range of techniques is available. We then propose a new algorithm, Cupid, that discovers mappings between schema elements based on their names, data types, constraints, and schema structure, using a broader set of techniques than past approaches.

Using Schema Matching to Simplify Heterogeneous Data Translation

Authors: 
Milo, T.; Zohar, S.
Year: 
1998
Venue: 
VLDB, 1998

A broad spectrum of data is available on the Web in distinct heterogeneous sources, and stored under different formats. As the num- ber of systems that utilize this heterogeneous data grows, the importance of data translation and conversion mechanisms increases greatly. In this paper we present a new translation system, based on schema-matching, aimed at simplifying the intricate task of data conver- sion. We observe that in many cases the schema of the data in the source system is very similar to that of the target system.

Reconciling Schemas of Disparate Data Sources: A Machine-Learning Approach

Authors: 
Doan, A.; Domingos, P.; Halevy, A.
Year: 
2001
Venue: 
SIGMOD, 2001

Statistical Schema Matching across Web Query Interfaces

Authors: 
He, B.; Chang, K.C.C.
Year: 
2003
Venue: 
SIGMOD, 2003

Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding pairwise-attribute correspondence. This paper proposes a different approach, motivated by integrating large numbers of data sources on the Internet. On this "deep Web," we observe two distinguishing characteristics that offer a new view for considering schema matching: First, as the Web scales, there are ample sources that provide structured information in the same domains (e.g., books and automobiles).

Translating Web Data

Authors: 
Popa, Lucian; Velegrakis, Yannis; Miller, Renee; Hernandez, Mauricio; Fagin, Ronald
Year: 
2002
Venue: 
In Proceedings of VLDB, pages 598--609, 2002

Mapping and translating data stored in dierent formats continues to be an important problem in modern information systems. We present a novel framework for mapping among XML and relational schemas in which a high-level mapping is translated into semantically meaningful queries that transform source data into the target representation. Our approach works in two phases.

Data-Driven Understanding and Refinement of Schema Mappings

Authors: 
Yan, Ling Ling; Miller, Renee; Haas, Laura; Fagin, Ronald
Year: 
2001
Venue: 
Proc SIGMOD, 2001, p.485-496

At the heart of many data-intensive applications is the problem of quickly and accurately transforming data into a new form. Database researchers have long advocated the use of declarative queries for this process. Yet tools for creating, managing and understanding the complex queries necessary for data transformation are still too primitive to permit widespread adoption of this approach. We present a new framework that uses data examples as the basis for understanding and refining declarative schema mappings. We identify a small set of intuitive operators for manipulating examples.

Schema Mapping as Query Discovery

Authors: 
Miller, Renee; Haas, Laura; Hernandez, Mauricio
Year: 
2000
Venue: 
Proc. 26th VLDB, 2000

To enable modern data intensive applications we must solve the data mapping problem in which a source (legacy) database is mapped into a different, but fixed, target schema. Schema mapping involves the discovery of a query or a set of queries that transform the source data into the new structure. We introduce an interactive mapping creation paradigm based on value correspondences that show how a value of a target attribute can be created from a set of values of source attributes.

Incremental Reorganization Of Relational Databases

Authors: 
Markowitz, Victor; Makowsky, Johann A.
Year: 
1987
Venue: 
VLDB 1987

The evolution of an information system is reflected in data modeling by database reorganization. Entity-Relationship (ER) consistency expresses the capability of relational databases to model information oriented systems. A relational schema consisting of relational schemes, together with key and inclusion dependencies, is said to be ER-consistent if it complies with an entity-relationship structure, meaning that it is representableby an ER-Diagram.

Updating Relational Databases through Object-Based Views

Authors: 
Barsalou, Thierry; Siambela, Niki; Keller, Arthur M.; Wiederhold, Gio
Year: 
1991
Venue: 
Proc. Sigmod 1991

The view-object model provides a formal basis for representing
and manipulating object-based views on relational
databases. In this paper, we present a scheme for handling
update operations on view objects. Because a typical view
object encompasses multiple relations, a view-object update
request must be translated into valid operations on the underlying
relational database. Building on an existing approach
to update relational views, we introduce algorithms
to enumerate all valid translations of the various update operations
on view objects. The process of choosing a translator

COMA - A System for Flexible Combination of Schema Matching Approaches

Authors: 
Do, Hong Hai; Rahm, E.
Year: 
2002
Venue: 
VLDB 2002: 610-621

Schema matching is the task of finding semantic correspondences between elements of two schemas. It is needed in many database applications, such as integration of web data sources, data warehouse loading and XML message mapping. To reduce the amount of user effort as much as possible, automatic approaches combining several match techniques are required. While such match approaches have found considerable interest recently, the problem of how to best combine different match algorithms still requires further work.

DB2/XML: Designing for Evolution

Authors: 
Beyer, K.; Özcan, F.; Saiprasad, S.; Van der Linden, B
Year: 
2005
Venue: 
Proc. SIGMOD 2005

DB2 provides native XML storage, indexing, navigation and query processing through both SQL/XML and XQuery using the XML data type introduced by SQL/XML. In this tutorial we focus on DB2s XML support for schema evolution, especially DB2s schema repository and document-level validation.

Schema and Database Evolution in the O2 Object Database System

Authors: 
Ferrandina, Fabrizio; Meyer, Thorsten; Zicari, Roberto; Ferran, Guy; Madec, Jolle
Year: 
1995
Venue: 
VLDB 1995

When the schema of an object-oriented database system
is modified, the database needs to be changed in
such a way that the schema and the database remain
consistent with each other. This paper describes the
algorithm implemented in the new forthcoming release
of the O2 object database for automatically bringing the
database to a consistent state after a schema update has
been performed. The algorithm, which uses a deferred
strategy to update the database, is a revised and extended
version of the screening algorithm first sketched in [7].

Management Of Schema Evolution In Databases

Authors: 
Andany, J.; Lonard, M.; Palisser, C.
Year: 
1991
Venue: 
VLDB 1991

This paper presents a version model which handles database schema changes and which takes evolution into account. Its originality is in allowing the development of partial schema versions, or views of a schema. These versions are created in the same database from a common schema. We define the set of authorised modifications on a schema and the rules which guarantee its coherence after transformation. Mechanisms allowing data to be associated with each version are also integrated in the model.

Semantics and implementation of schema evolution in object-oriented databases

Authors: 
Banerjee, J.; Kim, W.; Kim, H.; Korth, H. F.
Year: 
1987
Venue: 
Proc. Sigmod 1987

Object-oriented programming is well-suited to such data-intensive application domains as CAD/CAM, AI, and OIS (office information systems) with multimedia documents. At MCC we have built a prototype object-oriented database system, called ORION. It adds persistence and sharability to objects created and manipulated in applications implemented in an object-oriented programming environment. One of the important requirements of these applications is schema evolution, that is, the ability to dynamically make a wide variety of changes to the database schema.

Versions of Schema for Object-Oriented Databases

Authors: 
Kim, W.; Chou, H.
Year: 
1988
Venue: 
Proc. 14th VLDB, 148-159.

Version control is one of the important database require-
ments for design environments. Various models of ver-
sions have been proposed and implemented. However,
research in versions has been focused exclusively on
versioning single design objects. In a multi-user design
environment where the schema (definition) of the design
objects may undergo dynamic changes, it is important to
be able to version the schema, as well as version the
single design objects. In this paper, we propose a model
of versions of schema by extending our model of versions

Syndicate content