Sciweavers

627 search results - page 12 / 126
» Efficient Top-k Query Evaluation on Probabilistic Data
Sort
View
JASIS
2010
124views more  JASIS 2010»
14 years 8 months ago
Query polyrepresentation for ranking retrieval systems without relevance judgments
Ranking information retrieval (IR) systems with respect to their effectiveness is a crucial operation during IR evaluation, as well as during data fusion. This paper offers a no...
Miles Efron, Megan A. Winget
WWW
2008
ACM
15 years 10 months ago
Efficient evaluation of generalized path pattern queries on XML data
Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms for this operation focus almost exclusively on path-patt...
Xiaoying Wu, Stefanos Souldatos, Dimitri Theodorat...
83
Voted
CORR
2012
Springer
209views Education» more  CORR 2012»
13 years 5 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
202views Database» more  SIGMOD 2011»
14 years 7 days ago
Sensitivity analysis and explanations for robust query evaluation in probabilistic databases
Probabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient...
Bhargav Kanagal, Jian Li, Amol Deshpande
CDB
2004
Springer
158views Database» more  CDB 2004»
15 years 1 months ago
Constraint Databases, Data Structures and Efficient Query Evaluation
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
Joos Heintz, Bart Kuijpers