2019
DOI: 10.1109/access.2019.2957346
|View full text |Cite
|
Sign up to set email alerts
|

Overlay Indexes: Efficiently Supporting Aggregate Range Queries and Authenticated Data Structures in Off-the-Shelf Databases

Abstract: Commercial off-the-shelf DataBase Management Systems (DBMSes) are highly optimized to process a wide range of queries by means of carefully designed indexing and query planning. However, many aggregate range queries are usually performed by DBMSes using sequential scans, and certain needs, like storing Authenticated Data Structures (ADS), are not supported at all. Theoretically, these needs could be efficiently fulfilled adopting specific kinds of indexing, which however are normally ruled-out in DBMSes design… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
2

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 55 publications
0
4
0
Order By: Relevance
“…A common blockchain design is to organize transactions into a Merkle tree [39] (but in principle other authenticated data structures can be adopted as well [38], [44]). This data structure is a balanced tree that stores at each leaf the cryptographic hash of the content of the leaf, and at each internal node the hash of its children.…”
Section: Expressing Certificates As Independently Verifiable Documentsmentioning
confidence: 99%
“…A common blockchain design is to organize transactions into a Merkle tree [39] (but in principle other authenticated data structures can be adopted as well [38], [44]). This data structure is a balanced tree that stores at each leaf the cryptographic hash of the content of the leaf, and at each internal node the hash of its children.…”
Section: Expressing Certificates As Independently Verifiable Documentsmentioning
confidence: 99%
“…For the sake of simplicity, in the blockchain, we can assume that a block b is composed of two parts: the body that contains all the valid transactions, and the header. In the body, transactions are usually ordered and stored using an Authenticated Data Structure (ADS) [31][32][33], which efficiently links their content with a cryptographic hash r body . For the sake of simplicity, the header can be summarized as a tuple r p , r body , sec , where r p is the hash of the header of the previous block p (this cryptographically links all blocks to obtain a chain), and sec is security information that provides proof that the block is the result of a consensus among many nodes.…”
Section: Blockchain and Dlt Backgroundmentioning
confidence: 99%
“…A common blockchain design is to organize transactions into a Merkle tree [39] (but in principle other authenticated data structures can be adopted as well [38], [44]). This data structure is a balanced tree that stores at each leaf the cryptographic hash of the content of the leaf, and at each internal node the hash of its children.…”
Section: Expressing Certificates As Independently Verifiable Documentsmentioning
confidence: 99%