Mixed-Type Multiple-Valued Filing Scheme of Order One and Two

  • Shinsei Tazawa


This paper will present a filing scheme for multiple-valued records. It is assumed that records are characterized by m attributes having n values each, and the query set consists of two kinds of queries, where one (called a first-order query) specifies a value of one attribute and another one (called a second-order query) specifies values of two attributes. The number of buckets to be organized and the redundancy of the file are less than those of an inverted file, provided the distribution of records is uniform. The number of pointer fields to be attached to the accession number stored in a bucket is considerably reduced in this scheme. Every first-order query can be answered by the access to one bucket. Every second-order query can be answered by the access to one bucket and the traversal of its contents without any set operations.


Pointer Field Access Path Attribute Number Finite Geometry File Organization 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    CT. Abraham, S. P. Ghosh, and D. K. Ray-Chaudhuri, File organization schemes based on finite geometries, Information and Control 12, 143–163 (1968).MATHCrossRefGoogle Scholar
  2. 2.
    G. Berman, The application of difference sets to the design of a balanced multiple-valued filing scheme, Information and Control 32, 128–138 (1976).MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    G. Berman, Combinatorial multiple-valued filing systems for multiattribute queries, Information and Control 36, 119–132 (1978).MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    R. C. Bose, C. T. Abraham, and S. P. Ghosh, File organization of records with multiple-valued attributes for multi-attributes queries, in: “Combinatorial Mathematics and Its Applications”, University of North Carolina Press, Chapel Hill, N.C., pp.277–297 (1969).Google Scholar
  5. 5.
    R. C. Bose and G. G. Koch, The design of combinatorial information retrieval systems for files with multiple-valued attributes, SIAM J. Appl. Math. 17, 1203–1214 (1969).MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    D. K. Chow, New balanced-file organization schemes, Information and Control 15, 377–396 (1969).MATHCrossRefGoogle Scholar
  7. 7.
    V. Donaldson and L. W. Hawkes, Cyclic multiple-valued filing schemes for higher-order queries, Information Sciences 32, 47–74 (1984).MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    S. P. Ghosh, Organization of records with unequal multiple-valued attributes and combinatorial queries of order 2, Information Sciences 1, 363–380 (1969).CrossRefGoogle Scholar
  9. 9.
    S. P. Ghosh and C. T. Abraham, Application of finite geometry in file organization for records with multiple-valued attributes, IBM J. Res. Develop. 12, 180–187 (1968).MATHCrossRefGoogle Scholar
  10. 10.
    H. Ikeda, Combinatorial file organization schemes and their experimental evaluation, Hiroshima Math. J. 8, 515–544 (1978).MathSciNetMATHGoogle Scholar
  11. 11.
    D. K. Ray-Chaudhuri, Combinatorial information retrieval systems for files, SIAM J. Appl. Math. 16, 973–992 (1968).MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    S. Tazawa, Design of file organization schemes for selected query set on binary-valued attributes and their redundancies, Information and Control 50, 23–33 (1981).MATHCrossRefGoogle Scholar
  13. 13.
    S. Yamamoto, H. Ikeda, S. Shige-eda, K. Ushio, and N. Hamada, Design of a new balanced file organization scheme with the least redundancy, Information and Control 28, 156–175 (1975).MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    S. Yamamoto, S. Tazawa, K. Ushio, and H. Ikeda, 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 (1978).Google Scholar
  15. 15.
    S. Yamamoto, S. Tazawa, K. Ushio, and H. Ikeda, Design of a balanced multiple-valued file-organization scheme with the least redundancy, ACM Trans. Database Systems 4, 518–530 (1979).CrossRefGoogle Scholar
  16. 16.
    S. Yamamoto, T. Teramoto, and K. Futagami, Design of a balanced multiple-valued filing scheme of order two based on cyclically generated spread in finite projective geometry, Information and Control 21, 72–91 (1972).MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Plenum Press, New York 1987

Authors and Affiliations

  • Shinsei Tazawa
    • 1
  1. 1.Department of MathematicsKinki UniversityOsakaJapan

Personalised recommendations