Research any topic before you write.

Find related topics. | Discover entities. | See connections. | Build a topical map.

Linear hashing

Linear hashing (LH) is a dynamic data structure which implements a hash table and grows or shrinks one bucket at a time. It was invented by Witold Litwin in 1980. It has been analyzed by Baeza-Yates and Soza-Pollman. It is the first in a number of schemes known as dynamic hashing such as Larson's Linear Hashing with Partial Extensions, Linear Hashing…

Art, Algorithm details & Adoption in language systems

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Research this topic

Explore the main themes, entities and connections around Linear hashing. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

Algorithm details

Linked listHash function
2 related topics

Adoption in language systems

Icon languageDynamic array
2 related topics

Adoption in database systems

Berkeley database system (BDB)CACM
2 related topics

Overview

Data structureHash tableLoad factorSpiral hashing
4 related topics

Topics to explore

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

Algorithm details

Adoption in language systems

Adoption in database systems

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics

Linear hashing

Nodes15
Edges14
Triples24
Avg. degree1.87
Density0.133333
Components1

How this topic connects Entity context

See the strongest relationship patterns around the current topic before diving into the raw triples.

Linear hashing

Top relations

related to Adoption in database systems · 6
Linear hashing → BDB, Berkeley, CACM, Esmond Pitt, Linear, Usenet
related to Split control · 5
Linear hashing → Controlled, If, Instead, Linear, When
related to Adoption in language systems · 4
Linear hashing → Griswold, Icon, They, Townsend

Important terminology Word statistics

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

buckets bucket hashing split file linear lh hash records displaystyle number state key dynamic two data one function index load

Entity relationships Subject–Predicate–Object triples

SubjectPredicateObjectConfidenceSrc
Larson's Linear Hashing with Partial Extensionsinstance ofIt is the first in a number of schemes known as dynamic hashing0.80text
Linear Hashing with Priority Splittinginstance ofIt is the first in a number of schemes known as dynamic hashing0.80text
Linear Hashing with Partial Expansionsinstance ofIt is the first in a number of schemes known as dynamic hashing0.80text
Priority Splittinginstance ofIt is the first in a number of schemes known as dynamic hashing0.80text
or Recursive Linear Hashing.The file structure of a dynamic hashing data structure adapts itself to changes in the size of the fileinstance ofIt is the first in a number of schemes known as dynamic hashing0.80text
so expensive periodic file reorganization is avoidedinstance ofIt is the first in a number of schemes known as dynamic hashing0.80text
Fagin's extendible hashing is that as the file expands due to insertionsinstance ofRecords are stored in buckets whose numbering starts with 0.The key distinction from schemes0.80text
only one bucket is split at a timeinstance ofRecords are stored in buckets whose numbering starts with 0.The key distinction from schemes0.80text
and the order in which buckets are split is already predetermined.Hash functionsThe hash function h iinstance ofRecords are stored in buckets whose numbering starts with 0.The key distinction from schemes0.80text
Linear hashingrelated to Adoption in database systemsLinear0.60section
Linear hashingrelated to Adoption in database systemsBerkeley0.60section
Linear hashingrelated to Adoption in database systemsBDB0.60section

Related concept clusters Concept neighborhoods

These clusters group vocabulary that occurs around closely connected concepts in the source material.

    Connections between topic areas Semantic bridges

    Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

    Min side: 3
    For writers, content strategists, SEOs, marketers and creators — from quick topic research to advanced semantic analysis.