Paper Info
Title
Redundancy in spatial databases
Abstract
Spatial objects other than points and boxes can be stored in spatial indexes, but the techniques usually require the use of approximations that can be arbitrarily bad. This leads to poor performance and highly inaccurate responses to spatial queries. The situation can be improved by storing some objects in the index redundantly. Most spatial indexes permit no flexibility in adjusting the amount of redundancy. Spatial indexes based on z-order permit this flexibility. Accuracy of the query response increases with redundancy, (there is a “diminishing return” effect). Search time, as measured by disk accesses first decreases and then increases with redundancy. There is, therefore, an optimal amount of redundancy (for a given data set). The optimal use of redundancy for z-order is explored through analysis of the z-order search algorithm and through experiments.
Year
DOI
Venue
1989
10.1145/67544.66954
SIGMOD Conference
Keywords
Field
DocType
spatial index,search algorithm,indexation,spatial database
Data mining,Search algorithm,Computer science,Redundancy (engineering),Database
Conference
Volume
Issue
ISSN
18
2
0163-5808
ISBN
Citations 
PageRank 
0-89791-317-5
91
73.85
References 
Authors
8
1
Name
Order
Citations
PageRank
Jack A. Orenstein1366216.38