{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T05:02:37Z","timestamp":1698037357811},"reference-count":20,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":6959,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp; Computers in Japan"],"published-print":{"date-parts":[[1988,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In most studies of the optimum allocation problem of the data file in the distributed database system, access to individual files is considered independent, ignoring the relation among files. This assumption may not be appropriate in actual cases. In this paper, the expression for the query cost is simplified as long as the essential aspect of the problem is maintained. A formulation is made based on a clear distinction between the part of the file which can be considered as independent in the individual access, and the part which is not. Then for each formulation, the computational complexity in the optimum file allocation is discussed. It is shown that the problem for the former can be answered in a polynomial time, while the latter is NP\u2010hard.<\/jats:p>","DOI":"10.1002\/scj.4690190306","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T15:16:57Z","timestamp":1183821417000},"page":"53-63","source":"Crossref","is-referenced-by-count":0,"title":["Computational complexity of the file allocation problem in distributed database systems"],"prefix":"10.1002","volume":"19","author":[{"given":"Hiroshi","family":"Yamasaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomio","family":"Hirata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaharu","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshihide","family":"Ibaraki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"P. M. G.Apers. Redundant allocation of relations in a communication network Proc. 5th Berkeley Workshop on Distributed Data Management and Computer Networks pp.245\u2013258(1981)."},{"key":"e_1_2_1_3_2","unstructured":"C.CarraresiandG.Gallo. Optimal location of files and programs in computer networks Proc. Communicazione al 10th Int'1 Symposium on Mathematical Programming Montreal(1979)."},{"key":"e_1_2_1_4_2","unstructured":"R. G.Casey. Allocation of copies of a file in an information network Proc. AFIPS Spring Joint Comput. Conf. pp.617\u2013625(1972)."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1969.222542"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/356876.356883"},{"key":"e_1_2_1_7_2","unstructured":"K. P.Eswaran. Placement of records in a file and file allocation in a computer network Proc. IFIP pp.304\u2013307(1974)."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322226"},{"key":"e_1_2_1_9_2","volume-title":"Computer and Intractability: A Guide to the Theory of NP\u2010Completeness","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.234179"},{"key":"e_1_2_1_11_2","first-page":"691","article-title":"Adaptive structuring of distributed database","volume":"51","author":"Levin K. D.","year":"1982","journal-title":"Proc. AFIPS Nat'1 Comput. Conf."},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/320434.320449"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/359581.359591"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1985.232195"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580444"},{"key":"e_1_2_1_16_2","unstructured":"J. B.RothnieandN.Goodman. A survey of research and development in distributed database management inProc. VLDB(1977)."},{"key":"e_1_2_1_17_2","unstructured":"C. T.Yu M. K.Siu K.LamandC. H.Chen. File allocation in distributed databases with interaction between files inProc. VLDB pp.248\u2013259(1983)."},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1985.232830"},{"key":"e_1_2_1_19_2","volume-title":"Bit","author":"Kambayashi","year":"1984"},{"issue":"4","key":"e_1_2_1_20_2","first-page":"458","article-title":"Computational complexity of file allocation problem based on requests of usersm","volume":"65","author":"Kikuno","year":"1982","journal-title":"Trans. (D), I.E.C.E., Japan"},{"key":"e_1_2_1_21_2","article-title":"Optimum data allocation in distributed database concerning response time and communication cost","volume":"18","author":"Yoshida","year":"1983","journal-title":"Tech. Rep. Distributed Proc., Inf. Proc. Soc. Japan"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690190306","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690190306","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T11:54:21Z","timestamp":1697975661000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690190306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["10.1002\/scj.4690190306"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690190306","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}