Efficient Processing of Range Queries over Distributed Relational Databases

摘要

There have been several solutions proposed for solving the distributed range query problem. These involve specialized data structures that map the location of the various data elements. In this paper, we propose a solution that solves the range query problem without the use of any auxiliary data structure.