The goal of entity resolution is to reconcile database references corresponding to the same real-world entities. Given the abundance of publicly available databases where entities...
Indrajit Bhattacharya, Lise Getoor, Louis Licamele
Relational query optimizers have traditionally relied upon table cardinalities when estimating the cost of the query plans they consider. While this approach has been and continue...
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
Databases are increasingly being used to store information covered by heterogeneous policies, which require support for access control with great flexibility. This has led to incr...
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...