Sciweavers

26 search results - page 3 / 6
» icdt 2009
Sort
View
ICDT
2009
ACM
173views Database» more  ICDT 2009»
14 years 6 months ago
Containment of conjunctive queries on annotated relations
We study containment and equivalence of (unions of) conjunctive queries on relations annotated with elements of a commutative semiring. Such relations and the semantics of positiv...
Todd J. Green
ICDT
2009
ACM
121views Database» more  ICDT 2009»
14 years 6 months ago
Optimal splitters for database partitioning with size bounds
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
Kenneth A. Ross, John Cieslewicz
ICDT
2009
ACM
198views Database» more  ICDT 2009»
14 years 6 months ago
Consistent query answering under primary keys: a characterization of tractable queries
This article deals with consistent query answering to conjunctive queries under primary key constraints. The repairs of an inconsistent database db are obtained by selecting a max...
Jef Wijsen
ICDT
2009
ACM
105views Database» more  ICDT 2009»
14 years 6 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
ICDT
2009
ACM
135views Database» more  ICDT 2009»
14 years 1 days ago
Repair checking in inconsistent databases: algorithms and complexity
Managing inconsistency in databases has long been recognized as an important problem. One of the most promising approaches to coping with inconsistency in databases is the framewo...
Foto N. Afrati, Phokion G. Kolaitis