{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:25:40Z","timestamp":1648902340282},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowledge and Information Systems"],"published-print":{"date-parts":[[1999,11]]},"DOI":"10.1007\/bf03325111","type":"journal-article","created":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T22:40:09Z","timestamp":1374792009000},"page":"481-514","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Join Processing Using Partial Precomputation"],"prefix":"10.1007","volume":"1","author":[{"given":"Kian-Lee","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng Hian","family":"Goh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mong Li","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beng Chin","family":"Ooi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,7,13]]},"reference":[{"key":"BF03325111_CR1","unstructured":"N. Beckmann, H. Kriegel, R. Schneider, B. Seeger. The r*-tree: An efficient and robust access method for points and rectangles. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, Atlantic City, N.J., 1990, pp. 322\u2013331."},{"key":"BF03325111_CR2","doi-asserted-by":"crossref","unstructured":"T. Brinkhoff, H. Kriegel, R. Schneider, B. Seeger. Multi-step processing of spatial joins. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, Minneapolis, Minnesota, 1994, pp. 197\u2013208.","DOI":"10.1145\/191843.191880"},{"key":"BF03325111_CR3","doi-asserted-by":"crossref","unstructured":"T. Brinkhoff, H. Kriegel, B. Seeger. Efficient processing of spatial joins using r-trees. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, Washington DC, 1993, pp. 237\u2013246.","DOI":"10.1145\/170036.170075"},{"key":"BF03325111_CR4","volume-title":"Decision support, data warehousing, and olap","author":"S Chauduri","year":"1996","unstructured":"S. Chauduri, U. Dayal. Decision support, data warehousing, and olap. In: Tutorial Notes of Intl. Conf. on Very Large Data Bases, Mumbay, India, 1996."},{"key":"BF03325111_CR5","doi-asserted-by":"crossref","unstructured":"D. DeWitt, R. Katz, F. Olken, L. Shapiro, M. Stonebraker, D. Wood. Implementation techniques for main memory database systems. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, Boston, NY, June 1984, pp. 1\u20138.","DOI":"10.1145\/971697.602261"},{"key":"BF03325111_CR6","doi-asserted-by":"crossref","unstructured":"P. Goyal, H. F. Li, E. Regener, F. Sadri. Scheduling of page fetches in join operations using bc-trees. In: Proc. 3rd International Conference on Data Engineering, 1988, pp. 304\u2013310.","DOI":"10.1109\/ICDE.1988.105473"},{"key":"BF03325111_CR7","doi-asserted-by":"crossref","unstructured":"O. Guenther. Efficient computation of spatial joins. In: Proc. 9th Int. Conf. on Data Engineering, Vienna, Austria, 1993, pp. 50\u201359.","DOI":"10.1109\/ICDE.1993.344078"},{"key":"BF03325111_CR8","unstructured":"A. Guttman. R-trees: A dynamic index structure for spatial searching. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, Boston, MA, 1984, pp. 47\u201357."},{"key":"BF03325111_CR9","doi-asserted-by":"crossref","unstructured":"M-L. Lo, C.V. Ravishankar. Spatial joins using seeded trees. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, Minneapolis, Minnesota, 1994, pp. 209\u2013220.","DOI":"10.1145\/191843.191881"},{"key":"BF03325111_CR10","doi-asserted-by":"crossref","unstructured":"M-L. Lo, C.V. Ravishankar. Spatial hash-joins. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, Montreal, Canada, 1996, pp. 247\u2013258.","DOI":"10.1145\/235968.233337"},{"key":"BF03325111_CR11","unstructured":"H. Lu, R. Luo, B.C. Ooi. Spatial joins by precomputation of approximation. In: Proc. 6th Australasian Database Conference, Glenelg, South Australia, 1995, pp. 132\u2013142."},{"key":"BF03325111_CR12","unstructured":"H. Lu, B.C. Ooi, K.L. Tan. On spatially partitioned temporal joins. In: Proc. 20th Int\u2019l. Conf. on Very Large Data Bases, Santiago, Chile, August 1994, pp. 546\u2013557."},{"key":"BF03325111_CR13","unstructured":"W. Lu, J. Han. Distance-associated join indices for spatial range search. In: Proc. 9th Int. Conf. on Data Engineering, Vienna, Austria, 1992, pp. 284\u2013292."},{"issue":"1","key":"BF03325111_CR14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/128762.128764","volume":"24","author":"P Mishra","year":"1992","unstructured":"P. Mishra, M. Eich. Join processing in relational databases,: ACM Computing Surveys 24(1): 63\u2013113, March 1992.","journal-title":"ACM Computing Surveys"},{"key":"BF03325111_CR15","unstructured":"M. Murphy, D. Rotem. Effective resource utilization for multiprocessor join execution. In: Proc. Intl. Conf. on Very Large Data Bases, Amsterdam, 1989, pp. 67\u201376."},{"key":"BF03325111_CR16","doi-asserted-by":"crossref","unstructured":"M. Murphy, D. Rotem. Processor scheduling for multiprocessor joins. In: Proc. Fifth International Conference on Data Engineering, Los Angeles, California, 1989, pp. 140\u2013148,.","DOI":"10.1109\/ICDE.1989.47209"},{"issue":"3","key":"BF03325111_CR17","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1145\/1270.1285","volume":"9","author":"J Nievergelt","year":"1984","unstructured":"J. Nievergelt, H. Hinterberger, K.C. Sevcik. The grid file: An adaptable, symmetric multikey file structure, ACM Transactions on Database Systems 9(3):369\u2013391, 1984.","journal-title":"ACM Transactions on Database Systems"},{"key":"BF03325111_CR18","first-page":"92","volume-title":"Topological relations in the world of minimum bounding rectangles: A study with r-trees","author":"D Papadias","year":"1995","unstructured":"D. Papadias, Y. Theodoridis, T. Sellis, M.J. Egenhofer. Topological relations in the world of minimum bounding rectangles: A study with r-trees. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, San Jose, California, 1995, pp. 92\u2013103."},{"key":"BF03325111_CR19","doi-asserted-by":"crossref","unstructured":"J.M. Patel, D. DeWitt. Partition-based spatial merge join. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, Montreal, Canada, 1996, pp. 259\u2013270.","DOI":"10.1145\/235968.233338"},{"key":"BF03325111_CR20","unstructured":"D. Rotem. Spatial join indices. In: Proc. Int. Conf. on Data Engineering, Kobe, Japan, 1991, pp.500\u2013509."},{"key":"BF03325111_CR21","unstructured":"T. Sellis, N. Roussopoulos, C. Faloutsos. The r+-tree: A dynamic index for multidimensional objects. In: Proc. Int\u2019l. Conf. on Very Large Data Bases, Brighton, England, 1987, pp. 507\u2013518."},{"issue":"2","key":"BF03325111_CR22","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1145\/114325.103713","volume":"16","author":"D Shasha","year":"1991","unstructured":"D. Shasha, T-L. Wang. Optimizing equijoin queries in distributed databases where relations are hash partitioned, ACM Transactions on Database Systems 16(2):279\u2013308, 1991.","journal-title":"ACM Transactions on Database Systems"},{"issue":"2","key":"BF03325111_CR23","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/22952.22955","volume":"12","author":"P Valduriez","year":"1987","unstructured":"P. Valduriez. Join indices, ACM Transactions on Database Systems 12(2):218\u2013246, 1987.","journal-title":"ACM Transactions on Database Systems"},{"key":"BF03325111_CR24","unstructured":"G. K. Zipf. Human Behaviour and the Principle of Least Effort, Addison-Wesley, 1949."}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03325111.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03325111\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03325111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T16:22:13Z","timestamp":1563553333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03325111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["BF03325111"],"URL":"https:\/\/doi.org\/10.1007\/bf03325111","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}