{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T15:54:53Z","timestamp":1648569293328},"reference-count":81,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,8,1]],"date-time":"1988-08-01T00:00:00Z","timestamp":586396800000},"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 & Knowledge Engineering"],"published-print":{"date-parts":[[1988,8]]},"DOI":"10.1016\/0169-023x(88)90004-3","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T17:15:20Z","timestamp":1047662120000},"page":"49-61","source":"Crossref","is-referenced-by-count":2,"title":["Issues in relational database performance (invited paper ISDBMS)"],"prefix":"10.1016","volume":"3","author":[{"given":"David A.","family":"Bell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0169-023X(88)90004-3_BIB1","series-title":"Proc ACM SIGMOD Conf.","first-page":"16","article-title":"An Amateur's Introduction to Recursive Query Processing Strategies","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0169-023X(88)90004-3_BIB2","series-title":"Database Performance","volume":"12","year":"1984"},{"key":"10.1016\/0169-023X(88)90004-3_BIB3","doi-asserted-by":"crossref","unstructured":"D.A. Bell and S.M. Deen, Key space compression and handling in PRECI, Computer J. 25 (4) pp. 486\u2013492.","DOI":"10.1093\/comjnl\/25.4.486"},{"issue":"4","key":"10.1016\/0169-023X(88)90004-3_BIB4","doi-asserted-by":"crossref","DOI":"10.1093\/comjnl\/27.4.315","article-title":"Difficult data placement problems","volume":"26","author":"Bell","year":"1984","journal-title":"Computer J."},{"key":"10.1016\/0169-023X(88)90004-3_BIB5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1108\/eb005671","article-title":"Physical record clustering in databases","volume":"13","author":"Bell","year":"1984","journal-title":"Kybernetes"},{"key":"10.1016\/0169-023X(88)90004-3_BIB6","article-title":"Capture and Analysis of Data Placement Requirements","author":"Bell","year":"1986","journal-title":"Pergamon Infotech State-of-the-Art Report in Database Performance"},{"key":"10.1016\/0169-023X(88)90004-3_BIB7","unstructured":"D.A. Bell, D.H.O. Ling and J.B. Grimson, Query optimisation, Deliverable 7(3) ECMAP Project 773B (Available University of Ulster)."},{"key":"10.1016\/0169-023X(88)90004-3_BIB8","doi-asserted-by":"crossref","DOI":"10.1093\/comjnl\/31.3.253","article-title":"Clustering related tuples in databases","author":"Bell","year":"1988","journal-title":"Computer J."},{"key":"10.1016\/0169-023X(88)90004-3_BIB9","unstructured":"D.A. Bell, S. McClean, F. McErlean and P. Stewart, Application of simulated annealing to clustering tuples in databases. to be published in J. American Soc. Inf. Syst."},{"key":"10.1016\/0169-023X(88)90004-3_BIB10","doi-asserted-by":"crossref","DOI":"10.1108\/eb005757","article-title":"Key compression by forbidden zones","volume":"16","author":"Bell","year":"1987","journal-title":"Kybernetes"},{"key":"10.1016\/0169-023X(88)90004-3_BIB11","series-title":"Working Paper on Query Optimisation","author":"Bell","year":"1987"},{"key":"10.1016\/0169-023X(88)90004-3_BIB12","series-title":"Proc. ACM SIGMOD Conf.","first-page":"291","article-title":"Multi-key retrieval from KD trees and quad trees","author":"Beckley","year":"1985"},{"key":"10.1016\/0169-023X(88)90004-3_BIB13","series-title":"Proc. Int. Conf. Foundations of Data Organ","first-page":"320","article-title":"Empirical comparison of associative file structures","author":"Beckley","year":"1985"},{"issue":"7","key":"10.1016\/0169-023X(88)90004-3_BIB14","doi-asserted-by":"crossref","DOI":"10.1145\/362686.362692","article-title":"Space-time trade-offs in hash coding with allowable errors","volume":"13","author":"Bloom","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/0169-023X(88)90004-3_BIB15","doi-asserted-by":"crossref","unstructured":"A.K. Carg and G.C. Gottlieb, Ordering-preserving key transformations, ACM Trans. on DB Systems 11 (2) pp. 213\u2013234.","DOI":"10.1145\/5922.5923"},{"key":"10.1016\/0169-023X(88)90004-3_BIB16","series-title":"Distributed Databases: Principles and Systems","author":"Ceri","year":"1984"},{"key":"10.1016\/0169-023X(88)90004-3_BIB17","series-title":"Proc. SIGMOD Conf.","article-title":"Estimating block transfers and join sizes","author":"Christodoulakis","year":"1983"},{"key":"10.1016\/0169-023X(88)90004-3_BIB18","series-title":"Proc. Eleventh Conf. on VLDB","first-page":"127","article-title":"An evaluation of buffer management strategies for relational database systems","author":"Chou","year":"1985"},{"key":"10.1016\/0169-023X(88)90004-3_BIB19","series-title":"Proc. IEEE Int. Conf. on Data Engineering","first-page":"270","article-title":"An extension of access paths to improve joins and selections","author":"Cheiney","year":"1986"},{"key":"10.1016\/0169-023X(88)90004-3_BIB20","year":"1986"},{"key":"10.1016\/0169-023X(88)90004-3_BIB21","series-title":"Proc. Eighth SIGMOD Conf.","article-title":"An implementation of impure surrogates","author":"Deen","year":"1982"},{"issue":"2","key":"10.1016\/0169-023X(88)90004-3_BIB22","doi-asserted-by":"crossref","DOI":"10.1145\/984523.984527","article-title":"Fixing pages in a database buffer","volume":"13","author":"Effelsberg","year":"1983","journal-title":"ACM SIGMOD Record"},{"key":"10.1016\/0169-023X(88)90004-3_BIB23","series-title":"Tech. Rep. UCB\/ERC M80\/25","article-title":"Analysis of Distributed Database Processing Strategies","author":"Epstein","year":"1980"},{"key":"10.1016\/0169-023X(88)90004-3_BIB24","series-title":"Proc. IFIP Conf.","article-title":"Placement of records in a file and file allocation in a computer network","author":"Eswaran","year":"1974"},{"key":"10.1016\/0169-023X(88)90004-3_BIB25","doi-asserted-by":"crossref","unstructured":"R. Fagin, J. Nievergelt, N. Pippenger and R.H. Strong, Extendible hashing in a fast access method for dynamic files, ACM Trans on DB Syst. 4 (3) pp. 315\u2013344.","DOI":"10.1145\/320083.320092"},{"key":"10.1016\/0169-023X(88)90004-3_BIB26","series-title":"Proc. Twelfth VLDB Conf.","first-page":"181","article-title":"The idea of de-clustering and its applications","author":"Fang","year":"1986"},{"issue":"1","key":"10.1016\/0169-023X(88)90004-3_BIB27","doi-asserted-by":"crossref","DOI":"10.1016\/0306-4379(78)90017-0","article-title":"Database organisation by clustering methods","volume":"3","author":"Flory","year":"1978","journal-title":"Inf. Syst."},{"key":"10.1016\/0169-023X(88)90004-3_BIB28","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1145\/361573.361578","article-title":"File organisation: the consecutive retrieval property","volume":"15","author":"Ghosh","year":"1972","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/0169-023X(88)90004-3_BIB29","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/356924.356929","article-title":"Logic and databases\u2014a deductive approach","volume":"16","author":"Gallaire","year":"1984","journal-title":"ACM Comp. Surveys"},{"key":"10.1016\/0169-023X(88)90004-3_BIB30","series-title":"Adv. in DB Theory","article-title":"Optimisation in deductive and conventional database systems","author":"Grant","year":"1981"},{"key":"10.1016\/0169-023X(88)90004-3_BIB31","series-title":"Proc. Second ACM SIGMOD Conf.","article-title":"Index selection for self-adaptive database systems","author":"Hammer","year":"1976"},{"key":"10.1016\/0169-023X(88)90004-3_BIB32","series-title":"Proc. Twelfth Conf. VLDB","first-page":"289","article-title":"An observation on database buffering performance metrics","author":"Hagmann","year":"1986"},{"key":"10.1016\/0169-023X(88)90004-3_BIB33","series-title":"Methods of Primary and Secondary Key Selections","author":"Hoffer","year":"1980"},{"key":"10.1016\/0169-023X(88)90004-3_BIB34","article-title":"Optimal performance of inverted files","author":"Hoffer","year":"1981","journal-title":"Oper. Res."},{"key":"10.1016\/0169-023X(88)90004-3_BIB35","series-title":"Proc. Sixth Conf. on VLDB","article-title":"Knowledge-based query processing","author":"Hammer","year":"1980"},{"key":"10.1016\/0169-023X(88)90004-3_BIB36","doi-asserted-by":"crossref","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\/0169-023X(88)90004-3_BIB37","doi-asserted-by":"crossref","DOI":"10.1145\/356924.356928","article-title":"Query optimisations in database systems","volume":"16","author":"Jarke","year":"1984","journal-title":"ACM Comp. Surveys"},{"key":"10.1016\/0169-023X(88)90004-3_BIB38","unstructured":"JACM, Pattern matching in trees, J. ACM."},{"key":"10.1016\/0169-023X(88)90004-3_BIB39","series-title":"Query Processing in Distributed Systems","article-title":"Cannon subexpression isolation in multiple query optimisation","author":"Jarke","year":"1985"},{"key":"10.1016\/0169-023X(88)90004-3_BIB40","series-title":"Proc. IEEE Conf. on Database Engineering","first-page":"671","article-title":"DECIDES: an expert system tool for physical database design","author":"Kao","year":"1986"},{"key":"10.1016\/0169-023X(88)90004-3_BIB41","series-title":"Proc. IEEE Tenth Conf. Data Engineering","first-page":"124","article-title":"Implementation of multi-key extendible hashing as an access method for a relational DBMS","author":"Kelley","year":"1986"},{"key":"10.1016\/0169-023X(88)90004-3_BIB42","first-page":"179","article-title":"A new way to compute the produce and join of relations","volume":"80","author":"Kim","year":"1980"},{"key":"10.1016\/0169-023X(88)90004-3_BIB43","series-title":"Proc. Seventh VLDB Conf.","article-title":"QUIST\u2014a system for semantic optimisation in relational databases","author":"King","year":"1981"},{"issue":"4598","key":"10.1016\/0169-023X(88)90004-3_BIB44","doi-asserted-by":"crossref","DOI":"10.1126\/science.220.4598.671","article-title":"Optimisation by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/0169-023X(88)90004-3_BIB45","series-title":"Query Processing in Distributed Systems","article-title":"Global optimisation of relational queries: a first step","author":"Kim","year":"1985"},{"issue":"3","key":"10.1016\/0169-023X(88)90004-3_BIB46","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1145\/1270.1209","article-title":"System\/U: a database system based on the universal relation assumption","volume":"9","author":"Korth","year":"1984","journal-title":"ACM TODS"},{"key":"10.1016\/0169-023X(88)90004-3_BIB47","doi-asserted-by":"crossref","unstructured":"P.A. Larson, Dynamic hashing, Bit 18, pp. 184\u2013201.","DOI":"10.1007\/BF01931695"},{"key":"10.1016\/0169-023X(88)90004-3_BIB48","series-title":"Proc. Eighth VLDB Conf.","first-page":"300","article-title":"A single-file version of linear hashing with partial expansion","author":"Larson","year":"1982"},{"key":"10.1016\/0169-023X(88)90004-3_BIB49","series-title":"Proc. ACM Seventh SIGMOD Conf.","article-title":"TRIE hashing","author":"Litwin","year":"1981"},{"key":"10.1016\/0169-023X(88)90004-3_BIB50","series-title":"Proc. IEEE Int. Conf. on Data Engineering","first-page":"38","article-title":"The bounded disorder access method","author":"Litwin","year":"1986"},{"key":"10.1016\/0169-023X(88)90004-3_BIB51","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/BF01944474","article-title":"Partial match retrieval for dynamic files","volume":"22","author":"Lloyd","year":"1982","journal-title":"BIT"},{"key":"10.1016\/0169-023X(88)90004-3_BIB52","doi-asserted-by":"crossref","unstructured":"D.B. Lomet, Bounded index exponential hashing, ACM Trans. on DB Syst., 8 (1) pp. 136\u2013165.","DOI":"10.1145\/319830.319837"},{"key":"10.1016\/0169-023X(88)90004-3_BIB53","series-title":"Proc. Int. Conf. in Databases: Improving Usability and Responsiveness","article-title":"Storage allocation for access path minimisation in network structured databases","author":"Malmquist","year":"1978"},{"key":"10.1016\/0169-023X(88)90004-3_BIB54","series-title":"Proc. Twelfth Conf. on VLDB","article-title":"R\u2217 optimiser validation and performance evaluation for distributed queries","author":"Mackert","year":"1986"},{"issue":"6","key":"10.1016\/0169-023X(88)90004-3_BIB55","doi-asserted-by":"crossref","DOI":"10.1063\/1.1699114","article-title":"Equation of state calculation by fast computing machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"J. Chemical Physics"},{"key":"10.1016\/0169-023X(88)90004-3_BIB56","doi-asserted-by":"crossref","first-page":"747","DOI":"10.2307\/1427186","article-title":"Convergence and finite-time behaviour of simulated annealing","volume":"18","author":"Mitra","year":"1986","journal-title":"Adv. Appl. Prob."},{"key":"10.1016\/0169-023X(88)90004-3_BIB57","doi-asserted-by":"crossref","unstructured":"J.K. Mullin, Spiral storage: efficient dynamic hashing with constant performance, Computer J. 28 (3) pp. 330\u2013334.","DOI":"10.1093\/comjnl\/28.3.330"},{"key":"10.1016\/0169-023X(88)90004-3_BIB58","doi-asserted-by":"crossref","unstructured":"J. Nievergelt, H. Hinterberger and K.C. Sevick, The grid file: an adaptable multi-key file structure, ACM Trans. on DB Syst. 9 (1) pp. 38\u201376.","DOI":"10.1145\/348.318586"},{"key":"10.1016\/0169-023X(88)90004-3_BIB59","series-title":"Proc. Vienna Conf.","article-title":"Convenient multi-database access from a micro computer","author":"O'Sullivan","year":"1987"},{"key":"10.1016\/0169-023X(88)90004-3_BIB60","series-title":"The Multi-Star System","author":"O'Sullivan","year":"1987"},{"key":"10.1016\/0169-023X(88)90004-3_BIB61_1","doi-asserted-by":"crossref","unstructured":"E.J. Otoo, A multidimensional digital hashing scheme for files with composite keys, Proc. ACM SIGMOD Conf. (85) pp. 214\u2013231.","DOI":"10.1145\/318898.318918"},{"key":"10.1016\/0169-023X(88)90004-3_BIB61_2","first-page":"283","article-title":"Proc. Int. Conf. on Foundations Database Organistion","author":"Otoo","year":"1985"},{"issue":"2","key":"10.1016\/0169-023X(88)90004-3_BIB62","doi-asserted-by":"crossref","DOI":"10.1145\/984523.984530","article-title":"The optimal selection of secondary indexes is NP-complete","volume":"13","author":"Piatetsky-Shapiro","year":"1983","journal-title":"ACM SIGMOD Record"},{"key":"10.1016\/0169-023X(88)90004-3_BIB63","author":"RTI Ingres cache management","year":"1987","journal-title":"Newsletter"},{"key":"10.1016\/0169-023X(88)90004-3_BIB64","series-title":"Proc. Eleventh Conf. on VLDB","article-title":"Local and global query optimisation mechanisms in relational databases","author":"Satoh","year":"1985"},{"issue":"4","key":"10.1016\/0169-023X(88)90004-3_BIB65","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1145\/7239.7336","article-title":"Buffer management in relational database systems","volume":"11","author":"Sacco","year":"1986","journal-title":"ACM TODS"},{"key":"10.1016\/0169-023X(88)90004-3_BIB66","series-title":"Proc. Fourteenth Conf. on VLDB","article-title":"Index access with a finite buffer","author":"Sacco","year":"1987"},{"issue":"1","key":"10.1016\/0169-023X(88)90004-3_BIB67","article-title":"A clustering algorithm for hierarchical structures","volume":"2","author":"Schkolnick","year":"1977","journal-title":"ACM Trans. on DB Syst."},{"key":"10.1016\/0169-023X(88)90004-3_BIB68","article-title":"The optimal relation of secondary indices for files","volume":"1","author":"Schkolnick","year":"1977","journal-title":"Inf. Systems"},{"key":"10.1016\/0169-023X(88)90004-3_BIB69","series-title":"Proc. SIGMOD Conf.","first-page":"23","article-title":"Access path selection in a relational database management system","author":"Selinger","year":"1979"},{"key":"10.1016\/0169-023X(88)90004-3_BIB70","series-title":"A Scheme for Classifying Deductive Database Interfaces","author":"Shao","year":"1987"},{"key":"10.1016\/0169-023X(88)90004-3_BIB71","article-title":"Operating system requirements for databases","author":"Stonebraker","year":"1980","journal-title":"CACM"},{"key":"10.1016\/0169-023X(88)90004-3_BIB72","series-title":"Database Performance","first-page":"131","article-title":"Performance-oriented database design laboratory","volume":"12","author":"Staniszkis","year":"1984"},{"key":"10.1016\/0169-023X(88)90004-3_BIB73","series-title":"A Tool for Database Design and Reorganisation","author":"Stewart","year":"1987"},{"key":"10.1016\/0169-023X(88)90004-3_BIB74","series-title":"Principles of Database Systems","author":"Ullman","year":"1982"},{"key":"10.1016\/0169-023X(88)90004-3_BIB75","series-title":"proc. ACM Seventh Int. Conf. on VLDB","article-title":"Separability\u2014an approach to physical database design","author":"Whang","year":"1981"},{"key":"10.1016\/0169-023X(88)90004-3_BIB76","series-title":"Proc. Int. Conf. on Foundations of Data Organisation","first-page":"369","article-title":"Index selection in relational databases","author":"Whang","year":"1985"},{"issue":"4","key":"10.1016\/0169-023X(88)90004-3_BIB77","article-title":"Storage considerations in secondary index selections","volume":"4","author":"Yue","year":"1975","journal-title":"Int. J. of Comp. and Inf. Science"},{"issue":"2","key":"10.1016\/0169-023X(88)90004-3_BIB78","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1145\/3857.3861","article-title":"Adaptive record clustering","volume":"10","author":"Yu","year":"1985","journal-title":"ACM Trans. on DB Syst."},{"key":"10.1016\/0169-023X(88)90004-3_BIB79","series-title":"Proc. IEEE Int. Conf. on Data Engineering","first-page":"116","article-title":"Dynamic file for partial match retrieval based on linear hashing","author":"Yuen","year":"1986"},{"key":"10.1016\/0169-023X(88)90004-3_BIB80","series-title":"Int. Conf. on Proc. Foundations of Data Organisation","first-page":"310","article-title":"File organisation performance prediction","author":"Zezula","year":"1985"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X88900043?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X88900043?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T23:36:58Z","timestamp":1584488218000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0169023X88900043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,8]]},"references-count":81,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,8]]}},"alternative-id":["0169023X88900043"],"URL":"https:\/\/doi.org\/10.1016\/0169-023x(88)90004-3","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,8]]}}}