455 search results - page 39 / 91 » On Trees and Noncrossing Partitions |
IPPS
1997
IEEE
14 years 22 hour ago
1997
IEEE
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
ICDT
2001
ACM
14 years 8 days ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
VLDB
1995
ACM
13 years 11 months ago
1995
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering and query rewrite (JOQR) followed by parallelization. We focus on t...
JHSN
2007
13 years 7 months ago
2007
: Network resource provisioning techniques need to perform both inter-path and intra-path load balancing to maximize the network’s resource usage efficiency while supporting end...
PACT
2009
Springer
14 years 11 days ago
2009
Springer
In this paper, we design and implement an efficient technique for parallel evidence propagation on state-of-the-art multicore processor systems. Evidence propagation is a major ste...