Presentation Type

Oral Presentation

Start Date

5-8-2024 1:00 PM

End Date

5-8-2024 3:00 PM

Subjects

Database management, Access Control

Advisor

Primal Pappachan

Student Level

Doctoral

Abstract

Fine-grained access Control (FGAC) in DBMS is vital for restricting user access to authorized data and enhancing security. FGAC policies govern how users are granted access to specific resources based on detailed criteria, ensuring security and privacy measures. Traditional methods struggle with scaling policies to thousands, causing delays in query responses. This paper introduces a novel caching algorithm designed to address this challenge by accelerating query processing and ensuring compliance with FGAC policies. In our approach, we create a circular hashmap and employ different replacement techniques to efficiently manage the cache, prioritizing entries that are visited more frequently. To evaluate the effectiveness of our proposed solution, we developed a workload generator that simulates a smart campus environment. The workloads are used to assess the performance of our caching technique against existing approaches. Our preliminary results indicate that the proposed caching algorithm is promising in terms of query response times while maintaining strict policy compliance and minimal space overhead. This advancement represents a significant step forward in the development of scalable and efficient FGAC enforcement mechanisms within DBMS, promising enhanced data security and user satisfaction in demanding scenarios.

Share

COinS
 
May 8th, 1:00 PM May 8th, 3:00 PM

A Novel Caching Algorithm for Efficient Fine-Grained Access Control in Database Management Systems

Fine-grained access Control (FGAC) in DBMS is vital for restricting user access to authorized data and enhancing security. FGAC policies govern how users are granted access to specific resources based on detailed criteria, ensuring security and privacy measures. Traditional methods struggle with scaling policies to thousands, causing delays in query responses. This paper introduces a novel caching algorithm designed to address this challenge by accelerating query processing and ensuring compliance with FGAC policies. In our approach, we create a circular hashmap and employ different replacement techniques to efficiently manage the cache, prioritizing entries that are visited more frequently. To evaluate the effectiveness of our proposed solution, we developed a workload generator that simulates a smart campus environment. The workloads are used to assess the performance of our caching technique against existing approaches. Our preliminary results indicate that the proposed caching algorithm is promising in terms of query response times while maintaining strict policy compliance and minimal space overhead. This advancement represents a significant step forward in the development of scalable and efficient FGAC enforcement mechanisms within DBMS, promising enhanced data security and user satisfaction in demanding scenarios.