A robust and efficient spatial data structure. The nested interpolation- based grid file

DOI10.1007/BF01178777MaRDI QIDQ1203721zbMATH OpenFDO

Authors M. Aris Ouksel, O. Mayer

Publication date 22 February 1993

Published in Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

nested interpolation-based grid file

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Implementation of the grid file: Design concepts and experience
• scientific article; zbMATH DE number 1424305
• Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects
• Indexing support for spatial joins
• Efficient query processing in geographic information systems

Cites work

• scientific article; zbMATH DE number 194563 (Why is no real title available?)
• Implementation of the grid file: Design concepts and experience
• Implicit data structures for linear hashing schemes
• Interpolation-based index maintenance
• Multidimensional B-trees for associative searching in database systems
• Multidimensional binary search trees used for associative searching
• Organization and maintenance of large ordered indexes

Cited in

(7)

• The empty bin: A data structure for spatial search of time‐varying data
• Temporal Grid File: A file structure for interval data
• The average height of a node in the BANG abstract directory tree
• scientific article; zbMATH DE number 2203878 (Why is no real title available?)
• Management of concurrency in interpolation based grid file organization and its performance
• Implementation of the grid file: Design concepts and experience
• Multidimensional quantile hashing is very efficient for nonuniform distributions

This page was built for publication: A robust and efficient spatial data structure. The nested interpolation- based grid file

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1203721)