Spatial indexing structures

Authors:
J. Kouris;E. Theodoridis;A. Tsakalidis
Affiliations:
Computer Engineering & Informatics Department, University of Patras, Patras, Greece and Research Academic Computer Technology Institute, Patras, Greece;Computer Engineering & Informatics Department, University of Patras, Patras, Greece and Research Academic Computer Technology Institute, Patras, Greece;Computer Engineering & Informatics Department, University of Patras, Patras, Greece and Research Academic Computer Technology Institute, Patras, Greece
Venue:
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
Year:
2005

Citing 14
Cited 0

The design and analysis of spatial data structures

The design and analysis of spatial data structures
The LSD tree: spatial access to multidimensional and non-point objects

VLDB '89 Proceedings of the 15th international conference on Very large data bases
The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The hB-tree: a multiattribute indexing method with good guaranteed performance

ACM Transactions on Database Systems (TODS)
Multidimensional access methods

ACM Computing Surveys (CSUR)
The Grid File: An Adaptable, Symmetric Multikey File Structure

ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files

ACM Transactions on Database Systems (TODS)
Data Structures for Range Searching

ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching

Communications of the ACM
The K-D-B-tree: a search structure for large multidimensional dynamic indexes

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Spatial Searching in Geometric Databases

Proceedings of the Fourth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems

VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we survey the most well known and widely used indexing structures for handling spatial information using both main memory and secondary media. We focus on the presentation of spatial object indexing structures and then we cite a number of applications that they can be used. We have paid attention to the variety of queries that each of these structures can answer and their price in computational time and memory space occupation.