{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T01:44:45Z","timestamp":1648518285628},"reference-count":28,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"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":["Data &amp; Knowledge Engineering"],"published-print":{"date-parts":[[1993,10]]},"DOI":"10.1016\/0169-023x(93)90002-7","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T17:15:20Z","timestamp":1047662120000},"page":"125-150","source":"Crossref","is-referenced-by-count":4,"title":["Access cost estimation for physical database design"],"prefix":"10.1016","volume":"11","author":[{"given":"Paolo","family":"Ciaccia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario","family":"Maio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0169-023X(93)90002-7_BIB1","series-title":"Information Processing 80","first-page":"487","article-title":"Performance of the System R access path selection algorithm","author":"Astrahan","year":"1980"},{"issue":"3","key":"10.1016\/0169-023X(93)90002-7_BIB2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0306-4379(86)90028-1","article-title":"Choice of the optimal number of blocks for data access by an index","volume":"11","author":"Bergamaschi","year":"1986","journal-title":"Informat. Syst."},{"issue":"2","key":"10.1016\/0169-023X(93)90002-7_BIB3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1145\/319983.319987","article-title":"Duplicate record elimination in large data files","volume":"8","author":"Bitton","year":"1983","journal-title":"ACM TODS"},{"issue":"4","key":"10.1016\/0169-023X(93)90002-7_BIB4","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1093\/comjnl\/28.4.398","article-title":"An approximation algorithm for secondary index selection in relational database physical design","volume":"28","author":"Bonanno","year":"1985","journal-title":"Comput. J."},{"key":"10.1016\/0169-023X(93)90002-7_BIB5","series-title":"Proc. 4th IEEE COMPSAC Conf.","first-page":"784","article-title":"An indexing technique for relational data bases","author":"Bonfatti","year":"1980"},{"key":"10.1016\/0169-023X(93)90002-7_BIB6","article-title":"Exact and approximate algorithms for the index selection problem in physical database design","author":"Caprara","year":"1992","journal-title":"Technical Report 87, CIOC-CNR"},{"issue":"5","key":"10.1016\/0169-023X(93)90002-7_BIB7","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1145\/360762.360766","article-title":"Analysis and performance of inverted database structures","volume":"18","author":"Cardenas","year":"1975","journal-title":"Commun. ACM"},{"issue":"2","key":"10.1016\/0169-023X(93)90002-7_BIB8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0306-4379(83)90035-2","article-title":"Estimating record selectivities","volume":"8","author":"Christodoulakis","year":"1983","journal-title":"Informat. Syst."},{"issue":"1","key":"10.1016\/0169-023X(93)90002-7_BIB9","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0306-4379(84)90017-6","article-title":"Estimating block selectivities","volume":"9","author":"Christodoulakis","year":"1984","journal-title":"Informat. Syst."},{"issue":"2","key":"10.1016\/0169-023X(93)90002-7_BIB10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/329.318578","article-title":"Implications of certain assumptions in database performance evaluation","volume":"9","author":"Christodoulakis","year":"1984","journal-title":"ACM TODS"},{"issue":"1","key":"10.1016\/0169-023X(93)90002-7_BIB11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1109\/69.124900","article-title":"Estimating block selectivities for physical database design","volume":"4","author":"Chu","year":"1992","journal-title":"IEEE Trans. Knowledge Data Engrg."},{"key":"10.1016\/0169-023X(93)90002-7_BIB12","article-title":"Block access estimation for clustered data","author":"Ciaccia","year":"1993","journal-title":"IEEE Trans. Knowledge Data Engrg."},{"key":"10.1016\/0169-023X(93)90002-7_BIB13","first-page":"145","article-title":"Performance of database relations under alternative orderings: the role of attribute dependence","volume":"vol. 1","author":"Ciaccia","year":"1991"},{"key":"10.1016\/0169-023X(93)90002-7_BIB14","article-title":"On the optimal ordering of multiple-field tables","author":"Ciaccia","year":"1992","journal-title":"Technical Report 86, CIOC-CNR"},{"issue":"6","key":"10.1016\/0169-023X(93)90002-7_BIB15","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","article-title":"A relational model of data for large shared data banks","volume":"13","author":"Codd","year":"1970","journal-title":"Commun. ACM"},{"issue":"4","key":"10.1016\/0169-023X(93)90002-7_BIB16","doi-asserted-by":"crossref","DOI":"10.1145\/320289.320296","article-title":"The difficulty of optimum index selection","volume":"3","author":"Comer","year":"1978","journal-title":"ACM TODS"},{"issue":"3","key":"10.1016\/0169-023X(93)90002-7_BIB17","first-page":"732","article-title":"Measures of association for cross classifications","volume":"49","author":"Goodman","year":"1954","journal-title":"J. Amer. Statist. Soc."},{"key":"10.1016\/0169-023X(93)90002-7_BIB18","doi-asserted-by":"crossref","DOI":"10.1109\/32.238566","article-title":"Block access estimation for clustered data using a finite LRU buffer","author":"Grandi","year":"1993","journal-title":"IEEE Trans. Software Engrg."},{"issue":"4","key":"10.1016\/0169-023X(93)90002-7_BIB19","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1145\/115302.115300","article-title":"Statistical estimators for aggregate relational algebra queries","volume":"16","author":"Hou","year":"1991","journal-title":"ACM TODS"},{"key":"10.1016\/0169-023X(93)90002-7_BIB20","series-title":"Proc. IEEE COMPSAC Conf.","article-title":"An approximation algorithm for the index selection problem","author":"Ip","year":"1981"},{"key":"10.1016\/0169-023X(93)90002-7_BIB21","series-title":"Proc. ACM SIGMOD Internat. Conf. on Management of Data","first-page":"179","article-title":"A new way to compute the product and join of relations","author":"Kim","year":"1980"},{"key":"10.1016\/0169-023X(93)90002-7_BIB22","series-title":"Proc. IEEE COMPSAC Conf.","first-page":"228","article-title":"Considerations in developing a design tool for a relational DBMS","author":"Schkolnick","year":"1979"},{"key":"10.1016\/0169-023X(93)90002-7_BIB23","series-title":"Proc. ACM SIGMOD Internat. Conf. on Management of Data","first-page":"23","article-title":"Access path selection in a relational database system","author":"Selinger","year":"1979"},{"issue":"2","key":"10.1016\/0169-023X(93)90002-7_BIB24","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/359997.360010","article-title":"A stochastic evaluation model for database organizations in data retrieval systems","volume":"19","author":"Siler","year":"1976","journal-title":"Commun. ACM"},{"key":"10.1016\/0169-023X(93)90002-7_BIB25","series-title":"Proc. 12th VLDB Internat. Conf.","first-page":"119","article-title":"Estimating block accesses when attributes are correlated","author":"Vander-Zanden","year":"1986"},{"issue":"2","key":"10.1016\/0169-023X(93)90002-7_BIB26","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0306-4379(87)90042-1","article-title":"A general framework for computing block accesses","volume":"12","author":"Vander-Zanden","year":"1987","journal-title":"Informat. Syst."},{"issue":"2","key":"10.1016\/0169-023X(93)90002-7_BIB27","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1145\/78922.78925","article-title":"A linear-time probabilistic counting algorithm for database applications","volume":"15","author":"Whang","year":"1990","journal-title":"ACM TODS"},{"issue":"4","key":"10.1016\/0169-023X(93)90002-7_BIB28","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":"Commun. ACM"}],"container-title":["Data &amp; Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X93900027?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X93900027?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T15:50:40Z","timestamp":1553615440000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0169023X93900027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["0169023X93900027"],"URL":"https:\/\/doi.org\/10.1016\/0169-023x(93)90002-7","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}