{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T21:17:36Z","timestamp":1693862256290},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[1979,1]]},"DOI":"10.1016\/0306-4379(79)90031-0","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T01:31:39Z","timestamp":1060306299000},"page":"23-33","source":"Crossref","is-referenced-by-count":4,"title":["Organization of quasi-consecutive retrieval files"],"prefix":"10.1016","volume":"4","author":[{"given":"Katsumi","family":"Tanaka","sequence":"first","affiliation":[]},{"given":"Yahiko","family":"Kambayashi","sequence":"additional","affiliation":[]},{"given":"Shuzo","family":"Yajima","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/0306-4379(79)90031-0_BIB1","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1145\/361573.361578","article-title":"File organization: The consecutive retrieval property","volume":"15","author":"Ghosh","year":"1972","journal-title":"Commun. ACM"},{"issue":"1","key":"10.1016\/0306-4379(79)90031-0_BIB2","doi-asserted-by":"crossref","DOI":"10.1016\/0378-3758(77)90004-0","article-title":"Partition of a query set with minimal number of subsets having consecutive retrieval property","volume":"1","author":"Yamamoto","year":"1977","journal-title":"J. Statist. Plan. Inference"},{"issue":"2","key":"10.1016\/0306-4379(79)90031-0_BIB3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/T-C.1974.223880","article-title":"On the consecutive retrieval property in file organization","volume":"c-27","author":"Waksman","year":"1974","journal-title":"IEEE Trans. Comp."},{"issue":"1","key":"10.1016\/0306-4379(79)90031-0_BIB4","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/0204005","article-title":"Faithful representation of a family of sets by a set of intervals","volume":"4","author":"Eswaran","year":"1975","journal-title":"SIAM J. Comp."},{"key":"10.1016\/0306-4379(79)90031-0_BIB5","series-title":"Data Base Organization for Data Management","author":"Ghosh","year":"1976"},{"key":"10.1016\/0306-4379(79)90031-0_BIB6","series-title":"Proc. of 7th Annual ACM Symp. on Theory of Computing","first-page":"255","article-title":"Linear algorithm to recognize interval graphs and test for the consecutive ones property","author":"Booth","year":"1975"},{"issue":"3","key":"10.1016\/0306-4379(79)90031-0_BIB7","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comp. System Sci."},{"issue":"8","key":"10.1016\/0306-4379(79)90031-0_BIB8","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1145\/360933.360991","article-title":"The consecutive storage of relevent records with redundancy","volume":"18","author":"Ghosh","year":"1975","journal-title":"Commun. ACM"},{"key":"10.1016\/0306-4379(79)90031-0_BIB9","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","article-title":"A characterization of comparability graph and of interval graphs","volume":"16","author":"Gilmore","year":"1964","journal-title":"Can. J. Math."},{"issue":"3","key":"10.1016\/0306-4379(79)90031-0_BIB10","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific J. Math."},{"issue":"1","key":"10.1016\/0306-4379(79)90031-0_BIB11","doi-asserted-by":"crossref","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","article-title":"Transitive orientation of graphs and identification of permutation graphs","volume":"23","author":"Pnueli","year":"1971","journal-title":"Can. J. Math."},{"key":"10.1016\/0306-4379(79)90031-0_BIB12","series-title":"Design Automation of Digital Systems","volume":"Vol. 1","year":"1973"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437979900310?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437979900310?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T04:50:40Z","timestamp":1552625440000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306437979900310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,1]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,1]]}},"alternative-id":["0306437979900310"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(79)90031-0","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1979,1]]}}}