Enabling Blockchain for Efficient Spatio-Temporal Query Processing

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.

[1]  Qiang Qu,et al.  ChainMOB: Mobility Analytics on Blockchain , 2018, 2018 19th IEEE International Conference on Mobile Data Management (MDM).

[2]  Moni Naor,et al.  Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions , 2018, IACR Cryptol. ePrint Arch..

[3]  Michael Gertz,et al.  A General Model for Authenticated Data Structures , 2004, Algorithmica.

[4]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[5]  Feifei Li,et al.  Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams , 2007, VLDB.

[6]  Fucai Zhou,et al.  Dynamic Fully Homomorphic encryption-based Merkle Tree for lightweight streaming authenticated data structures , 2018, J. Netw. Comput. Appl..

[7]  Christopher N. Eichelberger,et al.  Spatio-temporal indexing in non-relational distributed databases , 2013, 2013 IEEE International Conference on Big Data.

[8]  Cyrus Shahabi,et al.  Spatial Query Integrity with Voronoi Neighbors , 2013, IEEE Transactions on Knowledge and Data Engineering.

[9]  Rajendra Prasad Mahapatra,et al.  Comparative Analysis of Nearest Neighbor Query Processing Techniques , 2015 .

[10]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[11]  Greg Edward Mackey.  Efficient nearest neighbor searches in N-ABLE. , 2010 .

[12]  Timos K. Sellis,et al.  Spatio-temporal indexing for large multimedia applications , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[13]  Bernhard Seeger,et al.  Progressive skyline computation in database systems , 2005, TODS.

[14]  Dimitris Sacharidis,et al.  Partially materialized digest scheme: an efficient verification method for outsourced databases , 2008, The VLDB Journal.

[15]  Qiang Qu,et al.  Renovating blockchain with distributed databases: An open source system , 2019, Future Gener. Comput. Syst..

[16]  Yoad Lewenberg,et al.  Inclusive Block Chain Protocols , 2015, Financial Cryptography.