Sciweavers

1125 search results - page 108 / 225
» Query Answering in Inconsistent Databases
Sort
View
KDD
2006
ACM
121views Data Mining» more  KDD 2006»
14 years 10 months ago
Query-time entity resolution
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
SIGMOD
2002
ACM
119views Database» more  SIGMOD 2002»
14 years 10 months ago
Rate-based query optimization for streaming information sources
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...
Stratis Viglas, Jeffrey F. Naughton
ICDE
2009
IEEE
190views Database» more  ICDE 2009»
14 years 12 months ago
Progressive Keyword Search in Relational Databases
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...
Guoliang Li, Xiaofang Zhou, Jianhua Feng, Jianyong...
VLDB
2007
ACM
116views Database» more  VLDB 2007»
14 years 10 months ago
On the Correctness Criteria of Fine-Grained Access Control in Relational Databases
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...
Qihua Wang, Ting Yu, Ninghui Li, Jorge Lobo, Elisa...
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
14 years 10 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch