What is it about?
This paper is about improving the speed of searching for data stored on a blockchain. Blockchain systems are very good at preserving data and making it tamper-resistant, but they are not naturally efficient when someone needs to retrieve older historical records. As blockchains grow, finding earlier data can become slow because the data are stored in a sequential, append-only way. The paper introduces a new indexing method called the Ternary Tree Enhanced Append-only Skip List (TEASL). TEASL combines ideas from skip lists and tree structures to create a search index that works efficiently across the whole blockchain, not just for the most recent entries. The result is faster and more balanced retrieval of blockchain data, including historical information.
Featured Image
Photo by Growtika on Unsplash
Why is it important?
This work is important because blockchain is increasingly used in areas such as IoT, healthcare, smart cities, transportation, and supply chains, where data may need to be retrieved quickly and reliably long after it was first written. Many existing blockchain indexing methods show a bias toward recent data, which makes older records slower to find. This paper addresses that problem directly. The proposed TEASL method improves search performance regardless of where the data sit in the blockchain and does so without increasing storage cost. According to the paper, TEASL is the fastest evaluated indexing technique for retrieving blockchain data and was shown to be 85.71% faster than the current fastest alternative while remaining highly storage-efficient. That makes it especially relevant for practical blockchain systems where both performance and resource efficiency matter.
Perspectives
What I find most interesting about this paper is that it focuses on a problem that is easy to overlook: storing blockchain data is only part of the story, because in real systems we also need to retrieve that data efficiently later. I like that this work looks beyond immutability and asks how blockchain can become more useful as a practical data system. The idea of combining an append-only skip list with a ternary tree is elegant because it improves historical data retrieval without sacrificing storage efficiency. I see this as a valuable contribution for blockchain applications that depend on data provenance, auditability, and long-term usability, especially in resource-constrained environments such as IoT and edge systems.
Dr Quazi Mamun
Charles Sturt University
Read the Original
This page is a summary of: Ternary tree enhanced append-only skip list: A high-performance blockchain data search index, Information Sciences, March 2026, Elsevier,
DOI: 10.1016/j.ins.2025.122827.
You can read the full text:
Contributors
The following have contributed to this page
