Abstract
This paper discusses the splitting of files into smaller portions as dictated by the usage pattern in order to improve the data base performance. The feasibility of the splitting is shown. The treatment is within the context of the relational model of data [1].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Codd, E.F. “A relational model of data for large shared data banks”, Communication of ACM, Vol 13, No. 6, June 1970.
Burns, D.: “ROBOT - A new approach to database management”, Fourth European Conference on EDP Developments in Department Stores, London, November 1972.
Osman, I.M.: “Matching the storage to usage pattern in relational data bases” Ph.D. thesis, Durham University, October 1974.
Delobel, C.: “Decomposition of a data base and the theory of Casey, R.G. boolean switching functions”, IBM Journal of Research and Development, Vol. 17, No. 5, September 1973, pp 374–386.
Rissanen, J.: “Decomposition of files, a basis for data storage and Delobel,C. retrieval”, IBM Research Report, RJ-1220, May 1973.
Notley, M.G.: “The Peterlee IS/1 System” IBM (UK) Scientific Centre Report, March 1972, UKSC 0018.
Boyce,Raymond F.: “Using a STRUCTURED English query language as Chaimberlin, a data definition facility”, IBM San Jose Donald D. (California), December 10, 1973, RJ-1318.
Casey, R.G.: “Generalised page replacement algorithms in a Osman, I.M. relational data base”, Proceedings 1974 ACMSIGFIDET Workshop on Data Description, Access and Control, to be available from ACM HQ, 1974.
Knuth, D.E.: “The art of computer programming”, Vol. 3, “Sorting and searching”, Addison-Wesley, 1973, pp. 506–542.
Wishart,: David “CLUSTAN USER”, Computing Laboratory, University of St. Andrews, St. Andrews, Fife, Scotland, 1969 (obtainable from the author)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Osman, I.M. (1975). The Partitioning of a Data Base Into Subfiles Matching User’s Queries. In: Siefkes, D. (eds) GI-4.Jahrestagung. Lecture Notes in Computer Science, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-40087-6_51
Download citation
DOI: https://doi.org/10.1007/978-3-662-40087-6_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-39104-4
Online ISBN: 978-3-662-40087-6
eBook Packages: Springer Book Archive