An effective spatial join method for blockchain-based geospatial data using hierarchical quadrant spatial LSM+ tree.
Saved in:
| Title: | An effective spatial join method for blockchain-based geospatial data using hierarchical quadrant spatial LSM+ tree. |
|---|---|
| Authors: | Lee, Junghyun1 (AUTHOR), Kwon, Taehyeon1 (AUTHOR), Jung, Sungwon1 (AUTHOR) jungsung@sogang.ac.kr |
| Source: | Journal of Supercomputing. Aug2024, Vol. 80 Issue 12, p17492-17523. 32p. |
| Subjects: | Cadastral maps, Forgery prevention, Spatial filters, Blockchains, Real estate business, Geospatial data |
| Abstract: | The prevention of forgery and alternation of important data of blockchain technology is contributing widely to the expanding usage of this technology to areas and industries such as real estate and agriculture. Despite the high utilization of the blockchain, its write-intensive feature causes a large amount of disk I/Os when trying to index and process queries over the data. Among previous studies, the hierarchical quadrant spatial LSM tree (i.e., HQ-sLSM tree) was proposed as an effective structure to index large amounts of geospatial point data from the blockchain and process queries while triggering a low number of disk I/Os. However, geospatial data exist in forms such as lines and polygons inside cadastral maps and survey information. In this paper, we propose an extended version of the HQ-sLSM tree which indexes geospatial line and polygon data. The extended tree, named the HQ-sLSM + tree, inherits and adapts some common features and the low disk I/O algorithms of the original HQ-sLSM tree, fitting them to the line and polygon data types. Furthermore, an algorithm to process the spatial join query over two HQ-sLSM + trees is proposed. A concept of a spatial join filter is introduced to access disk components efficiently. Experiments confirmed that the number of disk I/Os triggered when spatially joining two HQ-sLSM + trees was much less compared to existing baseline index trees such as the R-tree and the LSM R-tree. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | The prevention of forgery and alternation of important data of blockchain technology is contributing widely to the expanding usage of this technology to areas and industries such as real estate and agriculture. Despite the high utilization of the blockchain, its write-intensive feature causes a large amount of disk I/Os when trying to index and process queries over the data. Among previous studies, the hierarchical quadrant spatial LSM tree (i.e., HQ-sLSM tree) was proposed as an effective structure to index large amounts of geospatial point data from the blockchain and process queries while triggering a low number of disk I/Os. However, geospatial data exist in forms such as lines and polygons inside cadastral maps and survey information. In this paper, we propose an extended version of the HQ-sLSM tree which indexes geospatial line and polygon data. The extended tree, named the HQ-sLSM + tree, inherits and adapts some common features and the low disk I/O algorithms of the original HQ-sLSM tree, fitting them to the line and polygon data types. Furthermore, an algorithm to process the spatial join query over two HQ-sLSM + trees is proposed. A concept of a spatial join filter is introduced to access disk components efficiently. Experiments confirmed that the number of disk I/Os triggered when spatially joining two HQ-sLSM + trees was much less compared to existing baseline index trees such as the R-tree and the LSM R-tree. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 09208542 |
| DOI: | 10.1007/s11227-024-06134-5 |
