File organization
From MaRDI portal
Publication:5659055
DOI10.1145/361573.361578zbMath0246.68004OpenAlexW2023280155MaRDI QIDQ5659055
Publication date: 1972
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/361573.361578
Related Items
Algorithmic characterizations of interval orderd hypergraphs and applications, Consecutive retrieval property -- revisited, Consecutive retrieval with redundancy: An optimal linear and an optimal cyclic arrangement and their storage space requirements, On Robinsonian dissimilarities, the consecutive ones property and latent variable models, Modeling recreational systems using optimization techniques and information technologies, Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings, Bridges between deterministic and probabilistic models for binary data, A conjunctive parallelogram model for Pick any/\(n\) data, On the storage space requirement of consecutive retrieval with redundancy, Algorithmic approach to the consecutive retrieval property, Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results, Information storage and retrieval - mathematical foundations. II: Combinatorial problems, Partition of a query set into minimal number of subsets having consecutive retrieval property, One more polynomial complete consecutive retrieval problem, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, Preemptive scheduling and antichain polyhedra, On identification of CR property in file organisation, On testing consecutive-ones property in parallel, On the consecutive ones property, A multichannel storage arrangement scheme of pictorial databases for concurrent spatial match retrieval, On the consecutive retrieval property for generalized binary queries, Obtaining matrices with the consecutive ones property by row deletions, Polynomial-time local-improvement algorithm for consecutive block minimization, Minimising the number of gap-zeros in binary matrices
