Sciweavers

135 search results - page 14 / 27
» Answering aggregate keyword queries on relational databases ...
Sort
View
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 7 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
VLDB
2001
ACM
114views Database» more  VLDB 2001»
14 years 1 days ago
Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports
Estimating the number of distinct values is a wellstudied problem, due to its frequent occurrence in queries and its importance in selecting good query plans. Previous work has sh...
Phillip B. Gibbons
IADIS
2003
13 years 9 months ago
Querying Databases and XML Documents: Comparative Study and a New Proposal
XML has become the most useful standard of data interchange in the web and e-business world and there is a large amount of information stored in this format. Nonetheless, a large ...
Ana Fermoso García, María José...
VLDB
2004
ACM
158views Database» more  VLDB 2004»
14 years 29 days ago
REHIST: Relative Error Histogram Construction Algorithms
Histograms and Wavelet synopses provide useful tools in query optimization and approximate query answering. Traditional histogram construction algorithms, such as V-Optimal, optim...
Sudipto Guha, Kyuseok Shim, Jungchul Woo
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 7 months ago
Scalable Probabilistic Databases with Factor Graphs and MCMC
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
Michael L. Wick, Andrew McCallum, Gerome Miklau