Design of a new balanced file organization scheme with the least redundancy

DOI10.1016/S0019-9958(75)90267-3zbMath0309.68034MaRDI QIDQ4068077

Hideto Ikeda, Sumiyasu Yamamoto, Shinsei Shige-eda, Noboru Hamada, Kazuhiko Ushio

Publication date: 1975

Published in: Information and Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) General topics in the theory of software (68N01)

Related Items

Decomposition of a Complete Multi-Partite Graph into Isomorphic Claws ⋮ The proof of Ushio's conjecture concerning path factorization of complete bipartite graphs ⋮ \(P_{4k-1}\)-factorization of bipartite multigraphs ⋮ On \(K_{p,q}\)-factorization of complete bipartite multigraphs ⋮ The spectrum of path factorization of bipartite multigraphs ⋮ Partition of a query set into minimal number of subsets having consecutive retrieval property ⋮ Some filing schemes based on finite groups of automorphisms ⋮ \(G\)-designs and related designs ⋮ Decomposition of the complete hypergraph into hyperclaws ⋮ Cyclic multiple-valued filing schemes for higher-order queries