Sumiyasu Yamamoto, Shinsei Tazawa, K. Ushio, H. Ikeda
{"title":"Design of a generalized balanced multiple-valued file organization scheme of order two","authors":"Sumiyasu Yamamoto, Shinsei Tazawa, K. Ushio, H. Ikeda","doi":"10.1145/509252.509271","DOIUrl":null,"url":null,"abstract":"A file organization scheme in an information storage and retrieval system which will be called a generalized Hiroshima University balanced multiple-valued file organization scheme of order two (GHUBMFS2) is presented, where the information about the records is indexed by m attributes having n values. The number of buckets to be organized and the redundancy of the file are the same as those of an inverted file. The number of pointer fields to be attached to the accession number stored in a bucket is reduced to a minimum in this scheme. It can answer for all second order as well as first order queries by the access to one bucket and the traversal of its contents without any set operations.","PeriodicalId":385279,"journal":{"name":"Proceedings of the 1978 ACM SIGMOD international conference on management of data","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1978-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1978 ACM SIGMOD international conference on management of data","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/509252.509271","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
A file organization scheme in an information storage and retrieval system which will be called a generalized Hiroshima University balanced multiple-valued file organization scheme of order two (GHUBMFS2) is presented, where the information about the records is indexed by m attributes having n values. The number of buckets to be organized and the redundancy of the file are the same as those of an inverted file. The number of pointer fields to be attached to the accession number stored in a bucket is reduced to a minimum in this scheme. It can answer for all second order as well as first order queries by the access to one bucket and the traversal of its contents without any set operations.