History in Data Structures: Faster Data Structures Through History Independence and Adaptivity
Guardat en:
| Publicat a: | ProQuest Dissertations and Theses (2025) |
|---|---|
| Autor principal: | |
| Publicat: |
ProQuest Dissertations & Theses
|
| Matèries: | |
| Accés en línia: | Citation/Abstract Full Text - PDF |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3257335370 | ||
| 003 | UK-CbPIL | ||
| 020 | |a 9798297604988 | ||
| 035 | |a 3257335370 | ||
| 045 | 2 | |b d20250101 |b d20251231 | |
| 084 | |a 66569 |2 nlm | ||
| 100 | 1 | |a Komlos, Hanna | |
| 245 | 1 | |a History in Data Structures: Faster Data Structures Through History Independence and Adaptivity | |
| 260 | |b ProQuest Dissertations & Theses |c 2025 | ||
| 513 | |a Dissertation/Thesis | ||
| 520 | 3 | |a A key feature of dynamic data structures is that they must continually respond to a sequence of update operations (e.g., insertions/deletions) and maintain their ability to answer queries correctly, ideally while minimizing the cost of executing these changes. This dissertation examines the different ways that data structures interact with this history of operations that they experience. We view this through two lenses: the role of the history in the algorithmic choices that the data structure makes, and the reflection of the history in the data structure’s memory contents.With the classical security notion of history independence, data structures obscure their history of operations in order to safeguard information from adversaries. By enforcing that the memory representation of the data structure is independent of this history, the data structure ensures that even by gaining access to its entire memory representation, a malicious actor cannot discern any additional information, e.g., the order in which operations were executed or whether data was stored in the structure and later deleted. This work enhances the study of this property in two ways. First, we expand the types of data structures that can be made history independent with efficient and natural constructions, particularly in external memory. Second, we use history independence in a novel way as an algorithmic tool to achieve improved upper bounds, whereas it had previously been employed almost entirely to provide security guarantees. Subsequently, we present a data structure which in contrast, exploits and adapts to the history in order to effectively predict future operations, resulting in further algorithmic improvements. | |
| 653 | |a Computer science | ||
| 653 | |a Computer engineering | ||
| 653 | |a Electrical engineering | ||
| 773 | 0 | |t ProQuest Dissertations and Theses |g (2025) | |
| 786 | 0 | |d ProQuest |t ProQuest Dissertations & Theses Global | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3257335370/abstract/embedded/6A8EOT78XXH2IG52?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3257335370/fulltextPDF/embedded/6A8EOT78XXH2IG52?source=fedsrch |