610 search results - page 14 / 122 » Efficient Query Evaluation on Probabilistic Databases |
163
click to vote
SIGMOD
2006
ACM
15 years 10 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
ADBIS
2009
Springer
14 years 7 months ago
2009
Springer
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the ...
180
click to vote
ASUNAM
2011
IEEE
13 years 9 months ago
2011
IEEE
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
PODS
2007
ACM
15 years 10 months ago
2007
ACM
Many applications today need to manage large data sets with uncertainties. In this paper we describe the foundations of managing data where the uncertainties are quantified as pro...
EDBT
2011
ACM
14 years 1 months ago
2011
ACM
This demonstration paper presents a probabilistic XML data merging tool, that represents the outcome of semi-structured document integration as a probabilistic tree. The system is...