On search by address computation

DOI10.1007/BF01934994zbMath0558.68057MaRDI QIDQ802312

Markku Tamminen

Publication date: 1985

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

searchingaddress computation data structuresmultiattribute file structuresorder preserving extendible hashingpriority queue problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (1)

Implementation of the grid file: Design concepts and experience

Cites Work

• Unnamed Item
• Interpolation-based index maintenance
• Average time behavior of distributive sorting algorithms
• Order preserving extendible hashing and bucket tries
• A note on the average depth of trees
• The extendible cell method for closest point problems
• Extendible hashing with overflow
• Two levels are as good as any
• Optimal Expected-Time Algorithms for Closest Point Problems
• On the average-case complexity of “bucketing” algorithms
• Searching and sorting real numbers
• Dynamic hashing

This page was built for publication: On search by address computation