To study the data dependencies over heterogeneous data in dataspaces, we define a general dependency form, namely comparable dependencies (cds), which specifies constraints on comparable attributes. It covers the semantics of a broad class of dependencies in databases, including functional dependencies (fds), metric functional dependencies (mfds), and matching dependencies (mds). As we illustrated, comparable dependencies are useful in real practice of dataspaces, such as semantic query optimization. Due to heterogeneous data in dataspaces, the first question, known as the validation problem, is to tell whether a dependency (almost) holds in a data instance. Unfortunately, as we proved, the validation problem with certain error or confidence guarantee is generally hard. In fact, the confidence validation problem is also np-hard to approximate to within any constant factor. Nevertheless, we develop several approaches for efficient approximation computation, such as greedy and randomized approaches with an approximation bound on the
Finally, to deal with the issues of very large heterogeneous databases and uncertainty, approximate approaches (greedy and randomized approaches with approximation bounds on errors) are also developed REF .
Comparable dependencies over heterogeneous data
The VLDB Journal
The VLDB Journal
Computer Science