Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Semantics and implementation of schema evolution in object-oriented databases
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A graph generation software package
SIGCSE '91 Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
Adapting materialized views after redefinitions
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
A model for compound type changes encountered in schema evolution
ACM Transactions on Database Systems (TODS)
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Representing and Querying Changes in Semistructured Data
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
ILOG: Declarative Creation and Manipulation of Object Identifiers
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Efficient Management of Multiversion Documents by Object Referencing
Proceedings of the 27th International Conference on Very Large Data Bases
Schema Evolution in Heterogeneous Database Architectures, A Schema Transformation Approach
CAiSE '02 Proceedings of the 14th International Conference on Advanced Information Systems Engineering
Keyword Searching and Browsing in Databases using BANKS
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Representing and Querying Data Transformations
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Bidirectional expansion for keyword search on graph databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Semantic adaptation of schema mappings when schemas evolve
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
BLINKS: ranked keyword searches on graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficient query evaluation on probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
Temporal XML: modeling, indexing, and query processing
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Modeling Concept Evolution: A Historical Perspective
ER '09 Proceedings of the 28th International Conference on Conceptual Modeling
The Steiner Forest Problem revisited
Journal of Discrete Algorithms
On-the-fly entity-aware query processing in the presence of linkage
Proceedings of the VLDB Endowment
A query answering system for data with evolution relationships
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Hi-index | 0.00 |
The problem of managing evolving data has attracted considerable research attention. Researchers have focused on the modeling and querying of schema/instance-level structural changes, such as, addition, deletion and modification of attributes. Databases with such a functionality are known as temporal databases. A limitation of the temporal databases is that they treat changes as independent events, while often the appearance (or elimination) of some structure in the database is the result of an evolution of some existing structure. We claim that maintaining the causal relationship between the two structures is of major importance since it allows additional reasoning to be performed and answers to be generated for queries that previously had no answers. We present here a novel framework for exploiting the evolution relationships between the structures in the database. In particular, our system combines different structures that are associated through evolution relationships into virtual structures to be used during query answering. The virtual structures define "possible" database instances, in a fashion similar to the possible worlds in the probabilistic databases. The framework includes a query answering mechanism that allows queries to be answered over these possible databases without materializing them. Evaluation of such queries raises many interesting technical challenges, since it requires the discovery of Steiner forests on the evolution graphs. On this problem we have designed and implemented a new dynamic programming algorithm with exponential complexity in the size of the input query and polynomial complexity in terms of both the attribute and the evolution data sizes.