Very Large Data Bases · 1994 · 10 citations · 15 references
ComputingComputer ScienceData StructuresDatabasesInformation RetrievalData Structure AlgorithmsGeographic Data StructuresQuery ProcessingSpatial Data StructuresSpatial Database SystemsSpatial DatabasesPoint-based Data StructuresPolitical BoundariesSpatial Database StructuresVector Data StorageVector Data Structures
This paper introduces a new data structure, called V-trees, designed to store long sequences of points in 2D space and yet allow efficient access to their fragments. They also optimire access to a sequence of points when the query involves changes to a smaller scale. V-trees operate in much the same way as positional B-Trees do in the context of long fields and they can be viewed as a variant of Rtrees. The design of V-trees was motivated by the problem of storing and retrieving geographic objects that are fairly long, such as river margins or political boundaries, and the fact that geographic queries typically access just fragments of such objects, frequently using a smaller scale.
15
The R*-tree: an efficient and robust access method for points and rectangles
Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider et al. · 1990 · 4.2K citations · Full text
Computational geometry. an introduction
Franco P. Preparata, Michael Ian Shamos · 1985 · 2.4K citations