{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:18:21Z","timestamp":1648923501417},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":["Journal of Systems and Software"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0164-1212(01)00076-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:34:40Z","timestamp":1027578880000},"page":"11-19","source":"Crossref","is-referenced-by-count":0,"title":["A matching-based algorithm for page access sequencing in join processing"],"prefix":"10.1016","volume":"60","author":[{"given":"Andrew","family":"Lim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oon Wee","family":"Chong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi","family":"Chi-Hung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0164-1212(01)00076-0_BIB1","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1109\/32.21741","article-title":"Performance of a composite attribute and join index","volume":"15","author":"Desai","year":"1989","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"1","key":"10.1016\/S0164-1212(01)00076-0_BIB2","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/128762.128764","article-title":"Join processing in relational databases","volume":"24","author":"Mishra","year":"1992","journal-title":"ACM Computing Surveys"},{"issue":"6","key":"10.1016\/S0164-1212(01)00076-0_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":"Ooi","year":"1997","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"10.1016\/S0164-1212(01)00076-0_BIB4","first-page":"19","article-title":"Heuristics for join processing using nonclustered indexes","volume":"15","author":"Omiecinski","year":"1989","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/S0164-1212(01)00076-0_BIB5","unstructured":"The Open University, undated. Networks 3: Assignment and Transportation. The Open University, Walton Hall, Milton Keynes, MK7 6AA"},{"key":"10.1016\/S0164-1212(01)00076-0_BIB6","unstructured":"Papadimitriou, C.H., Steiglitz, K., 1989. Combinatorial Optimization \u2013 Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ 07632, USA, 1989"},{"issue":"2","key":"10.1016\/S0164-1212(01)00076-0_BIB7","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/22952.22955","article-title":"Join indices","volume":"12","author":"Valduriez","year":"1987","journal-title":"ACM Transactions on Database Systems"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121201000760?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121201000760?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T16:59:02Z","timestamp":1556816342000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0164121201000760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0164121201000760"],"URL":"https:\/\/doi.org\/10.1016\/s0164-1212(01)00076-0","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}