1007 search results - page 16 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
158
click to vote
SIGMOD
2005
ACM
15 years 11 months ago
2005
ACM
This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of ranking (top-k) queries in relational database syst...
163
click to vote
SIGMOD
2007
ACM
15 years 11 months ago
2007
ACM
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
PODC
2010
ACM
15 years 3 months ago
2010
ACM
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
106
click to vote
DPD
2006
14 years 11 months ago
2006
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
117
click to vote
IJCIS
1998
14 years 11 months ago
1998
We present the systematic design and development of a distributed query scheduling service DQS in the context of DIOM, a distributed and interoperable query mediation system 26 ...