Data base organization for data management (2nd ed.)
Data base organization for data management (2nd ed.)
A practitioner's guide to addressing algorithms
Communications of the ACM
Design of a generalized balanced multiple-valued file organization scheme of order two
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Current practice in the evaluation of multikey search algorithms
SIGIR '83 Proceedings of the 6th annual international ACM SIGIR conference on Research and development in information retrieval
| Hi-index | 0.00 |
A new balanced file-organization scheme of order two for multiple-valued records is presented. This scheme is called HUBMFS2 (Hiroshima University Balanced Multiple-valued File-organization Scheme of order two). It is assumed that records are characterized by m attributes having n possible values each, and the query set consists of queries which specify values of two attributes. It is shown that the redundancy of the bucket (the probability of storing a record in the bucket) is minimized if and only if the structure of the bucket is a partite-claw. A necessary and sufficient condition for the existence of an HUBMFS2, which is composed exclusively of partite-claw buckets, is given. A construction algorithm is also given. The proposed HUBMFS2 is superior to existing BMFS2 (Balanced Multiple-valued File-organization Schemes of order two) in that it has the least redundancy among all possible BMFS2's having the same parameters and that it can be constructed for a less restrictive set of parameters.