A new balanced file organization scheme of order two for binary-valued records is given which we call HUBFS 2 (Hiroshima University balanced file organization scheme). It can be constructed for a wide range of parameters as is in NBFS 2 . Moreover, it has the least redundancy among the file organization schemes of order two under a general class of probability distribution of records having the invariance property in permutation of attributes. Our scheme is superior to the corresponding NBFS 2 due to Chow as well as BFS 2 due to Abraham, Ghosh, and Ray-Chaudhuri so far as the redundancy is concerned.

Design of a new balanced file organization scheme with the least redundancy

The recent advent of large scale, high-speed computers has produced an “information revolution.” One of the consequences of this has been the need for the development of filing systems which are capable of handling large volumes of data and permitting efficient information retrieval. This research is concerned with a file structure in which parameters like number of attributes, number of levels of each attribute, and types of queries are known and fixed. For this type of situation, first a review is given for a number of different types of filing schemes which have been recently discussed in the literature. Then attention is turned to a general model and filing systems based on certain types of combinatorial configurations. The construction of one type of configuration is achieved through the development of suitable methods of extending some of the properties of certain small orthogonal arrays to larger schemes. This type of construction may be combined with certain other schemes to yield multistage filin...

/pdf/the-design-of-combinatorial-information-retrieval-systems-514d93ibk9.pdf

The Design of Combinatorial Information Retrieval Systems for Files with Multiple-Valued Attributes

Information storage and retrieval — mathematical foundations II (combinatorial problems)☆

The balanced multiple-valued filing scheme was defined by Ghosh and Abraham (1968) . They constructed there two types of balanced multiple-valued filing scheme of order two. One scheme was obtained by deleting a spread generated by parallel lines in a finite affine geometry EG ( t, s ) and the other was obtained by deleting a partial spread generated by all the lines in a finite projective geometry PG ( t, s ) which have one particular point in common. The idea of these methods of construction was generalized by Koch (1967) . In this paper, we shall give a new type of balanced multiple-valued filing scheme of order two constructed by deleting a cyclically generated spread in a finite t -dimensional projective geometry PG ( t, s ) where t + 1 is not prime. Since the spread identified with the set of attributes and the lines identified with the buckets can be generated cyclically in multiplicative representation of the points in PG(t, s) , the proposed scheme can be implemented easily.

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

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.

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

Popular Tasks used by Researchers

How can I help with your research?

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

We encountered an error while loading the panel. Please try refreshing the page.

Something went wrong

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

Anyone with the link can view this chat. You can switch it back to private anytime.

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

R. C. Rose

Author Tools

Chat about Author

Papers

The Design of Combinatorial Information Retrieval Systems for Files with Multiple-Valued Attributes