199 search results - page 5 / 40 » Join queries on uncertain data: Semantics and efficient proc... |
118
click to vote
ICDE
2011
IEEE
14 years 1 months ago
2011
IEEE
— Array database systems are architected for scientific and engineering applications. In these applications, the value of a cell is often imprecise and uncertain. There are at le...
196
Voted
ICDE
2008
IEEE
16 years 9 months ago
2008
IEEE
This paper introduces an efficient algorithm for Producing Early Results in Multi-join query plans (PermJoin, for short). While most previous research focuses only on the
case of ...
CIKM
2009
Springer
15 years 1 months ago
2009
Springer
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...
88
Voted
ADC
2008
Springer
14 years 11 months ago
2008
Springer
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...