A MATHEMATICAL PROGRAMMING APPROACH TO THE SELECTION OF ACCESS PATHS FOR LARGE MULTIUSER DATA BASES
- 1 October 1983
- journal article
- Published by Wiley in Decision Sciences
- Vol. 14 (4) , 564-587
- https://doi.org/10.1111/j.1540-5915.1983.tb00206.x
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Techniques for Structuring Database RecordsACM Computing Surveys, 1983
- Frame memoryACM Transactions on Database Systems, 1981
- The Management of Information Resources - A Challenge for American BusinessMIS Quarterly, 1981
- Database design practices for inverted filesInformation & Management, 1980
- The determination of efficient record segmentations and blocking factors for shared data filesACM Transactions on Database Systems, 1977
- Minimum cost selection of secondary indexes for formatted filesACM Transactions on Database Systems, 1977
- Doubly-chained tree data base organisation--analysis and design strategiesThe Computer Journal, 1977
- Mathematical Techniques for Efficient Record Segmentation in Large Shared DatabasesJournal of the ACM, 1976
- A preliminary system for the design of DBTG data structuresCommunications of the ACM, 1975
- Analysis and performance of inverted data base structuresCommunications of the ACM, 1975