1007 search results - page 36 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
134
click to vote
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
122
Voted
EUROPAR
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Parallel relational databases have been successful in providing scalable performance for data intensive applications, and much work has been carried out on query processi...
112
click to vote
ADBIS
1998
Springer
15 years 6 months ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
191
click to vote
TOG
2012
13 years 4 months ago
2012
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
118
Voted
SIGCOMM
1998
ACM
15 years 6 months ago
1998
ACM
In Layer Four switching, the route and resources allocated to a packet are determined by the destination address as well as other header elds of the packet such as source address,...