Efficient and Verifiable Dynamic Skyline Queries in Blockchain Networks

Blockchain technology, which eliminates the need for intermediaries or centralized control, offers a decentralized and transparent platform for distributed data storage and exchange. With the widespread application of blockchain, the amount of data stored on blockchain is rapidly increasing. As data is considered a potential commercial resource, it is critical to provide secure data query services in blockchain. In this paper, we focus on the dynamic skyline query, which is important in multi-objective decision-making, and propose a query framework to support efficient query processing and the authentication of dynamic skyline results. The key technique is the authenticated data structure (ADS) called the Grid-based Verkle tree (GV tree). It combines the grid-based index and the vector commitment. The minimum bounding rectangle (MBR) is used as the search key of the ADS. By pruning cells of the grid that are dynamically dominated by a data point, the GV tree filters out non-skyline points in a batch, thereby promoting query efficiency. By using the vector commitment, the GV tree enables the verification that data points are not tampered with using a small-size verification object. We present schemes for GV tree-based dynamic skyline query processing and result verification. We conducted extensive experiments, and the experimental results showed promising results for the query framework.