TY - GEN
T1 - Enabling Blockchain for Efficient Spatio-Temporal Query Processing
AU - Nurgaliev, Ildar
AU - Muzammal, Muhammad
AU - Qu, Qiang
N1 - Publisher Copyright:
© 2018, Springer Nature Switzerland AG.
PY - 2018
Y1 - 2018
N2 - Recent interest in blockchain technology has spurred on a host of new applications in a variety of domains including spatio-temporal data management. The reliability and immutability of blockchain in addition to the decentralized trustless data processing offers promising solutions for modern enterprise systems. However, current blockchain proposals do not support spatio-temporal data processing. Further, a block-based sequential access data structure in the blockchain restricts efficient query processing. Therefore, a blockchain system is desirable that not only supports spatio-temporal data management but also provides efficient query processing. In this work, we propose efficient query processing for spatio-temporal blockchain data. We consider a spatio-temporal blockchain that records both time and location attributes for the transactions. The data storage and integrity is maintained by the introduction of a cryptographically signed tree data structure, a variant of Merkle KD-tree, which also supports fast spatial queries. For the temporal attribute, we consider Bitcoin like near uniform block generation and process temporal queries by a block-DAG data structure without the introduction of temporal indexes. For current position verification, we use Merkle-Patricia-Trie. We also propose a random graph model to generate a block-DAG topology for an abstract peer-to-peer network. A comprehensive evaluation demonstrates the applicability and the effectiveness of the proposed approach.
AB - Recent interest in blockchain technology has spurred on a host of new applications in a variety of domains including spatio-temporal data management. The reliability and immutability of blockchain in addition to the decentralized trustless data processing offers promising solutions for modern enterprise systems. However, current blockchain proposals do not support spatio-temporal data processing. Further, a block-based sequential access data structure in the blockchain restricts efficient query processing. Therefore, a blockchain system is desirable that not only supports spatio-temporal data management but also provides efficient query processing. In this work, we propose efficient query processing for spatio-temporal blockchain data. We consider a spatio-temporal blockchain that records both time and location attributes for the transactions. The data storage and integrity is maintained by the introduction of a cryptographically signed tree data structure, a variant of Merkle KD-tree, which also supports fast spatial queries. For the temporal attribute, we consider Bitcoin like near uniform block generation and process temporal queries by a block-DAG data structure without the introduction of temporal indexes. For current position verification, we use Merkle-Patricia-Trie. We also propose a random graph model to generate a block-DAG topology for an abstract peer-to-peer network. A comprehensive evaluation demonstrates the applicability and the effectiveness of the proposed approach.
KW - Block-DAG
KW - Blockchain
KW - Spatio-temporal queries
UR - http://www.scopus.com/inward/record.url?scp=85055786951&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-02922-7_3
DO - 10.1007/978-3-030-02922-7_3
M3 - Conference contribution
AN - SCOPUS:85055786951
SN - 9783030029210
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 36
EP - 51
BT - Web Information Systems Engineering – WISE 2018 - 19th International Conference, 2018, Proceedings
A2 - Paik, Hye-Young
A2 - Wang, Hua
A2 - Zhou, Rui
A2 - Hacid, Hakim
A2 - Cellary, Wojciech
PB - Springer
T2 - 19th International Conference on Web Information Systems Engineering, WISE 2018
Y2 - 12 November 2018 through 15 November 2018
ER -