Overlay Indexes: Efficiently Supporting Aggregate Range Queries and Authenticated Data Structures in Off-the-Shelf Databases
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 stor...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8919979/ |
| _version_ | 1829138185865658368 |
|---|---|
| author | Diego Pennino Maurizio Pizzonia Alessio Papi |
| author_facet | Diego Pennino Maurizio Pizzonia Alessio Papi |
| author_sort | Diego Pennino |
| collection | DOAJ |
| description | 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. We introduce the concept of overlay index: an index that is meant to be stored in a standard database, alongside regular data and managed by regular software, to complement DBMS capabilities. We show a data structure, that we call DB-tree, that realizes an overlay index to support a wide range of custom aggregate range queries as well as ADSes, efficiently. All DB-trees operations can be performed by executing a small number of queries to the DBMS, that can be issued in parallel in one or two query rounds, and involves a logarithmic amount of data. We experimentally evaluate the efficiency of DB-trees showing that our approach is effective, especially if data updates are limited. |
| first_indexed | 2024-12-14T19:13:18Z |
| format | Article |
| id | doaj.art-3932cdf8bd2c48f2b2bfbb8f1d2805bf |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-14T19:13:18Z |
| publishDate | 2019-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-3932cdf8bd2c48f2b2bfbb8f1d2805bf2022-12-21T22:50:40ZengIEEEIEEE Access2169-35362019-01-01717564217567010.1109/ACCESS.2019.29573468919979Overlay Indexes: Efficiently Supporting Aggregate Range Queries and Authenticated Data Structures in Off-the-Shelf DatabasesDiego Pennino0https://orcid.org/0000-0001-5339-4531Maurizio Pizzonia1https://orcid.org/0000-0001-8758-3437Alessio Papi2https://orcid.org/0000-0002-3753-8053Dipartimento di Ingegneria, Sezione Informatica e Automazione, Università degli Studi Roma Tre, Rome, ItalyDipartimento di Ingegneria, Sezione Informatica e Automazione, Università degli Studi Roma Tre, Rome, ItalyDipartimento di Ingegneria, Sezione Informatica e Automazione, Università degli Studi Roma Tre, Rome, ItalyCommercial 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. We introduce the concept of overlay index: an index that is meant to be stored in a standard database, alongside regular data and managed by regular software, to complement DBMS capabilities. We show a data structure, that we call DB-tree, that realizes an overlay index to support a wide range of custom aggregate range queries as well as ADSes, efficiently. All DB-trees operations can be performed by executing a small number of queries to the DBMS, that can be issued in parallel in one or two query rounds, and involves a logarithmic amount of data. We experimentally evaluate the efficiency of DB-trees showing that our approach is effective, especially if data updates are limited.https://ieeexplore.ieee.org/document/8919979/Database systemsindexestree data structuresdata securitycomputational efficiencyaggregated range queries |
| spellingShingle | Diego Pennino Maurizio Pizzonia Alessio Papi Overlay Indexes: Efficiently Supporting Aggregate Range Queries and Authenticated Data Structures in Off-the-Shelf Databases IEEE Access Database systems indexes tree data structures data security computational efficiency aggregated range queries |
| title | Overlay Indexes: Efficiently Supporting Aggregate Range Queries and Authenticated Data Structures in Off-the-Shelf Databases |
| title_full | Overlay Indexes: Efficiently Supporting Aggregate Range Queries and Authenticated Data Structures in Off-the-Shelf Databases |
| title_fullStr | Overlay Indexes: Efficiently Supporting Aggregate Range Queries and Authenticated Data Structures in Off-the-Shelf Databases |
| title_full_unstemmed | Overlay Indexes: Efficiently Supporting Aggregate Range Queries and Authenticated Data Structures in Off-the-Shelf Databases |
| title_short | Overlay Indexes: Efficiently Supporting Aggregate Range Queries and Authenticated Data Structures in Off-the-Shelf Databases |
| title_sort | overlay indexes efficiently supporting aggregate range queries and authenticated data structures in off the shelf databases |
| topic | Database systems indexes tree data structures data security computational efficiency aggregated range queries |
| url | https://ieeexplore.ieee.org/document/8919979/ |
| work_keys_str_mv | AT diegopennino overlayindexesefficientlysupportingaggregaterangequeriesandauthenticateddatastructuresinofftheshelfdatabases AT mauriziopizzonia overlayindexesefficientlysupportingaggregaterangequeriesandauthenticateddatastructuresinofftheshelfdatabases AT alessiopapi overlayindexesefficientlysupportingaggregaterangequeriesandauthenticateddatastructuresinofftheshelfdatabases |