论文信息 - File Organization Schemes Based on Finite Geometries

File Organization Schemes Based on Finite Geometries

Some new schemes, possessing certain desirable properties, for organizing records with binary-valued attributes have been defined. It has been shown that it is possible to construct these filing schemes using finite geometires. The search time for a query involving any k attributes for these filing schemes based on finite geometries is very small in comparison wih existing filing schemes. Moreover, the search time does not depend on the number of records. The problem of updating is also quite simple.

[1] R. Carmichael,et al. Introduction to the theory of groups of finite order , 1908 .

[2] A. Albert. Modern Higher Algebra , 1937 .

[3] D. R. Davis,et al. Secondary key retrieval using an IBM 7090-1301 system , 1965, CACM.

[4] Werner Buchholz,et al. File Organization and Addressing , 1963, IBM Syst. J..

[5] W. H. Bussey,et al. Finite projective geometries , 1906 .

[6] W. Wells,et al. Modern higher algebra , 2022 .

[7] G. M.,et al. An Introduction to the Theory of Groups of Finite Order , 1908, Nature.

[8] E. Nering,et al. Linear Algebra and Matrix Theory , 1964 .

[9] R. C. Bose. ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS , 1939 .