{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:54:47Z","timestamp":1648612487266},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"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":[[2001,6]]},"DOI":"10.1016\/s0169-023x(01)00009-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:04:50Z","timestamp":1027634690000},"page":"267-284","source":"Crossref","is-referenced-by-count":0,"title":["Page access scheduling in join processing"],"prefix":"10.1016","volume":"37","author":[{"given":"Andrew","family":"Lim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwan","family":"Lai Pheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oon","family":"Wee Chong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0169-023X(01)00009-X_BIB1","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1147\/sj.164.0363","article-title":"Storage and access in relational data bases","volume":"16","author":"Blasgen","year":"1977","journal-title":"IBM Systems Journal"},{"key":"10.1016\/S0169-023X(01)00009-X_BIB2","unstructured":"C.Y. Chan, B.C. Ooi, Efficient scheduling of page access in join processing, Unpublished manuscript, http:\/\/www.comp.nus.edu.sg\/\u223cooibc\/papers\/join.ps, April 1995"},{"issue":"6","key":"10.1016\/S0169-023X(01)00009-X_BIB3","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1109\/69.649322","article-title":"Efficient scheduling of page access in index-based join processing","volume":"9","author":"Chan","year":"1997","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"3","key":"10.1016\/S0169-023X(01)00009-X_BIB4","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1109\/69.87978","article-title":"Optimal secondary storage access sequence for performing relational join","volume":"1","author":"Fotouhi","year":"1989","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"10.1016\/S0169-023X(01)00009-X_BIB5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/152610.152611","article-title":"Query evaluation techniques for large databases","volume":"25","author":"Graefe","year":"1993","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/S0169-023X(01)00009-X_BIB6","unstructured":"A. Lim, W.C. Oon, C. Chi, A matching based algorithm for page access sequencing in join processing, to appear in Journal of Systems and Software"},{"issue":"1","key":"10.1016\/S0169-023X(01)00009-X_BIB7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/128762.128764","article-title":"Join processing in relational databases","volume":"24","author":"Mishra","year":"1992","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"10.1016\/S0169-023X(01)00009-X_BIB8","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/32.21722","article-title":"Heuristics for join processing using nonclustered indexes","volume":"15","author":"Omiecinski","year":"1989","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"1","key":"10.1016\/S0169-023X(01)00009-X_BIB9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/3148.3325","article-title":"Use of graph-theoretic models for optimal relational database accesses to perform join","volume":"10","author":"Pramanik","year":"1985","journal-title":"ACM Transactions on Database Systems"},{"key":"10.1016\/S0169-023X(01)00009-X_BIB10","series-title":"Database Management Systems","author":"Ramakrishnan","year":"1997"},{"key":"10.1016\/S0169-023X(01)00009-X_BIB11","doi-asserted-by":"crossref","unstructured":"P.G. Selinger, M.M. Astrahan, D.D. Chamberlain, R.A. Lorie, T.G. Price, Access path selection in a relational database management system, in: Proceedings of the ACM-SIGMOD 1979 International Conference on Management of Data, pp. 23\u201334","DOI":"10.1145\/582095.582099"},{"issue":"1","key":"10.1016\/S0169-023X(01)00009-X_BIB12","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1145\/263867.263872","article-title":"A simple min-cut algorithm","volume":"44","author":"Stoer","year":"1997","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0169-023X(01)00009-X_BIB13","doi-asserted-by":"crossref","unstructured":"S. Ravada, S. Shekhar, C. Lu, S. Chawla, Optimizing join index based join processing: a graph partitioning approach, in: Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems, 1998, pp. 302\u2013310","DOI":"10.1109\/RELDIS.1998.740513"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X0100009X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X0100009X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T15:54:26Z","timestamp":1555689266000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169023X0100009X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0169023X0100009X"],"URL":"https:\/\/doi.org\/10.1016\/s0169-023x(01)00009-x","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}