Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Field |
|---|---|---|
2018 | WISE | Data mining,Data structure,Enterprise system,Data processing,Random graph,Computer science,Computer data storage,Tree (data structure),Data management,Sequential access |
DocType | Citations | PageRank |
Conference | 1 | 0.35 |
References | Authors | |
11 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ildar Nurgaliev | 1 | 1 | 0.35 |
| Muhammad Muzammal | 2 | 75 | 10.59 |
| Qiang Qu | 3 | 6 | 4.18 |