… Just as the sequential buffer tree [5], the parallel buffer tree may delay the answering of … lel
processing than explicitly parallel data structures, such as the parallel buffer tree presented in …

… buffer tree: an external memory treesort, and an external memory priority queue. Our initial
experiments with buffer tree … with Parallel Disks We experimented briefly with storing the buffer …

… We present a new approach for combining kd trees and … the classical kd tree data structure,
called buffer kd tree, which can … A typical parallel kd tree implementation assigns one thread …

… minimum bounding rectangles of tree nodes and use these as input to our buffer model. The
… handled by representing each object by the smallest axis-parallel rectangle enclosing it. R-…

… -sided parallel line method involves a series of complex operations. In this paper, we proposed
a parallel buffer … a tree-like merging pathway for predesigned MPI parallel processes. The …

… tree, with cross-disk pointers (“Multiplexed” R-tree). The R-tree code is identical to the one for
a single-disk R-tree… decide which disk a newly created R-tree node should be stored in. We …

… We plan to implement some of the structures in the transparent parallel I/O environment (TPIE…
In section 3 we then develop the basic buffer tree structure which can be use to sort, and in …

… Parallel projection z-buffer images are precomputed for a … Then parallel or perspective views
can be found from any … position and projecting them onto an output z-buffer. A temporary z-…

… The reason for two different buffers is that the path buffer exclusively belongs to the R*-tree,
whereas the LRU-buffer is considered as a buffer of the underlying database or operating …

… processing, and buffer management schemes. This paper focuses on buffer schemes for …
However, differing from previous studies, we concentrate on buffer schemes for tree indexes …