Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Implementation of the grid file: Design concepts and experience

From MaRDI portal
Publication:1066665
Jump to:navigation, search

DOI10.1007/BF01936137zbMath0578.68021MaRDI QIDQ1066665

Klaus Hinrichs

Publication date: 1985

Published in: BIT (Search for Journal in Brave)


zbMATH Keywords

grid filemultikey file structure


Mathematics Subject Classification ID

Data structures (68P05)


Related Items (4)

Maintaining range trees in secondary memory. Part I: Partitions ⋮ Symbolic image indexing and retrieval by spatial similarity: An approach based on B-tree ⋮ A robust and efficient spatial data structure. The nested interpolation- based grid file ⋮ Implementation of the grid file: Design concepts and experience


Uses Software

  • Modula



Cites Work

  • Unnamed Item
  • Unnamed Item
  • On search by address computation
  • Interpolation-based index maintenance
  • Analysis of grid file algorithms
  • Implementation of the grid file: Design concepts and experience
  • The extendible cell method for closest point problems
  • A storage scheme for extendible arrays




This page was built for publication: Implementation of the grid file: Design concepts and experience

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1066665&oldid=13080284"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 23:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki