VLDB 2026 Research / reviewers in the wild / expert
Karen Heart
dblp:165/8883
· DBLP profile ↗
6ranked-venue papers
0as first author
3since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 6 · 3 since 2021Artificial intelligence and machine learning · 2 · 2 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Harmonizing Privacy Regarding Data Retention and PurgingabstractData privacy requirements are a complex and quickly evolving part of the data management domain. Especially in Healthcare (e.g., United States Health Insurance Portability and Accountability Act and Veterans Affairs requirements), there has been a strong emphasis on data privacy and protection. Data storage is governed by multiple sources of policy requirements, including internal policies and legal requirements imposed by external governing organizations. Within a database, a single value can be subject to multiple requirements on how long it must be preserved and when it must be irrecoverably destroyed. This often results in a complex set of overlapping and potentially conflicting policies. Existing storage systems are lacking sufficient support functionality for these critical and evolving rules, making compliance an underdeveloped aspect of data management. As a result, many organizations must implement manual ad-hoc solutions to ensure compliance. As long as organizations depend on manual approaches, there is an increased risk of non-compliance and threat to customer data privacy. Nick Scope, Alexander Rasin, Ben Lenard, Karen Heart, James Wagner |
SSDBM | 4 |
| 2021 | Database Framework for Supporting Retention Policies
Nick Scope, Alexander Rasin, James Wagner, Ben Lenard, Karen Heart |
DEXA (1) | 5 |
| 2021 | Purging Data from Backups by Encryption
Nick Scope, Alexander Rasin, James Wagner, Ben Lenard, Karen Heart |
DEXA (1) | 5 |
| 2020 | DF-Toolkit: Interacting with Low-Level Database StorageabstractApplications in several areas, such as privacy, security, and integrity validation, require direct access to database management system (DBMS) storage. However, relational DBMSes are designed for physical data independence, and thus limit internal storage exposure. Consequently, applications either cannot be enabled or access storage with ad-hoc solutions, such as querying the ROWID (which can expose physical record location within DBMS storage but not within OS storage) or using DBMS "page repair" tools that read and write DBMS data pages directly. Such ad-hoc methods are limited in their capabilities and difficult to program, maintain, and port across various DBMSes. In this demonstration, we showcase DF-Toolkit - a set of tools that provide an abstracted access to the DBMS storage layer. Users will be able to view DBMS storage not accessible through other applications. Examples include unallocated (e.g., deleted) data, index value-pointer pairs, and cached DBMS pages in RAM. Users will also be able to interact with several special-purpose security applications that audit DBMS storage beyond what DBMS vendors support. James Wagner, Alexander Rasin, Karen Heart, Tanu Malik, Jonathan Grier |
Proc. VLDB Endow. | 3 |
| 2018 | Detecting Database File Tampering through Page CarvingabstractDatabase Management Systems (DBMSes) secure data against regular users through defensive mechanisms such as access control, and against privileged users with detection mechanisms such as audit logging. Interestingly, these security mechanisms are built into the DBMS and are thus only useful for monitoring or stopping operations that are executed through the DBMS API. Any access that involves directly modifying database files (at file system level) would, by definition, bypass any and all security layers built into the DBMS itself. In this paper, we propose and evaluate an approach that detects direct modifications to database files that have already bypassed the DBMS and its internal security mechanisms. Our approach applies forensic analysis to first validate database indexes and then compares index state with data in the DBMS tables. We show that indexes are much more difficult to modify and can be further fortified with hashing. Our approach supports most relational DBMSes by leveraging index structures that are already built into the system to detect database storage tampering that would currently remain undetectable. James Wagner, Alexander Rasin, Tanu Malik, Karen Heart, Jacob D. Furst, Jonathan Grier |
EDBT | 4 |
| 2017 | Database Forensic Analysis with DBCarver
James Wagner, Alexander Rasin, Tanu Malik, Karen Heart, Hugo Jehle, Jonathan Grier |
CIDR | 4 |