Archivio istituzionale della ricerca dell'Università degli Studi di Palermo
IRIS è il sistema di gestione integrata dei dati della ricerca (persone, pubblicazioni, progetti, attività) adottato dall’Università di Palermo, e ha lo scopo di raccogliere, conservare, documentare, e diffondere ad accesso aperto le informazioni relative alla produzione scientifica degli autori afferenti all’Ateneo.
EnglishWe introduce the notion of reverse-safe data structures. These are data structures that prevent the reconstruction of the data they encode (i.e., they cannot be easily reversed). A data structure D is called z-reverse-safe when there exist at least z datasets with the same set of answers as the ones stored by D. The main challenge is to ensure that D stores as many answers to useful queries as possible, is constructed efficiently, and has size close to the size of the original dataset it encodes. Given a text of length n and an integer z, we propose an algorithm which constructs a z-reverse-safe data structure that has size O(n) and answers pattern matching queries of length at most d optimally, where d is maximal for any such z-reverse-safe data structure. The construction algorithm takes O(n ω log d) time, where ω is the matrix multiplication exponent. We show that, despite the n ω factor, our engineered implementation takes only a few minutes to finish for million-letter texts. We further show that plugging our method in data analysis applications gives insignificant or no data utility loss. Finally, we show how our technique can be extended to support applications under a realistic adversary model.
Bernardini, G., Chen, H., Fici, G., Loukides, G., & Pissis, S. (2020). Reverse-Safe Data Structures for Text Indexing. In G. Blelloch, & I. Finocchi (a cura di), 2020 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) (pp. 199-213). Society for Industrial an Applied Mathematics - SIAM.
| Data di pubblicazione: | 2020 | |
| Titolo: | Reverse-Safe Data Structures for Text Indexing | |
| Autori: | ||
| Citazione: | Bernardini, G., Chen, H., Fici, G., Loukides, G., & Pissis, S. (2020). Reverse-Safe Data Structures for Text Indexing. In G. Blelloch, & I. Finocchi (a cura di), 2020 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) (pp. 199-213). Society for Industrial an Applied Mathematics - SIAM. | |
| Abstract: | We introduce the notion of reverse-safe data structures. These are data structures that prevent the reconstruction of the data they encode (i.e., they cannot be easily reversed). A data structure D is called z-reverse-safe when there exist at least z datasets with the same set of answers as the ones stored by D. The main challenge is to ensure that D stores as many answers to useful queries as possible, is constructed efficiently, and has size close to the size of the original dataset it encodes. Given a text of length n and an integer z, we propose an algorithm which constructs a z-reverse-safe data structure that has size O(n) and answers pattern matching queries of length at most d optimally, where d is maximal for any such z-reverse-safe data structure. The construction algorithm takes O(n ω log d) time, where ω is the matrix multiplication exponent. We show that, despite the n ω factor, our engineered implementation takes only a few minutes to finish for million-letter texts. We further show that plugging our method in data analysis applications gives insignificant or no data utility loss. Finally, we show how our technique can be extended to support applications under a realistic adversary model. | |
| Digital Object Identifier (DOI): | 10.1137/1.9781611976007.16 | |
| Settore Scientifico Disciplinare: | Settore INF/01 - Informatica Settore ING-INF/05 - Sistemi Di Elaborazione Delle Informazioni | |
| Appare nelle tipologie: | 2.07 Contributo in atti di convegno pubblicato in volume |
File in questo prodotto:
| File | Descrizione | Tipologia | Licenza | |
|---|---|---|---|---|
| Reverse-Safe Data Structures for Text Indexing.pdf | Versione Editoriale | Open Access Visualizza/Apri |
Copyright © 2021