525 search results - page 33 / 105 » On Query Algebras for Probabilistic Databases |
191
click to vote
EDBT
2010
ACM
15 years 10 months ago
2010
ACM
Probabilistic top-k ranking queries have been extensively studied due to the fact that data obtained can be uncertain in many real applications. A probabilistic top-k ranking quer...
199
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
— In the context of adaptive query processing (AQP), several techniques have been proposed for dynamically adapting/redistributing processor load assignments throughout a computa...
306
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
We present the first complete translation of XPath into an algebra, paving the way for a comprehensive, state-of-theart XPath (and later on, XQuery) compiler based on algebraic op...
202
click to vote
ICDT
2001
ACM
15 years 11 months ago
2001
ACM
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
208
click to vote
WEBDB
2005
Springer
16 years 19 days ago
2005
Springer
Efficient query processing in P2P-based Web integration systems poses a variety of challenges resulting from the strict decentralization and limited knowledge. As a special probl...