Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
A new technique for compression and storage of data
Communications of the ACM
An optimization problem on the selection of secondary keys
ACM '71 Proceedings of the 1971 26th annual conference
A clustering approach to the generation of subfiles for the design of a computer data base.
A clustering approach to the generation of subfiles for the design of a computer data base.
On the selection of efficient record segmentations and backup strategies for large shared databases
ACM Transactions on Database Systems (TODS)
Vertical partitioning algorithms for database design
ACM Transactions on Database Systems (TODS)
Partitioning Problems in Parallel, Pipeline, and Distributed Computing
IEEE Transactions on Computers
An Effective Approach to Vertical Partitioning for Physical Design of Relational Databases
IEEE Transactions on Software Engineering
Parametric optimization of sequence alignment
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing
IEEE Transactions on Computers
ACM Computing Surveys (CSUR)
Fast and numerically stable parametric alignment of biosequences
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Polynomial-time solutions to image segmentation
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Database Systems (TODS)
The determination of efficient record segmentations and blocking factors for shared data files
ACM Transactions on Database Systems (TODS)
Parametric Combinatorial Computing and a Problem of Program Module Distribution
Journal of the ACM (JACM)
A Practical Approach to Selecting Record Access Paths
ACM Computing Surveys (CSUR)
Techniques for Structuring Database Records
ACM Computing Surveys (CSUR)
Database cost analysis: a top-down approach
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
An empirical comparison: tree and lattice structures for symbolic data bases
SIGIR '79 Proceedings of the 2nd annual international ACM SIGIR conference on Information storage and retrieval: information implications into the eighties
A heuristic approach to attribute partitioning
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Horizontal data partitioning in database design
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Foundations for multifile design by application partitioning
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Parametric Multiple Sequence Alignment and Phylogeny Construction
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Using sparsification for parametric minimum spanning tree problems
Nordic Journal of Computing
Efficient algorithms for robustness in resource allocation and scheduling problems
Theoretical Computer Science
Balancing applied to maximum network flow problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A survey of physical database design methodology and techniques
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
A DBMS for large statistical databases
VLDB '79 Proceedings of the fifth international conference on Very Large Data Bases - Volume 5
A mathematical model for product selection strategies in a recommender system
Expert Systems with Applications: An International Journal
On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows
International Journal of Computer Vision
An examination of cluster identification-based algorithms for vertical partitions
International Journal of Business Information Systems
Approximating the Minimum Chain Completion problem
Information Processing Letters
An efficient algorithm for the parametric resource allocation problem
Discrete Applied Mathematics
Experimental evaluation of parametric max-flow algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
How good is the Chord algorithm?
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Relaxation labelling - the principle of 'least disturbance'
Pattern Recognition Letters
Ordered optimal solutions and parametric minimum cut problems
Discrete Optimization
Constructing the minimization diagram of a two-parameter problem
Operations Research Letters
Calculation of stability radii for combinatorial optimization problems
Operations Research Letters
| Hi-index | 0.02 |
It is possible to significantly reduce the average cost of information retrieval from a large shared database by partitioning data items stored within each record into a primary and a secondary record segment. An analytic model, based upon knowledge of data item lengths, transportation costs, and retrieval patterns, is developed to assist an analyst with this assignment problem. The model is generally applicable to environments in which a database resides in secondary storage, and is useful for both uniprogramming and multiprogramming systems. A computationally tractable record design algorithm has been implemented as a Fortran program and applied to numerous problems. Realistic examples are presented which demonstrate a potential for reducing total system cost by more than 65 percent.