Sciweavers

ICDT
2009
ACM
121views Database» more  ICDT 2009»
13 years 2 months ago
Automatic verification of database-driven systems: a new frontier
We describe a novel approach to verification of software systems centered around an underlying database. Instead of applying general-purpose techniques with only partial guarantee...
Victor Vianu
ICDT
2009
ACM
135views Database» more  ICDT 2009»
13 years 11 months ago
On approximating optimum repairs for functional dependency violations
Solmaz Kolahi, Laks V. S. Lakshmanan
ICDT
2009
ACM
127views Database» more  ICDT 2009»
13 years 11 months ago
A logical account of uncertain databases based on linear logic
A formal semantics of uncertain databases typically takes an algebraic approach by mapping an uncertain database to a set of relational databases, or possible worlds. We present a...
Sungwoo Park, Seung-won Hwang
ICDT
2009
ACM
135views Database» more  ICDT 2009»
13 years 11 months 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
ICDT
2009
ACM
248views Database» more  ICDT 2009»
14 years 5 months ago
Automatic verification of data-centric business processes
We formalize and study business process systems that are centered around "business artifacts", or simply "artifacts". This approach focuses on data records, kn...
Alin Deutsch, Richard Hull, Fabio Patrizi, Victor ...
ICDT
2009
ACM
150views Database» more  ICDT 2009»
14 years 5 months ago
Optimizing user views for workflows
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...
Olivier Biton, Susan B. Davidson, Sanjeev Khanna, ...
ICDT
2009
ACM
121views Database» more  ICDT 2009»
14 years 5 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
175views Database» more  ICDT 2009»
14 years 5 months ago
Structural characterizations of schema-mapping languages
Schema mappings are declarative specifications that describe the relationship between two database schemas. In recent years, there has been an extensive study of schema mappings a...
Balder ten Cate, Phokion G. Kolaitis
ICDT
2009
ACM
173views Database» more  ICDT 2009»
14 years 5 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
109views Database» more  ICDT 2009»
14 years 5 months ago
TOP-K projection queries for probabilistic business processes
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specific...
Daniel Deutch, Tova Milo