11 search results - page 2 / 3 » A Bottom-up Strategy for Query Decomposition |
DASFAA
2010
IEEE
13 years 9 months ago
2010
IEEE
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
VLDB
2003
ACM
14 years 5 months ago
2003
ACM
The Decomposition Storage Model (DSM) vertically partitions all attributes of a given relation. DSM has excellent I/O behavior when the number of attributes touched in the query i...
GVD
2001
13 years 6 months ago
2001
A flexible method to store XML documents in relational or object-relational databases is presented that is based on an adaptable fragmentation. Whereas most known approaches decom...
IJCAI
2003
13 years 6 months ago
2003
With the growing use of distributed information networks, there is an increasing need for algorithmic and system solutions for data-driven knowledge acquisition using distributed,...
TKDE
2010
13 years 3 months ago
2010
—We investigate techniques to automatically decompose any XQuery query—including updating queries specified by the XQuery Update Facility (XQUF)—into subqueries, that can be ...