Efficient spatial access to a data base

Authors:
Markku Tamminen
Affiliations:
Helsinki University of Technology, Finland
Venue:
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Year:
1982

Citing 6
Cited 3

Extendible hashing—a fast access method for dynamic files

ACM Transactions on Database Systems (TODS)
Optimal Expected-Time Algorithms for Closest Point Problems

ACM Transactions on Mathematical Software (TOMS)
Geographic Data Processing

ACM Computing Surveys (CSUR)
Approximation of polygonal maps by cellular maps

Communications of the ACM
Interactive Computer Graphics: Data Structures, Algorithms, Languages

Interactive Computer Graphics: Data Structures, Algorithms, Languages
Location of a point in a planar subdivision and its applications

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing

Database Support for Knowledge-Based Image Evaluation

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Towards a Spatial Query Language: User Interface Considerations

VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Review: 3D geo-database research: Retrospective and future directions

Computers & Geosciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a file organization scheme providing fast access to spatially referenced objects in a data base. The method utilizes a geometric file structure based on extendible cells together with a so-called topological representation of areas. It is shown to have O(1) expected access cost for the "point-in-polygonnetwork-query" in typical situations. The method can be used as a spatial directory to a data base. Performance indicators are reported.