Abstract
A balanced multiple-valued filing scheme of order ( t − 1) is constructed based on the finite projective geometry PG(t, q) , ( t + 1) not prime, t odd. The attributes and attribute values are defined using a spread of flats from PG(t, q) as in Yamamoto et al. ( Inform. Contr. 21 (1972), 7291) and Berman ( Inform. Contr. 32 (1976), 128138). Certain structural properties of PG(t, q) are exploited, resulting in an easily constructed bucket structure. The ( t − 2)-flats, which represent the buckets, are partitioned into orbits each of which is uniquely identifiable by its difference vector. The storage and retrieval algorithms are based on these difference vectors. There is no scanning of buckets or sub-buckets. The concepts in this paper are illustrated by an example based on PG (5, 2).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
