Results 1 - 10
of
248
Trio: a system for integrated management of data, accuracy, and lineage
- PRESENTED AT CIDR 2005
, 2005
"... Trio is a new database system that manages not only data, butalsotheaccuracy and lineage of the data. Inexact (uncertain, probabilistic, fuzzy, approximate, incomplete, and imprecise!) databases have been proposed in the past, and the lineage problem also has been studied. The goals of the Trio proj ..."
Abstract
-
Cited by 268 (17 self)
- Add to MetaCart
(Show Context)
Trio is a new database system that manages not only data, butalsotheaccuracy and lineage of the data. Inexact (uncertain, probabilistic, fuzzy, approximate, incomplete, and imprecise!) databases have been proposed in the past, and the lineage problem also has been studied. The goals of the Trio project are to combine and distill previous work into a simple and usable model, design a query language as an understandable extension to SQL, and most importantly build a working system—a system that augments conventional data management with both accuracy and lineage as an integral part of the data. This paper provides numerous motivating applications for Trio and lays out preliminary plans for the data model, query language, and prototype system.
Combinators for bi-directional tree transformations: A linguistic approach to the view update problem
- In ACM SIGPLAN–SIGACT Symposium on Principles of Programming Languages (POPL
, 2005
"... We propose a novel approach to the view update problem for tree-structured data: a domainspecific programming language in which all expressions denote bi-directional transformations on trees. In one direction, these transformations—dubbed lenses—map a “concrete ” tree into a simplified “abstract vie ..."
Abstract
-
Cited by 205 (17 self)
- Add to MetaCart
(Show Context)
We propose a novel approach to the view update problem for tree-structured data: a domainspecific programming language in which all expressions denote bi-directional transformations on trees. In one direction, these transformations—dubbed lenses—map a “concrete ” tree into a simplified “abstract view”; in the other, they map a modified abstract view, together with the original concrete tree, to a correspondingly modified concrete tree. Our design emphasizes both robustness and ease of use, guaranteeing strong well-behavedness and totality properties for welltyped lenses. We identify a natural mathematical space of well-behaved bi-directional transformations over arbitrary structures, study definedness and continuity in this setting, and state a precise connection with the classical theory of “update translation under a constant complement ” from databases. We then instantiate this semantic framework in the form of a collection of lens combinators that can be assembled to describe transformations on trees. These combinators include familiar constructs from functional programming (composition, mapping, projection, conditionals, recursion) together with some novel primitives for manipulating trees (splitting, pruning, copying, merging, etc.). We illustrate the expressiveness of these combinators by developing a number of bi-directional listprocessing transformations as derived forms. An extended example shows how our combinators can be used to define a lens that translates between a native HTML representation of browser bookmarks and a generic abstract bookmark format.
Managing Semantic Heterogeneity in Databases : A Theoretical Perspective, Tutorial at PODS
- ACM SIGMOD Record
, 1997
"... A full version of this tutorial appears at ..."
Tracing the Lineage of View Data in a Warehousing Environment
- ACM Transactions on Database Systems
, 1997
"... We consider the view data lineage problem in a warehousing environment: For a given data item in a materialized warehouse view, we want to identify the set of source data items that produced the view item. We formally define the lineage problem, develop lineage tracing algorithms for relational v ..."
Abstract
-
Cited by 176 (14 self)
- Add to MetaCart
We consider the view data lineage problem in a warehousing environment: For a given data item in a materialized warehouse view, we want to identify the set of source data items that produced the view item. We formally define the lineage problem, develop lineage tracing algorithms for relational views with aggregation, and propose mechanisms for performing consistent lineage tracing in a multi-source data warehousing environment. Our results can form the basis of a tool that allows analysts to browse warehouse data, select view tuples of interest, then "drill-through" to examine the exact source tuples that produced the view tuples of interest. 1 Introduction In a data warehousing system, materialized views over source data are defined, computed, and stored in the warehouse to answer queries about the source data (which may be stored in distributed and legacy systems) in an integrated and efficient way [CD97, Wid95]. Typically, on-line analytical processing and mining (OLAP and...
On the semantics of updates in databases
- IN PROCEEDINGS OF THE SECOND ACM SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS SIGACT-SIGMOD
, 1983
"... We suggest here a methodology for updating data bases with integrity constrain & and rules for deriving inex plicit information. First we consider the problem of updating arbitrary theories by inserting inu, them or delet ..."
Abstract
-
Cited by 149 (2 self)
- Add to MetaCart
We suggest here a methodology for updating data bases with integrity constrain & and rules for deriving inex plicit information. First we consider the problem of updating arbitrary theories by inserting inu, them or delet
Model management 2.0: manipulating richer mappings
- in SIGMOD, 2007
"... Model management is a generic approach to solving problems of data programmability where precisely engineered mappings are required. Applications include data warehousing, e-commerce, object-to-relational wrappers, enterprise information integration, database portals, and report generators. The goal ..."
Abstract
-
Cited by 127 (3 self)
- Add to MetaCart
(Show Context)
Model management is a generic approach to solving problems of data programmability where precisely engineered mappings are required. Applications include data warehousing, e-commerce, object-to-relational wrappers, enterprise information integration, database portals, and report generators. The goal is to develop a model management engine that can support tools for all of these applications. The engine supports operations to match schemas, compose mappings, diff schemas, merge schemas, translate schemas into different data models, and generate data transformations from mappings. Much has been learned about model management since it was proposed seven years ago. This leads us to a revised vision that differs from the original in two main respects: the operations must handle more expressive mappings, and the runtime that executes mappings should be added as an important model management component. We review what has been learned from recent experience, explain the revised model management vision based on that experience, and identify the research problems that the revised vision opens up.
Testability Transformation
- IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 2004
"... A testability transformation is a source-to-source transformation that aims to improve the ability of a given test generation method to generate test data for the original program. This paper ..."
Abstract
-
Cited by 89 (38 self)
- Add to MetaCart
A testability transformation is a source-to-source transformation that aims to improve the ability of a given test generation method to generate test data for the original program. This paper
On the Semantics of Arbitration
- International Journal of Algebra and Computation
, 1995
"... : Revision and update operators add new information to some old information represented by a logical theory. Katsuno and Mendelzon show that both revision and update operators can be characterized as accomplishing a minimal change in the old information to accommodate the new information. Arbitratio ..."
Abstract
-
Cited by 87 (4 self)
- Add to MetaCart
: Revision and update operators add new information to some old information represented by a logical theory. Katsuno and Mendelzon show that both revision and update operators can be characterized as accomplishing a minimal change in the old information to accommodate the new information. Arbitration operators add two or more weighted informations together where the weights indicate the relative importance of the informations rather than a strict priority. This paper shows that arbitration operators can be also characterized as accomplishing a minimal change. The operator of model-fitting is also defined and analyzed in the paper. 1 Introduction Arbitration is the process of settling a conflict between two or more persons. Arbitration occurs in many situations. For example, settling a labor dispute by an outsider, reaching a verdict in a trial, evaluating several alternative research hypotheses, negotiating an international peace agreement, or setting the price of a product in a compe...
Updating logical databases
- Advances in Computing Research
, 1986
"... We suggest a new approach to database updates, in which a database is treated as a collection of theories. We investigate two issues: simultaneous multiple update operations and equivalence of databases under update operations. 1. ..."
Abstract
-
Cited by 74 (0 self)
- Add to MetaCart
We suggest a new approach to database updates, in which a database is treated as a collection of theories. We investigate two issues: simultaneous multiple update operations and equivalence of databases under update operations. 1.
