Design of a balanced multiple-valued filing scheme of order two based on cyclically generated spread in finite projective geometry

Yamamoto, Sumiyasu; Teramoto, Takeaki; Futagami, Kojiro

doi:10.1016/s0019-9958(72)90050-2

Cited by 15 publications

(7 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Abraham [9], and Yamamoto et al [17]). Note further that HUBMFSz can be constructed for a less restrictive set of parameters than an algebraically constructed BMF&, as will be seen presently.…”

Section: Construction Of Hubmfs:!mentioning

confidence: 97%

“…The graphical structure of these c lines is called the graphical structure of the bucket. A bucket whose graphical structure is a collection of c lines of a partite-claw of degree c is called apurtite-claw (PC) bucket of degree c. A bucket whose graphical structure is a collection of all c = ("; ) lines of a complete graph KS with s points is called a clique bucket of degree c. Such clique buckets can, for example, be seen in Ghosh [8], Ghosh and Abraham [9], and Yamamoto et al [17]. Three examples illustrating the correspondence between buckets and their graphical structures are given in Figure 2.…”

Section: Records and Queriesmentioning

confidence: 99%

“…The balanced filing schemes of order two (BFS2) by Abraham, Ghosh, and Ray-Chaudhuri [l]; Ray-Chaudhuri [13]; Chow [6]; and Yamamoto et al [16]; and the balanced multiple-valued filing scheme of order two (BMF&) by Ghosh and Abraham [9]; Bose, Abraham, and Ghosh [4]; Bose and Koch [5]; Ghosh [7]; Yamamoto, Teramoto, and Futagami [17]; and Berman [2] reflect this tradeoff vividly. In order to reduce the number of buckets to be prepared and the redundancy of the file, they are designed combinatorially so that every bucket is associated with a set of several queries and contains an index of records pertinent to at least one of the associated queries (cf.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Design of a balanced multiple-valued file-organization scheme with the least redundancy

Hsiao

1979

ACM Trans. Database Syst.

Self Cite

View full text Add to dashboard Cite

A new balanced fiie-organization scheme of order two for multiple-valued records is presented. This scheme is called HUBMFS, (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 pa&e-claw buckets, is given. A construction algorithm is also given. The proposed HUBMFSz is superior to existing BMFS2 (Balanced Multiple-valued File-organization Schemes of order two) in that it has the least redundancy among all possible BMF&'s having the same parameters and that it can be constructed for a less restrictive set of parameters.

show abstract

Section: Construction Of Hubmfs:!mentioning

confidence: 97%

Section: Records and Queriesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Design of a balanced multiple-valued file-organization scheme with the least redundancy

Hsiao

1979

ACM Trans. Database Syst.

Self Cite

View full text Add to dashboard Cite

show abstract

“…In fact, combinatorial designs, in particular, cyclic designs are widely used in many other areas, for example, designs of experiments, group testing [9], authentication codes [25,36], filing schemes [3,38], etc. For the applications to these areas, it is desired to generate the blocks with less storage and time.…”

Section: Theorem 13 (Siemonmentioning

confidence: 99%

“…For a given s-subset with s ≤ t (for example, a pair, a triple, etc.) of the point set V , say T , it is usually required to find the blocks containing the certain T in the applications to group testing [9], filing schemes [3,38], etc. The affine-invariant property works effectively for this kind of problems.…”

Section: Searching Blocksmentioning

confidence: 99%

Affine-invariant strictly cyclic Steiner quadruple systems

Jimbo

2016

Des. Codes Cryptogr.

View full text Add to dashboard Cite

To determine the spectrum of Steiner quadruple systems (SQS) admitting a specific automorphism group is of great interest in design theory. We consider a strictly cyclic SQS which is invariant under the affine group, called an AsSQS. For the applications of designs of experiments, group testing, filing schemes, authentication codes, and optical orthogonal codes for CDMA communication, etc., a larger automorphism group containing the cyclic group may work efficiently for the procedures of generating and searching blocks in a design with less storage and time. In this paper, constructions and a necessary condition for the existence of an AsSQS are investigated. For a prime p ≡ 1 (mod 4), Direct Construction A establishes an AsSQS(2 p), provided that a 1-factor of a graph exists, where the graph is defined by using a system of generators of the projective special linear group PSL(2, p). Direct Construction B gives an AsSQS(2 p) which is 2-chromatic, provided that a rainbow 1-factor of a specific hypergraph exists. Accordingly, by proposing two recursive constructions of an AsSQSs(2 p m ) for a positive integer m, we prove that an AsSQS(2 p m ) exists, if the criteria developed for an AsSQS(2 p) are satisfied. We verified the claim and found that an AsSQS(2 p m ) exists for every prime p ≡ 1 (mod 4) with p < 10 5 and any positive integer m.

show abstract

Design of optimal balanced filing schemes

Yamamoto

1982

Data Base Design Techniques II:

View full text Add to dashboard Cite

Design of a balanced multiple-valued filing scheme of order two based on cyclically generated spread in finite projective geometry

Cited by 15 publications

References 5 publications

Design of a balanced multiple-valued file-organization scheme with the least redundancy

Design of a balanced multiple-valued file-organization scheme with the least redundancy

Affine-invariant strictly cyclic Steiner quadruple systems

Design of optimal balanced filing schemes

Contact Info

Product

Resources

About