Algorithms for multidimensional partitioning of static files

DOI10.1109/32.9056MaRDI QIDQ3813333zbMATH OpenOpenAlexWikidataFDO

Authors Doron Rotem, Arie Segev

Publication date 1988

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/32.9056

zbMATH Keywords

dynamic programminggrid filemultidimensional accessmultidimensional file partitioningphysical databasereorganization

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Recommendations

• Parallel methods for solving fundamental file rearrangement problems
• Multidimensional binary partitions: distributed data structures for spatial partitioning
• EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES
• Disk allocation methods for binary Cartesian product files
• Optimal partitioning of data chunks in deduplication systems
• Efficient algorithms for path partitions

Cited in

(7)

• Analysis of grid file algorithms
• Implementation of the grid file: Design concepts and experience
• A heuristic file reorganization algorithm based on record clustering
• scientific article; zbMATH DE number 3883590 (Why is no real title available?)
• scientific article; zbMATH DE number 1875378 (Why is no real title available?)
• EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES
• Optimal MMI file systems for orthogonal range retrieval

This page was built for publication: Algorithms for multidimensional partitioning of static files

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