Advertisement

Design of optimal balanced filing schemes

  • Sumiyasu Yamamoto
Part 3. Physical Data Base Design
Part of the Lecture Notes in Computer Science book series (LNCS, volume 133)

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.

Keywords

Graphical Structure Retrieval Performance Information Retrieval System Secondary Memory Record Distribution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.Google Scholar
  2. 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.Google Scholar
  3. 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.Google Scholar
  4. 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.Google Scholar
  5. Chow D. K. (1969). New balanced-file organization schemes. Information and Control, Vol. 15, No. 5, November 1969, pp 377–396.Google Scholar
  6. 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.Google Scholar
  7. Ghosh S. P. (1977). Data base organization for data management. Academic Press, N. Y., 1977.Google Scholar
  8. 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.Google Scholar
  9. Ikeda H. (1977). Evaluation of combinatorial file organization schemes. Proc. 3rd Int. Conf. on VLDB, October 1977, pp 231–235.Google Scholar
  10. Ikeda H. (1978). Combinatorial file organization schemes and their experimental evaluation. Hiroshima Math. J., Vol. 8, No. 3, October 1978, pp 515–544.Google Scholar
  11. 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)Google Scholar
  12. Ray-Chaudhuri D. K. (1968). Combinatorial information retrieval systems for files. SIAM J. Appl. Math., Vol. 16, No. 5, September 1968, pp 973–992.Google Scholar
  13. 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.Google Scholar
  14. 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.Google Scholar
  15. 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.Google Scholar
  16. 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.Google Scholar
  17. 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.Google Scholar
  18. 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.Google Scholar
  19. 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.Google Scholar
  20. 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.Google Scholar
  21. Yamamoto S., and Tazawa S. (1980). Hyperclaw decomposition of complete hypergraphs. Annals of Discrete Mathematics, Vol. 6, 1980, pp 385–391.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Sumiyasu Yamamoto
    • 1
  1. 1.Department of Mathematics and Comupting CenterHiroshima UniversityHiroshimaJAPAN

Personalised recommendations