{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:31:14Z","timestamp":1772119874644,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T00:00:00Z","timestamp":1714348800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T00:00:00Z","timestamp":1714348800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Institute of Information and Communications Technology Planning and Evaluation","award":["2021-0-00180"],"award-info":[{"award-number":["2021-0-00180"]}]},{"name":"Institute of Information and Communications Technology Planning and Evaluation","award":["2021-0-00180"],"award-info":[{"award-number":["2021-0-00180"]}]},{"name":"Institute of Information and Communications Technology Planning and Evaluation","award":["2021-0-00180"],"award-info":[{"award-number":["2021-0-00180"]}]},{"name":"Korea Institute for Advanced of Technology","award":["P0020535"],"award-info":[{"award-number":["P0020535"]}]},{"name":"Korea Institute for Advanced of Technology","award":["P0020535"],"award-info":[{"award-number":["P0020535"]}]},{"name":"Korea Institute for Advanced of Technology","award":["P0020535"],"award-info":[{"award-number":["P0020535"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s11227-024-06134-5","type":"journal-article","created":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T23:09:57Z","timestamp":1714345797000},"page":"17492-17523","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An effective spatial join method for blockchain-based geospatial data using hierarchical quadrant spatial LSM+ tree"],"prefix":"10.1007","volume":"80","author":[{"given":"Junghyun","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taehyeon","family":"Kwon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sungwon","family":"Jung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"6134_CR1","unstructured":"Bal M (2017) Securing property rights in India through distributed ledger technology. Working Papers id:11567, eSocialSciences (2017). https:\/\/ideas.repec.org\/p\/ess\/wpaper\/id11567.html"},{"key":"6134_CR2","unstructured":"KRAS (2014) KRAS, Sejong, Korea. https:\/\/www.kras.go.kr\/"},{"key":"6134_CR3","unstructured":"Land I (2022) Transport: one stop service for korea land use information. http:\/\/www.molit.go.kr\/english\/USR\/BORD0201\/m_28286\/DTL.jsp?id=eng0301 &cate= &mode=view &idx=3090 &key=content &search= &search_regdate_s= &search_regdate_e= &order= &desc=asc &srch_prc_stts= &item_num=0 &search_dept_id= &search_dept_nm= &srch_usr_nm=N &srch_usr_titl=N &srch_usr_ctnt=N &srch_mng_nm=N &old_dept_nm= &search_gbn= &search_section= &source= &search1= &lcmspage=1"},{"key":"6134_CR4","unstructured":"Lantmateriet (2018) Lantmateriet, Gavle, Sweden. https:\/\/www.lantmateriet.se\/en\/"},{"key":"6134_CR5","unstructured":"Samet H (2005) Foundations of multidimensional and metric data structures (the Morgan Kaufmann series in computer graphics and geometric modeling). Morgan Kaufmann Publishers Inc., San Francisco"},{"issue":"2","key":"6134_CR6","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede V, G\u00fcnther O (1998) Multidimensional access methods. ACM Comput Surv 30(2):170\u2013231. https:\/\/doi.org\/10.1145\/280277.280279","journal-title":"ACM Comput Surv"},{"key":"6134_CR7","doi-asserted-by":"publisher","unstructured":"Leinonen H (2016) In: G\u00f3rka J (ed) Decentralised Blockchained and Centralised Real-Time Payment Ledgers: Development Trends and Basic Requirements, pp 236\u2013261. Palgrave Macmillan UK, London. https:\/\/doi.org\/10.1057\/9781137541215_8","DOI":"10.1057\/9781137541215_8"},{"issue":"2014","key":"6134_CR8","first-page":"1","volume":"151","author":"G Wood","year":"2014","unstructured":"Wood G et al (2014) Ethereum: a secure decentralised generalised transaction ledger. Ethereum Project Yellow Paper 151(2014):1\u201332","journal-title":"Ethereum Project Yellow Paper"},{"key":"6134_CR9","unstructured":"Skrodzki M (2019) The k-d tree data structure and a proof for neighborhood computation in expected logarithmic time. arXiv:1903.04936"},{"key":"6134_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R Finkel","year":"1974","unstructured":"Finkel R, Bentley J (1974) Quad trees: a data structure for retrieval on composite keys. Acta Inf 4:1\u20139. https:\/\/doi.org\/10.1007\/BF00288933","journal-title":"Acta Inf"},{"key":"6134_CR11","unstructured":"FOAM (2018) FOAM location. Brooklyn, New York. https:\/\/foam.space"},{"key":"6134_CR12","doi-asserted-by":"publisher","first-page":"118088","DOI":"10.1109\/ACCESS.2023.3326256","volume":"11","author":"J Lee","year":"2023","unstructured":"Lee J, Kwon T, Seo M, Jung S (2023) Hierarchical quadrant spatial lsm tree for indexing blockchain-based geospatial point data. IEEE Access 11:118088\u2013118104. https:\/\/doi.org\/10.1109\/ACCESS.2023.3326256","journal-title":"IEEE Access"},{"issue":"3","key":"6134_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/1069-0115(94)00033-X","volume":"3","author":"E Clementini","year":"1995","unstructured":"Clementini E, Di Felice P (1995) A comparison of methods for representing topological relationships. Inf Sci - Appl 3(3):149\u2013178. https:\/\/doi.org\/10.1016\/1069-0115(94)00033-X","journal-title":"Inf Sci - Appl"},{"issue":"1","key":"6134_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/3355491.3355494","volume":"11","author":"P Bouros","year":"2019","unstructured":"Bouros P, Mamoulis N (2019) Spatial joins: what\u2019s next? SIGSPATIAL Special 11(1):13\u201321. https:\/\/doi.org\/10.1145\/3355491.3355494","journal-title":"SIGSPATIAL Special"},{"key":"6134_CR15","unstructured":"Moon W (2012) Geographic information systems and science (3rd edition) by P. A. Longley, M. F. Goodchild, D. J. Maguire and D. W. Rhind (book review). The Leading Edge (Society of Exploration Geophysicists) 31, 975\u2013976"},{"key":"6134_CR16","unstructured":"Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining. KDD\u201996. AAAI Press, Portland, Oregon, pp 226\u2013231"},{"issue":"4","key":"6134_CR17","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1109\/TKDE.2007.1002","volume":"19","author":"H Cao","year":"2007","unstructured":"Cao H, Mamoulis N, Cheung DW (2007) Discovery of periodic patterns in spatiotemporal sequences. IEEE Trans Knowl Data Eng 19(4):453\u2013467. https:\/\/doi.org\/10.1109\/TKDE.2007.1002","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"6134_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.procs.2011.12.015","volume":"7","author":"H Markram","year":"2011","unstructured":"Markram H, Meier K, Lippert T, Grillner S, Frackowiak R, Dehaene S, Knoll A, Sompolinsky H, Verstreken K, Defelipe J, Grant S, Changeux J-P, Saria A (2011) Introducing the human brain project. Procedia Comput Sci 7:39\u201342. https:\/\/doi.org\/10.1016\/j.procs.2011.12.015","journal-title":"Procedia Comput Sci"},{"key":"6134_CR19","doi-asserted-by":"publisher","unstructured":"Ablimit A, Fusheng W, Joel HS (2012) Towards building a high performance spatial query system for large scale medical imaging data. ACM SIGSPATIAL 7:309\u2013318. https:\/\/doi.org\/10.1145\/2424321.2424361","DOI":"10.1145\/2424321.2424361"},{"issue":"1","key":"6134_CR20","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/1206049.1206056","volume":"32","author":"EH Jacox","year":"2007","unstructured":"Jacox EH, Samet H (2007) Spatial join techniques. ACM Trans Database Syst 32(1):7. https:\/\/doi.org\/10.1145\/1206049.1206056","journal-title":"ACM Trans Database Syst"},{"key":"6134_CR21","doi-asserted-by":"publisher","unstructured":"Mamoulis N (2009) Spatial join. In: Liu L, \u00d6zsu MT (eds) Encyclopedia of database systems, pp 2707\u20132714. Springer, Boston. https:\/\/doi.org\/10.1007\/978-0-387-39940-9_356","DOI":"10.1007\/978-0-387-39940-9_356"},{"key":"6134_CR22","doi-asserted-by":"publisher","unstructured":"Sabek I, Mokbel MF (2017) On spatial joins in mapreduce. In: Proceedings of the 25th ACM SIGSPATIAL international conference on advances in geographic information systems. SIGSPATIAL \u201917. Association for Computing Machinery, New York.https:\/\/doi.org\/10.1145\/3139958.3139967","DOI":"10.1145\/3139958.3139967"},{"key":"6134_CR23","unstructured":"Heyrani-Nobari S, Qu Q, Jensen CS (2017) In-memory spatial join: the data matters! In: International Conference on Extending Database Technology. https:\/\/api.semanticscholar.org\/CorpusID:39365787"},{"issue":"1","key":"6134_CR24","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10707-016-0277-7","volume":"21","author":"M McKenney","year":"2017","unstructured":"McKenney M, Frye R, Dellamano M, Anderson K, Harris J (2017) Multi-core parallelism for plane sweep algorithms as a foundation for GIS operations. Geoinformatica 21(1):151\u2013174","journal-title":"Geoinformatica"},{"issue":"2","key":"6134_CR25","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/170036.170075","volume":"22","author":"T Brinkhoff","year":"1993","unstructured":"Brinkhoff T, Kriegel H-P, Seeger B (1993) Efficient processing of spatial joins using r-trees. SIGMOD Rec 22(2):237\u2013246. https:\/\/doi.org\/10.1145\/170036.170075","journal-title":"SIGMOD Rec"},{"key":"6134_CR26","doi-asserted-by":"publisher","unstructured":"Gurret C, Rigaux P (2000) The sort\/sweep algorithm: a new method for r-tree based spatial joins. In: Proceedings. 12th International Conference on Scientific and Statistica Database Management, pp 153\u2013165. https:\/\/doi.org\/10.1109\/SSDM.2000.869785","DOI":"10.1109\/SSDM.2000.869785"},{"key":"6134_CR27","unstructured":"Huang Y-W, Jing N, Rundensteiner EA (1997) Spatial joins using r-trees: breadth-first traversal with global optimizations. In: Proceedings of the 23rd International Conference on Very Large Data Bases. VLDB \u201997. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp 396\u2013405"},{"key":"6134_CR28","doi-asserted-by":"publisher","unstructured":"Alsubaiee S, Behm A, Borkar V, Heilbron Z, Kim Y-S, Carey MJ, Dreseler M, Li C (2014) Storage management in AsterixDB. Proc VLDB Endow 7(10):841\u2013852. https:\/\/doi.org\/10.14778\/2732951.2732958","DOI":"10.14778\/2732951.2732958"},{"key":"6134_CR29","unstructured":"Kim Y (2016) Transactional and spatial query processing in the big data era. Ph.D. thesis, University of California, Irvine, USA. http:\/\/www.escholarship.org\/uc\/item\/3815k9kz"},{"key":"6134_CR30","doi-asserted-by":"publisher","unstructured":"Shin J, Wang J, Aref WG (2021) The LSM RUM-tree: a log structured merge R-tree for update-intensive spatial workloads. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp 2285\u20132290. https:\/\/doi.org\/10.1109\/ICDE51399.2021.00238","DOI":"10.1109\/ICDE51399.2021.00238"},{"key":"6134_CR31","doi-asserted-by":"publisher","unstructured":"Liu J, Li H, Gao Y, Yu H, Jiang D (2014) A geohash-based index for spatial data management in distributed memory. In: 2014 22nd International Conference on Geoinformatics, pp 1\u20134. https:\/\/doi.org\/10.1109\/GEOINFORMATICS.2014.6950819","DOI":"10.1109\/GEOINFORMATICS.2014.6950819"},{"key":"6134_CR32","doi-asserted-by":"publisher","unstructured":"Wood J, Kim S (2008) Plane sweep algorithm. In: Shekhar S, Xiong H (eds) Encyclopedia of GIS, pp 876\u2013878. Springer, Boston. https:\/\/doi.org\/10.1007\/978-0-387-35973-1_989","DOI":"10.1007\/978-0-387-35973-1_989"},{"issue":"4","key":"6134_CR33","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s002360050048","volume":"33","author":"PE O\u2019Neil","year":"1996","unstructured":"O\u2019Neil PE, Cheng E, Gawlick D, O\u2019Neil EJ (1996) The log-structured merge-tree (LSM-tree). Acta Inform 33(4):351\u2013385. https:\/\/doi.org\/10.1007\/s002360050048","journal-title":"Acta Inform"},{"key":"6134_CR34","unstructured":"OpenStreetMap contributors: Planet dump retrieved from https:\/\/planet.osm.org. https:\/\/www.openstreetmap.org (2017)"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06134-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06134-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06134-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T08:14:21Z","timestamp":1720426461000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06134-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,29]]},"references-count":34,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["6134"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06134-5","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4015693\/v1","asserted-by":"object"}]},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,29]]},"assertion":[{"value":"8 April 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}