Range Queries on Distributed Spatial Approximation Trees

M. Marín (Chile)


: Information Retrieval, Text Databases, Para llel Computing, BSP Computing.


This paper presents a distributed realization of the Spatial Approximation Tree (SAT) which is suitable for process ing range queries in parallel. The children of all nodes are mapped on different processors so that good load bal ance is achieved during query processing. We present bulk synchronous parallel algorithms for range query processing on distributed SATs.

Important Links:

Go Back