A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
To support verifiable Boolean range queries, we propose an accumulator-based authenticated data structure that enables dynamic aggregation over arbitrary query attributes. ... We propose a novel framework, called vChain, that alleviates the storage and computing costs of the user and employs verifiable queries to guarantee the results' integrity. ... We proposed the vChain framework to ensure the integrity of Boolean range queries for lightweight users. ...arXiv:1812.02386v1 fatcat:hvtno5byvbafdf5cfjwmwzfmum
We have implemented LineageChain on top of Hyperledger and a blockchain-optimized storage system called ForkBase. ... However, querying data history in existing blockchains can only be done by replaying all transactions. ... Another similar recent work is VChain  , where researchers achieve the integrity of boolean range queries over the historical data on blockchain databases. ...doi:10.1109/glocom.2018.8647221 dblp:conf/globecom/RamaniKBLY18 fatcat:eo4oyusjgra7dicljqrdyqbpa4
As a result, we identify future research challenges with regard to query processing in blockchain systems. ... Due to these altered usage modes involving more complex query types, it is questionable whether today's blockchain systems are prepared for this type of usage and whether such queries can be processed ... .; Xu, J. vChain: Enabling Verifiable Boolean Range Queries over Blockchain Databases. ...doi:10.3390/fi14010001 fatcat:axmnkcheyjegjbbhgr4gv5345i
Public blockchains like Ethereum use Merkle trees to verify transactions received from untrusted servers before applying them to the blockchain. ... We present RAINBLOCK, a new architecture for public blockchains that increases throughput without affecting security. ... Proof range queries over blockchain databases. In Proceedings of the 2019 international of Luck: An Efficient Blockchain Consensus Protocol. ...arXiv:1909.11590v3 fatcat:eufulqbqrjgrrcuescogqfmety
Proceedings of the 2022 International Conference on Management of Data
The proof is about 30kB per verification batch and verifies with a constant time of 300 seconds. Litmus can extend to verify consistency as well. ... To address this issue, we present Litmus, a DBMS that can provide verifiable proofs of transaction correctness and semantic properties including atomicity and serializability. ... However, different from vChain, Litmus targets OLTP transactions on a cloud database, while vChain allows expressive queries on blockchains, where the blocks are immutable (read-only). ...doi:10.1145/3514221.3517851 fatcat:ox74vsiacng6tameuirqtqklta