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. © 1968 Academic Press Inc.