There exist many interrelated information sources on the Internet that can be categorized into structured (database) and semistructured (documents). A key challenge is to integrat...
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
In this paper, an algorithm for obtaining consistent answers to queries posed to inconsistent relational databases is presented. The algorith is proven to be sound, terminating and...
In this paper we consider the problem of the logical characterization of the notion of consistent answer in a relational database that may violate given integrity constraints. Thi...
Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki