Home

Search: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, a, Theory, 50 - 99

8 results

Results

An Axiomatic Model of Dynamic Schema Evolution in Objectbase Systems

... 50 - 99 A sound and complete axiomatic model is proposed for dynamic schema evolution ... an OBS. The inference mechanism performed by the model has a proven termination. (object-oriented, Theory, TODS / VLDBJ) ...

Publication - erhard - 04/17/2013 - 08:49 - 0 comments - 0 attachments

Schema Evolution and the Relational Algebra

... to support both aspects of transaction time, evolution of a database's contents and evolution of a database's schema. They define a relation's schema to be the relation's ...

Publication - erhard - 04/17/2013 - 08:27 - 0 comments - 0 attachments

A new algorithm for clustering search results

... Mecca, G; Raunich, S; Pappalardo, A Author:  ... Pappalardo, A Year:  ...

Publication - salva - 04/17/2013 - 06:27 - 0 comments - 0 attachments

Inverting Schema Mappings

... Fagin2006InvertingSchema.pdf 433.52 KB A schema mapping is a specification that describes how data structured under one schema (the ...

Publication - cat - 04/16/2013 - 18:27 - 0 comments - 1 attachment

Management of Multiple Models in an Extensible Database Design Tool

... 213.48 KB We describe the development of a tool called MDM for the management of multiple models and the translation ... for the same data schemes We first present a graph-theoretic framework that allows us to formally investigate desirable ...

Publication - huliganka - 04/16/2013 - 15:49 - 0 comments - 1 attachment

Learning to Map between Structured Representations of Data

... Doan, A. Author:  Doan, A Year:  ...

Publication - huliganka - 04/16/2013 - 08:49 - 0 comments - 0 attachments

Compiling mappings to bridge applications and databases

... Melnik, S.; Adya, A.; Bernstein, P.A. Author:  ...

Publication - huliganka - 04/16/2013 - 07:49 - 0 comments - 1 attachment

On the Editing Distance between Undirected Acyclic Graphs and Related Problems

... degree-2 distance, when applied to unordered trees, is a restricted form of the constrained distance previously reported in [27]. When applied to ordered trees, the degree-2 distance is a generalized measure of the constrained distance originated from Selkow ...

Publication - huliganka - 04/16/2013 - 06:16 - 0 comments - 0 attachments