Abstract
A gist of the design of optimal balanced filing schemes is discussed in connection with inverted schemes. The underlying idea is explained by introducing a multiple queries to adress transformation (MQAT) which yields a new less redundant storing scheme called HUBFS1. Essentials of our recent work on optimal balanced filing schemes are also introduced in relation to the construction of MQAT.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Abraham C. T., Ghosh S. P., and Ray-Chaudhuri D. K. (1968). File organization schemes based on finite geometries. Information and Control, Vol. 12, No. 2, February 1968, pp 143–163.
Berman G. (1976). The application of difference sets to the design of a balanced multiple-valued filing scheme. Information and Control, Vol. 32, No. 2, October 1976, pp 128–138.
Bose R. C., Abraham C. T., and Ghosh S. P. (1969). File organization of records with multiple-valued attributes for multi-attributes queries. Combinatorial Mathematics and Its Applications, UNC Press, 1969, pp 277–297.
Bose R. C., and Koch G. G. (1969). The design of combinatorial information retrieval systems for files with multiple-valued attributes. SIAM J. Appl. Math., Vol. 17, No. 6, November 1969, pp 1203–1214.
Chow D. K. (1969). New balanced-file organization schemes. Information and Control, Vol. 15, No. 5, November 1969, pp 377–396.
Ghosh S. P. (1969). Organization of records with unequal multiple-valued attributes and combinatorial queries of order 2. Information Sciences, Vol. 1, 1969, pp 363–380.
Ghosh S. P. (1977). Data base organization for data management. Academic Press, N. Y., 1977.
Ghosh S. P., and Abraham C. T. (1968). Application of finite geometry in file organization for records with multiple-valued attributes. IBM J. Res. Develop., Vol. 12, No. 2, March 1968, pp 180–187.
Ikeda H. (1977). Evaluation of combinatorial file organization schemes. Proc. 3rd Int. Conf. on VLDB, October 1977, pp 231–235.
Ikeda H. (1978). Combinatorial file organization schemes and their experimental evaluation. Hiroshima Math. J., Vol. 8, No. 3, October 1978, pp 515–544.
Ikeda H., and Naito M. (1979). Evaluation of a combinatorial file organization scheme of order one. Proc. Study on Scientific Database Management Systems, February 1979, Edited by Ohsuga S., pp 195–199. (Japanese)
Ray-Chaudhuri D. K. (1968). Combinatorial information retrieval systems for files. SIAM J. Appl. Math., Vol. 16, No. 5, September 1968, pp 973–992.
Tazawa S., Ushio K., and Yamamoto S. (1978). Partite-claw-decomposition of a complete multi-partite graph. Hiroshima Math. J., Vol. 8, No. 1, March 1978, pp 195–206.
Ushio K., Tazawa S., and Yamamoto S. (1978). On claw-decomposition of a complete multi-partite graph. Hiroshima Math. J., Vol. 8, No. 1, March 1978, pp 207–210.
Yamamoto S., Teramoto T., and Futagami K. (1972). Design of a balanced multiple-valued filing scheme of order two based on cyclically generated spread in finite projective geometry. Information and Control, Vol. 21, No. 1, August 1972, pp 72–91.
Yamamoto S., Ikeda H., Shige-eda S., Ushio K., and Hamada N. (1975a). Design of a new balanced file organization scheme with the least redundancy. Information and Control, Vol. 28, No. 2, June 1975, pp 156–175.
Yamamoto S., Ikeda H., Shige-eda S., Ushio K., and Hamada N. (1975b). On claw-decomposition of complete graphs and complete bigraphs. Hiroshima Math. J., Vol. 5, No. 1, March 1975, pp 33–42.
Yamamoto S., Tazawa S., Ushio K., and Ikeda H. (1978). Design of a generalized balanced multiple-valued file organization scheme of order two. Proc. of 8-th ACM-SIGMOD Int. Conf. on Management of Data.
Yamamoto S., Tazawa S., Ushio K., and Ikeda H. (1979). Design of a balanced multiple-valued file-organization scheme with the least redundancy. ACM Transactions on Database Systems, Vol. 4, No. 4, December 1979, pp 518–530.
Yamamoto S., and Tazawa S. (1979). Combinatorial aspects of balanced file organization schemes. Journal of Information Processing. Vol. 2, No. 3, December 1979, pp 127–133.
Yamamoto S., and Tazawa S. (1980). Hyperclaw decomposition of complete hypergraphs. Annals of Discrete Mathematics, Vol. 6, 1980, pp 385–391.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamamoto, S. (1982). Design of optimal balanced filing schemes. In: Yao, S.B., Kunii, T.L. (eds) Data Base Design Techniques II:. DBDT 1979. Lecture Notes in Computer Science, vol 133. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11215-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-11215-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11215-0
Online ISBN: 978-3-540-39054-1
eBook Packages: Springer Book Archive