610 search results - page 18 / 122 » Efficient Query Evaluation on Probabilistic Databases |
VLDB
2002
ACM
14 years 9 months ago
2002
ACM
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...
PODS
2007
ACM
15 years 10 months ago
2007
ACM
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and whyprovenance are particular cases of the same general algorithms...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Probabilistic frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied to standard "certain&quo...
DASFAA
2007
IEEE
15 years 1 months ago
2007
IEEE
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
174
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Until recently, most data integration techniques involved central components, e.g., global schemas, to enable transparent access to heterogeneous databases. Today, however, with t...