{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:24:58Z","timestamp":1759191898951,"version":"3.44.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,2,10]],"date-time":"1999-02-10T00:00:00Z","timestamp":918604800000},"content-version":"vor","delay-in-days":71,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Data & Knowledge Engineering"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1016\/s0169-023x(98)00025-1","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T12:52:26Z","timestamp":1053348746000},"page":"277-298","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Faster joins, self-joins and multi-way joins using join indices"],"prefix":"10.1016","volume":"28","author":[{"given":"Hui","family":"Lei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth A.","family":"Ross","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0169-023X(98)00025-1_BIB1","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1145\/320107.320125","article-title":"On searching transposed files","volume":"4","author":"Batory","year":"1979","journal-title":"ACM Trans. on Database Systems"},{"key":"10.1016\/S0169-023X(98)00025-1_BIB2","series-title":"Proc. IEEE Intl. Conf. on Data Eng.","first-page":"256","article-title":"Join index, materialized view, and hybrid-hash join: A performance analysis","author":"Blakeley","year":"1990"},{"issue":"4","key":"10.1016\/S0169-023X(98)00025-1_BIB3","doi-asserted-by":"crossref","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(98)00025-1_BIB4","series-title":"Proc. VLDB Conf.","first-page":"323","article-title":"Hashing methods and relational algebra operations","author":"Bratbergsengen","year":"1984"},{"article-title":"Resource allocation and scheduling for mixed database workloads","year":"1992","author":"Brown","key":"10.1016\/S0169-023X(98)00025-1_BIB5"},{"key":"10.1016\/S0169-023X(98)00025-1_BIB6","series-title":"Proc. ACM SIGMOD Conf","first-page":"1","article-title":"Implementation techniques for main memory database systems","author":"DeWitt","year":"1984"},{"article-title":"Performance enhancements for hybrid hash join","year":"1992","author":"Graefe","key":"10.1016\/S0169-023X(98)00025-1_BIB7"},{"issue":"3","key":"10.1016\/S0169-023X(98)00025-1_BIB8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s007780050043","article-title":"Seeking the truth about ad hoc join costs","volume":"6","author":"Haas","year":"1997","journal-title":"VLDB Journal"},{"key":"10.1016\/S0169-023X(98)00025-1_BIB9","series-title":"Proc. ACM SIGMOD Conf.","first-page":"179","article-title":"A new way to compute the product and join of relations","author":"Kim","year":"1980"},{"key":"10.1016\/S0169-023X(98)00025-1_BIB10","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF03037022","article-title":"Application of hash to data base machine and its architecture","volume":"1","author":"Kitsuregawa","year":"1983","journal-title":"New Generation Computing"},{"key":"10.1016\/S0169-023X(98)00025-1_BIB11","article-title":"Sorting and Searching","volume":"Vol. 3","author":"Ervin Knuth","year":"1973"},{"key":"10.1016\/S0169-023X(98)00025-1_BIB12","unstructured":"Z. Li, K. Ross, Fast joins using join indices, VLDB Journal to appear."},{"issue":"1","key":"10.1016\/S0169-023X(98)00025-1_BIB13","doi-asserted-by":"crossref","DOI":"10.1145\/128762.128764","article-title":"Join processing in relational databases","volume":"24","author":"Mishra","year":"1992","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/S0169-023X(98)00025-1_BIB14","series-title":"Proc. Int. Conf. on Extending Data Base Technology","article-title":"Single table access using multiple indexes: Optimization, execution and concurrency control techniques","author":"Mohan","year":"1990"},{"issue":"3","key":"10.1016\/S0169-023X(98)00025-1_BIB15","article-title":"Multi-table joins through bitmapped join indices","volume":"24","author":"O'Neill","year":"1995","journal-title":"SIGMOD Record"},{"issue":"3","key":"10.1016\/S0169-023X(98)00025-1_BIB16","doi-asserted-by":"crossref","DOI":"10.1145\/6314.6315","article-title":"Join processing in database systems with large main memories","volume":"11","author":"Shapiro","year":"1986","journal-title":"ACM Trans. on Database Systems"},{"issue":"2","key":"10.1016\/S0169-023X(98)00025-1_BIB17","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 Trans. on Database Systems"},{"year":"1987","series-title":"The Complexity of Boolean Functions","author":"Wegener","key":"10.1016\/S0169-023X(98)00025-1_BIB18"},{"issue":"4","key":"10.1016\/S0169-023X(98)00025-1_BIB19","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":"Comm. of the ACM"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X98000251?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X98000251?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T21:42:28Z","timestamp":1759182148000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169023X98000251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0169023X98000251"],"URL":"https:\/\/doi.org\/10.1016\/s0169-023x(98)00025-1","relation":{},"ISSN":["0169-023X"],"issn-type":[{"type":"print","value":"0169-023X"}],"subject":[],"published":{"date-parts":[[1998,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Faster joins, self-joins and multi-way joins using join indices","name":"articletitle","label":"Article Title"},{"value":"Data & Knowledge Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0169-023X(98)00025-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}