Skip to search formSkip to main contentSkip to account menu

A cost-based model and effective heuristic for repairing constraints by value modification

TLDR
It is proved that finding minimal-cost repairs in this model is NP-complete in the size of the database, and an approach to heuristic repair-construction based on equivalence classes of attribute values is introduced.
View on ACM (opens in a new tab)

Keys for XML

We discuss the definition of keys for XML documents, payingparticular attention to the concept of a relative key, which is commonly used in hierarchically structured documents and scientific…
View on ACM (opens in a new tab)

Conditional Functional Dependencies for Data Cleaning

TLDR
This work develops techniques for detecting CFD violations in SQL as well as novel techniques for checking multiple constraints in a single query, and experimentally evaluates the performance of the CFD-based methods for inconsistency detection.
View on IEEE (opens in a new tab)

Secure XML querying with security views

TLDR
This work is the first to study a flexible, DTD-based access-control model for XML and its implications on the XML query-execution engine and is among the first efforts for query rewriting and optimization in the presence of general DTDs for a rich a class of XPath queries.
View on ACM (opens in a new tab)

Improving Data Quality: Consistency and Accuracy

TLDR
This paper proposes two algorithms: one for automatically computing a repair D' that satisfies a given set of CFDs, and the other for incrementally finding a repair in response to updates to a clean database.
View Paper (opens in a new tab)

XPath satisfiability in the presence of DTDs

TLDR
A finer analysis of the problem for particular classes of DTDs is given, exploring the impact of various DTD constructs, identifying tractable cases, as well as providing the complexity in the query size alone.
View on ACM (opens in a new tab)

Reasoning about Keys for XML

View via Publisher (opens in a new tab)

Conditional functional dependencies for capturing data inconsistencies

TLDR
This work proposes a class of integrity constraints for relational databases, referred to as conditional functional dependencies (CFDs), and provides an inference system analogous to Armstrong's axioms for FDs, and shows that the implication problem is coNP-complete for CFDs in contrast to the linear-time complexity for their traditional counterpart.
View on ACM (opens in a new tab)

Structural properties of XPath fragments

TLDR
Structural properties of each of the main sublanguages of navigational XPath (W3c Recommendation) commonly used in practice are studied, providing sound and complete axiom systems and normal forms for several of these fragments.
View via Publisher (opens in a new tab)

Reasoning about Record Matching Rules

TLDR
A class of matching dependencies (MDs) for specifying the semantics of data in unreliable relations is introduced, defined in terms of similarity metrics and a dynamic semantics, and a mechanism for inferring MDs is proposed, a departure from traditional implication analysis.
View via Publisher (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)