357 search results - page 6 / 72 » An Algebraic Approach to the Complexity of Generalized Conju... |
PODS
2011
ACM
12 years 10 months ago
2011
ACM
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
An answer to a query has a well-defined lineage expression (alternatively called how-provenance) that explains how the answer was derived. Recent work has also shown how to comput...
IDEAS
2005
IEEE
14 years 1 months ago
2005
IEEE
The XML data is order-sensitive. The order problem, that is how ordered XML documents and order-sensitive queries over it can be efficiently supported when mapped into the unorde...
MFDBS
1991
13 years 11 months ago
1991
We study an approach to relational databases which treats relations not as subsets of a Cartesian product but as subsets of some domain { a partially ordered space of descriptions...
KDD
1998
ACM
14 years 4 days ago
1998
ACM
This paper presents an algorithm for discovering conjunction rules with high reliability from data sets. The discovery of conjunction rules, each of which is a restricted form of ...