Skip index: Supporting efficient inter-block queries and query authentication on the blockchain

Decentralized applications, the driving force behind the new Web3 paradigm, require continuous access to blockchain data. Their adoption, however, is hindered by the constantly increasing size of blockchains and the sequential scan nature of their read operations, which introduce a clear inefficiency bottleneck. Also, the growing amount of data recorded on the blockchain makes resource-constrained light nodes dependent on untrusted full nodes for fetching information, with a consequent need for query authentication protocols ensuring result integrity. Motivated by these reasons, in this paper we propose the skip index, an indexing data structure that allows users to quickly retrieve information simultaneously from multiple blocks of a blockchain. Our solution is also designed to be used as an authenticated data structure to guarantee the integrity of query results for light nodes. We discuss the theoretical properties of skip indices, propose efficient algorithms for their construction and querying, and detail their computational complexity. Finally, we assess the effectiveness of our proposal through an experimental evaluation on the Ethereum blockchain. As a reference use case, we focus on the popular CryptoKitties application and simulate a scenario where users seek to retrieve the events generated by the service. Our experimental results suggest that the use of skip indices offers a constant multiplicative speedup, thanks to search times that are at most logarithmic within a chosen search window. This allows to reduce the number of visited blocks by up to two orders of magnitude if compared to the naive sequential approach currently in use. • We propose the skip index, a data structure for efficient blockchain data retrieval. • The skip index provides guarantees about the integrity of query results. • We devise efficient algorithms to construct and query skip indices. • Compared to a sequential scan, skip indices offer a constant multiplicative speedup. • Skip indices experimentally provide a speedup of up to two orders of magnitude.

Authors

Institutions

Publication Details

Journal
Future Generation Computer Systems
Published
2024-10-19
DOI
https://doi.org/10.1016/j.future.2024.107556
Citations
2
Primary Topic
Blockchain Technology Applications and Security
Type
article
Field-Weighted Citation Impact
1.56
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Skip index: Supporting efficient inter-block queries and query authentication on the blockchain

Damiano Di Francesco Maesa, Laura Ricci, Anna Bernasconi, Matteo Loporchio
2 citations
Future Generation Computer Systems
Blockchain Technology Applications and Security
1.56
article

Skip index: Supporting efficient inter-block queries and query authentication on the blockchain

Damiano Di Francesco Maesa, Laura Ricci, Anna Bernasconi, Matteo Loporchio
article en
2 citations

Abstract

Decentralized applications, the driving force behind the new Web3 paradigm, require continuous access to blockchain data. Their adoption, however, is hindered by the constantly increasing size of blockchains and the sequential scan nature of their read operations, which introduce a clear inefficiency bottleneck. Also, the growing amount of data recorded on the blockchain makes resource-constrained light nodes dependent on untrusted full nodes for fetching information, with a consequent need for query authentication protocols ensuring result integrity. Motivated by these reasons, in this paper we propose the skip index, an indexing data structure that allows users to quickly retrieve information simultaneously from multiple blocks of a blockchain. Our solution is also designed to be used as an authenticated data structure to guarantee the integrity of query results for light nodes. We discuss the theoretical properties of skip indices, propose efficient algorithms for their construction and querying, and detail their computational complexity. Finally, we assess the effectiveness of our proposal through an experimental evaluation on the Ethereum blockchain. As a reference use case, we focus on the popular CryptoKitties application and simulate a scenario where users seek to retrieve the events generated by the service. Our experimental results suggest that the use of skip indices offers a constant multiplicative speedup, thanks to search times that are at most logarithmic within a chosen search window. This allows to reduce the number of visited blocks by up to two orders of magnitude if compared to the naive sequential approach currently in use. • We propose the skip index, a data structure for efficient blockchain data retrieval. • The skip index provides guarantees about the integrity of query results. • We devise efficient algorithms to construct and query skip indices. • Compared to a sequential scan, skip indices offer a constant multiplicative speedup. • Skip indices experimentally provide a speedup of up to two orders of magnitude.

Future Generation Computer SystemsVol. 164
University of Pisa (IT)
Openalex Percentile: Top 12%
Blockchain Technology Applications and Security
1.56
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.