{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T05:18:24Z","timestamp":1648876704552},"reference-count":30,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":[[1985,1]]},"DOI":"10.1016\/0306-4379(85)90005-5","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T01:31:39Z","timestamp":1060306299000},"page":"21-25","source":"Crossref","is-referenced-by-count":11,"title":["On the complexity of some multi-attribute file design problems"],"prefix":"10.1016","volume":"10","author":[{"given":"C.Y.","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.J.","family":"Buehrer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.C.T.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0306-4379(85)90005-5_BIB1","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/320071.320074","article-title":"Optimal partial-match retrieval when fields are independently specified","volume":"4","author":"Aho","year":"1979","journal-title":"ACM Trans. on Database Systems"},{"issue":"4","key":"10.1016\/0306-4379(85)90005-5_BIB2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00993055","article-title":"Algorithmic approach to the consecutive retrieval property","volume":"8","author":"Al-Fedaghi","year":"1979","journal-title":"Int. J. Comput. Inform. Sci."},{"issue":"2","key":"10.1016\/0306-4379(85)90005-5_BIB3","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1145\/322123.322126","article-title":"Optimality properties of multiplekey hashing functions","volume":"26","author":"Bolour","year":"1979","journal-title":"J. Assoc. Computing Mach."},{"key":"10.1016\/0306-4379(85)90005-5_BIB4","unstructured":"C. C. Chang, M. W. Du and R. C. T. Lee: Performance analysis of Cartesian product files and random files. IEEE Trans. on Software Engng., to appear."},{"key":"10.1016\/0306-4379(85)90005-5_BIB5","unstructured":"C. C. Chang, M. W. Du and R. C. T. Lee: The hierarchical ordering in multi-attribute files. Inform. Sci., to appear."},{"key":"10.1016\/0306-4379(85)90005-5_BIB6","series-title":"Proc. ACMSIGMOD 1980 Conf.","first-page":"157","article-title":"Some properties of Cartesian product files","author":"Chang","year":"1980"},{"issue":"3","key":"10.1016\/0306-4379(85)90005-5_BIB7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1109\/TSE.1982.235253","article-title":"Symbolic gray code as a perfect multi-attribute hashing scheme for partial match queries","volume":"SE-8","author":"Chang","year":"1982","journal-title":"IEEE Trans. on Software Engng"},{"key":"10.1016\/0306-4379(85)90005-5_BIB8","series-title":"Proc. 21th Allerton Conf. on Commun., Control, and Computing, University of Illinois","article-title":"Some properties of multi-attribute file systems based upon multiple key hashing functions","author":"Chang","year":"1983"},{"issue":"1","key":"10.1016\/0306-4379(85)90005-5_BIB9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/TPAMI.1980.4766976","article-title":"Symbolic gray code as a multi-key hashing function","volume":"PAMI-2","author":"Du","year":"1980","journal-title":"IEEE Trans. on Pattern Anal. Mach. Intelligence"},{"issue":"1","key":"10.1016\/0306-4379(85)90005-5_BIB10","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1145\/319682.319698","article-title":"Disk allocation for Cartesian product files on multiple disk systems","volume":"7","author":"Du","year":"1982","journal-title":"ACM Trans. on Database Systems"},{"key":"10.1016\/0306-4379(85)90005-5_BIB11","series-title":"Data Base Organization for Data Management","author":"Ghosh","year":"1977"},{"issue":"1","key":"10.1016\/0306-4379(85)90005-5_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0306-4379(80)90063-0","article-title":"Reducing block accesses in inverted files by partial clustering","volume":"5","author":"Jakobsson","year":"1980","journal-title":"Inform. Systems"},{"issue":"2","key":"10.1016\/0306-4379(85)90005-5_BIB13","first-page":"1","article-title":"Multi-key sorting","volume":"3","author":"Lee","year":"1979","journal-title":"Policy Anal. Inform. Systems"},{"issue":"2","key":"10.1016\/0306-4379(85)90005-5_BIB14","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1109\/TSE.1979.234172","article-title":"Common properties of some multi-attribute file systems","volume":"SE-5","author":"Lin","year":"1979","journal-title":"IEEE Trans. on Software Engng."},{"key":"10.1016\/0306-4379(85)90005-5_BIB15","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0306-4379(77)90007-2","article-title":"Multi-dimensional clustering for data base organizations","volume":"2","author":"Liou","year":"1977","journal-title":"Inform. Systems"},{"issue":"1","key":"10.1016\/0306-4379(85)90005-5_BIB16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/0205003","article-title":"Partial-match retrieval algorithms","volume":"14","author":"Rivest","year":"1976","journal-title":"SIAM J. Computing"},{"issue":"2","key":"10.1016\/0306-4379(85)90005-5_BIB17","first-page":"63","article-title":"Attribute based file organization in a paged memory environment","volume":"17","author":"Rothnie","year":"1974","journal-title":"Commun. Assoc. for Computing Machinery"},{"key":"10.1016\/0306-4379(85)90005-5_BIB18","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0306-4379(85)90005-5_BIB19","author":"Garey","year":"1979"},{"key":"10.1016\/0306-4379(85)90005-5_BIB20","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1978"},{"issue":"3","key":"10.1016\/0306-4379(85)90005-5_BIB21","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0204018","article-title":"Every prime has a succinct certificate","volume":"4","author":"Pratt","year":"1975","journal-title":"SIAM J. Computing"},{"key":"10.1016\/0306-4379(85)90005-5_BIB22","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","article-title":"Reimann's Hypothesis and tests for primality","volume":"13","author":"Miller","year":"1976","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/0306-4379(85)90005-5_BIB23","first-page":"120","article-title":"A method for obtaining digital signatures and public-key cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Commun. Assoc. Computing Machinery"},{"key":"10.1016\/0306-4379(85)90005-5_BIB24","article-title":"Primarily testing and Jacobi sums","author":"Cohen","year":"1982"},{"issue":"6","key":"10.1016\/0306-4379(85)90005-5_BIB25","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1145\/358141.358144","article-title":"An overview of computational complexity","volume":"26","author":"Cook","year":"1983","journal-title":"Commun. ACM"},{"key":"10.1016\/0306-4379(85)90005-5_BIB26","series-title":"Proc. Cambridge Phil. Soc.","first-page":"341","article-title":"Theorems on factorization and primality testing","author":"Pollard","year":"1974"},{"issue":"1","key":"10.1016\/0306-4379(85)90005-5_BIB27","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0206006","article-title":"A fast Montecarlo test for primality","volume":"6","author":"Solovay","year":"1977","journal-title":"SIAM J. Computing"},{"key":"10.1016\/0306-4379(85)90005-5_BIB28","doi-asserted-by":"crossref","first-page":"173","DOI":"10.2307\/2006975","article-title":"On distinguishing prime numbers from composite numbers","volume":"117","author":"Adleman","year":"1983","journal-title":"Ann. Math."},{"key":"10.1016\/0306-4379(85)90005-5_BIB29","series-title":"Applied Dynamic Programming","author":"Bellman","year":"1962"},{"key":"10.1016\/0306-4379(85)90005-5_BIB30","series-title":"Introduction to Dynamic Programming","author":"Nemhauser","year":"1966"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437985900055?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437985900055?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:52:48Z","timestamp":1552625568000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306437985900055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["0306437985900055"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(85)90005-5","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}