Sciweavers

376 search results - page 5 / 76
» Semantics and Evaluation of Top-k Queries in Probabilistic D...
Sort
View
PVLDB
2010
110views more  PVLDB 2010»
13 years 6 months ago
Read-Once Functions and Query Evaluation in Probabilistic Databases
Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, q...
Prithviraj Sen, Amol Deshpande, Lise Getoor
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
CORR
2012
Springer
209views Education» more  CORR 2012»
12 years 3 months ago
Aggregation in Probabilistic Databases via Knowledge Compilation
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...
Robert Fink, Larisa Han, Dan Olteanu
SIGMOD
2011
ACM
234views Database» more  SIGMOD 2011»
12 years 10 months ago
Ranking with uncertain scoring functions: semantics and sensitivity measures
Ranking queries report the top-K results according to a user-defined scoring function. A widely used scoring function is the weighted summation of multiple scores. Often times, u...
Mohamed A. Soliman, Ihab F. Ilyas, Davide Martinen...
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
14 years 9 months ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...