2853 search results - page 345 / 571 » On the Efficiency of Provenance Queries |
185
click to vote
PVLDB
2008
15 years 6 months ago
2008
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources -from sensor data, experimental data, data fro...
305
Voted
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
300
click to vote
ICDE
2004
IEEE
16 years 8 months ago
2004
IEEE
Efficient evaluation of XML queries requires the determination of whether a relationship exists between two elements. A number of labeling schemes have been designed to label the ...
261
click to vote
ICDE
1999
IEEE
16 years 8 months ago
1999
IEEE
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
138
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...