Sciweavers

1778 search results - page 261 / 356
» The Theory of Probabilistic Databases
Sort
View
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
15 years 9 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
TIFS
2008
129views more  TIFS 2008»
15 years 4 months ago
On Empirical Recognition Capacity of Biometric Systems Under Global PCA and ICA Encoding
Performance of biometric-based recognition systems depends on various factors: database quality, image preprocessing, encoding techniques, etc. Given a biometric database and a se...
Natalia A. Schmid, Francesco Nicolo
CORR
2010
Springer
139views Education» more  CORR 2010»
14 years 11 months ago
Data Cleaning and Query Answering with Matching Dependencies and Matching Functions
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
Leopoldo E. Bertossi, Solmaz Kolahi, Laks V. S. La...
PODS
2011
ACM
201views Database» more  PODS 2011»
14 years 7 months ago
Data exchange beyond complete data
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
Marcelo Arenas, Jorge Pérez, Juan L. Reutte...
PODS
2011
ACM
220views Database» more  PODS 2011»
14 years 7 months ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams