777 search results - page 88 / 156 » Optimization of Relational Preference Queries |
ICDE
1998
IEEE
14 years 11 months ago
1998
IEEE
The association of timestamps with various data items such as tuples or attribute values is fundamental to the management of time-varying information. Using intervals in timestamp...
ICDE
2010
IEEE
14 years 5 months ago
2010
IEEE
— Massive data analysis on large clusters presents new opportunities and challenges for query optimization. Data partitioning is crucial to performance in this environment. Howev...
SIGMETRICS
2011
ACM
13 years 27 days ago
2011
ACM
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional X...
DAGSTUHL
2004
13 years 11 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...