{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T06:22:21Z","timestamp":1672986141811},"reference-count":40,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"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":[[1988,1]]},"DOI":"10.1016\/0306-4379(88)90024-5","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T01:31:39Z","timestamp":1060306299000},"page":"13-30","source":"Crossref","is-referenced-by-count":6,"title":["An integrated model of record segmentation and access path selection for databases"],"prefix":"10.1016","volume":"13","author":[{"given":"Prabuddha","family":"De","sequence":"first","affiliation":[]},{"given":"June S.","family":"Park","sequence":"additional","affiliation":[]},{"given":"Hasan","family":"Pirkul","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0306-4379(88)90024-5_BIB1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/319758.319760","article-title":"A unifying model of physical databases","volume":"7","author":"Batory","year":"1982","journal-title":"ACM Trans. Database Systems"},{"issue":"4","key":"10.1016\/0306-4379(88)90024-5_BIB2","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1145\/321978.321982","article-title":"Mathematical techniques for efficient record segmentation in large shared database","volume":"23","author":"Eisner","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0306-4379(88)90024-5_BIB3","series-title":"Proc. ACM SIGMOD Conf.","first-page":"93","article-title":"A heuristic approach to attribute partitioning","author":"Hammer","year":"1979"},{"key":"10.1016\/0306-4379(88)90024-5_BIB4","article-title":"A clustering approach to the generation of subfiles for the design of a computer database","author":"Hoffer","year":"1975"},{"key":"10.1016\/0306-4379(88)90024-5_BIB5","series-title":"Proc. Int. Conf. Very Large Data Bases","first-page":"69","article-title":"The use of cluster analysis in physical data base design","author":"Hoffer","year":"1975"},{"key":"10.1016\/0306-4379(88)90024-5_BIB6","article-title":"Models of storage structures and the design of database records based upon a user characterization","author":"March","year":"1978"},{"issue":"1","key":"10.1016\/0306-4379(88)90024-5_BIB7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/356901.356904","article-title":"Techniques for structuring database records","volume":"15","author":"March","year":"1983","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"10.1016\/0306-4379(88)90024-5_BIB8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1145\/320557.320574","article-title":"The determination of efficient record segmentations and blocking factors for shared data files","volume":"2","author":"March","year":"1977","journal-title":"ACM Trans. Database Systems"},{"issue":"3","key":"10.1016\/0306-4379(88)90024-5_BIB9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/1270.1481","article-title":"On the selection of efficient record segmentations and backup strategies for large shared database","volume":"9","author":"March","year":"1984","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0306-4379(88)90024-5_BIB10","series-title":"Design of Database Structures","author":"Teorey","year":"1982"},{"issue":"5","key":"10.1016\/0306-4379(88)90024-5_BIB11","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1287\/opre.20.5.993","article-title":"Problem decomposition and data reorganization by a clustering technique","volume":"20","author":"McCormick","year":"1972","journal-title":"Opns Res."},{"key":"10.1016\/0306-4379(88)90024-5_BIB12","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"issue":"1","key":"10.1016\/0306-4379(88)90024-5_BIB13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1287\/opre.15.1.39","article-title":"Solving bi-criterion mathematical programs","volume":"15","author":"Geoffrion","year":"1967","journal-title":"Opns Res."},{"issue":"4","key":"10.1016\/0306-4379(88)90024-5_BIB14","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1145\/359461.359475","article-title":"Approximating block accesses in database organizations","volume":"20","author":"Yao","year":"1977","journal-title":"Communs ACM"},{"key":"10.1016\/0306-4379(88)90024-5_BIB15","article-title":"Essays on some critical issues in physical database design","author":"Park","year":"1988"},{"issue":"2","key":"10.1016\/0306-4379(88)90024-5_BIB16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1080\/05695558208974586","article-title":"An overview of complexity theory in discrete optimization: part II. results and implications","volume":"14","author":"Parker","year":"1982","journal-title":"IIE Trans."},{"issue":"5","key":"10.1016\/0306-4379(88)90024-5_BIB17","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/360762.360766","article-title":"Analysis and performance of inverted data base structures","volume":"18","author":"Cardenas","year":"1975","journal-title":"Communs ACM"},{"issue":"11","key":"10.1016\/0306-4379(88)90024-5_BIB18","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1145\/182.358452","article-title":"Estimating block accesses in database organization: a closed noniterative formula","volume":"26","author":"Whang","year":"1983","journal-title":"Communs ACM"},{"key":"10.1016\/0306-4379(88)90024-5_BIB19","article-title":"Sorting and Searching, Vol. 3, The Art of Computer Programming","author":"Knuth","year":"1973"},{"issue":"2","key":"10.1016\/0306-4379(88)90024-5_BIB20","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/320455.320457","article-title":"System R: relational approach to database management","volume":"1","author":"Astrahan","year":"1976","journal-title":"ACM Trans. Database Systems"},{"issue":"1","key":"10.1016\/0306-4379(88)90024-5_BIB21","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1147\/sj.201.0041","article-title":"System R: an architectural overview","volume":"20","author":"Blasgen","year":"1981","journal-title":"IBM Systems J."},{"issue":"4","key":"10.1016\/0306-4379(88)90024-5_BIB22","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1145\/356707.356709","article-title":"A practical approach to selecting record access paths","volume":"9","author":"Severance","year":"1977","journal-title":"ACM Comput. Surv."},{"issue":"9","key":"10.1016\/0306-4379(88)90024-5_BIB23","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/362342.362352","article-title":"Evaluation and selection of file organization\u2014a model and system","volume":"16","author":"Cardenas","year":"1973","journal-title":"Communs ACM"},{"key":"10.1016\/0306-4379(88)90024-5_BIB24","series-title":"Database Systems","author":"Ullman","year":"1982"},{"issue":"6","key":"10.1016\/0306-4379(88)90024-5_BIB25","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0305-0548(87)90043-8","article-title":"Structural analysis of local search heuristics in combinatorial optimization","volume":"14","author":"Evans","year":"1987","journal-title":"Comput. Opns Res."},{"key":"10.1016\/0306-4379(88)90024-5_BIB26","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Opns Res."},{"issue":"4","key":"10.1016\/0306-4379(88)90024-5_BIB27","first-page":"718","article-title":"Database location in computer networks","volume":"27","author":"Fisher","year":"1980","journal-title":"Communs ACM"},{"key":"10.1016\/0306-4379(88)90024-5_BIB28","series-title":"Introduction to Sequencing and Scheduling","author":"Baker","year":"1974"},{"key":"10.1016\/0306-4379(88)90024-5_BIB29","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/0306-4379(88)90024-5_BIB30","series-title":"Integer Programming","author":"Garfinkel","year":"1972"},{"key":"10.1016\/0306-4379(88)90024-5_BIB31","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/0306-4379(88)90024-5_BIB32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangian relaxation method for solving integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Mgmt Sci."},{"issue":"2","key":"10.1016\/0306-4379(88)90024-5_BIB33","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/inte.15.2.10","article-title":"An applications oriented guide to Lagrangian relaxation","volume":"15","author":"Fisher","year":"1985","journal-title":"Interfaces"},{"key":"10.1016\/0306-4379(88)90024-5_BIB34","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangian relaxation and its uses in integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Mathl Programg Stud."},{"issue":"7","key":"10.1016\/0306-4379(88)90024-5_BIB35","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1109\/TC.1986.1676799","article-title":"Computer and database location in distributed computer systems","volume":"C-35","author":"Gavish","year":"1986","journal-title":"IEEE Trans. Computers"},{"issue":"1","key":"10.1016\/0306-4379(88)90024-5_BIB36","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1145\/5236.5241","article-title":"Optimization of join operations in horizontally partitioned database systems","volume":"11","author":"Segev","year":"1986","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0306-4379(88)90024-5_BIB37","series-title":"Linear Programming","author":"Chvatal","year":"1983"},{"issue":"1","key":"10.1016\/0306-4379(88)90024-5_BIB38","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1287\/mnsc.23.1.27","article-title":"An efficient algorithm for the 0\u20131 knapsack problem","volume":"23","author":"Nauss","year":"1976","journal-title":"Mgmt Sci."},{"issue":"1","key":"10.1016\/0306-4379(88)90024-5_BIB39","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Mathl Programg"},{"key":"10.1016\/0306-4379(88)90024-5_BIB40","article-title":"The Art of Computer Programming, Vol. 1, Seminumerical Algorithms","author":"Knuth","year":"1973"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437988900245?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437988900245?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:53:34Z","timestamp":1552625614000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306437988900245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,1]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,1]]}},"alternative-id":["0306437988900245"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(88)90024-5","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1988,1]]}}}