A heuristic file reorganization algorithm based on record clustering

DOI10.1007/BF02219229zbMath0679.68193OpenAlexW2038562432MaRDI QIDQ1823029

Peter Scheuermann, Young Chul Park, Edward Omiecinski

Publication date: 1989

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02219229

zbMATH Keywords

heuristic algorithmsdatabase system's performancefile reorganizationjoin processingrecord clustering

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (1)

An adaptive mixed relation decomposition algorithm for conjunctive retrieval queries

Cites Work

• Reducing block accesses in inverted files by partial clustering
• Multidimensional B-trees for associative searching in database systems
• Use of graph-theoretic models for optimal relational database accesses to perform join

This page was built for publication: A heuristic file reorganization algorithm based on record clustering