Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL

Pang, Chaoyi; Dong, Guozhu; Ramamohanarao, Kotagiri

doi:10.1145/1093382.1093384

Cited by 22 publications

(12 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The mandatory implementation of privacy policies must be assured; otherwise organizations may intentionally or unintentionally break their privacy policies in the real time performance. [19] are observed as the most important information privacy preserving models.…”

Section: Fig 2 System Flow Diagram Of Role Based Access Control Modementioning

confidence: 99%

Design of Algorithm for Environment based Dynamic Access Control Model for Database Systems

Ahmad¹,

Ahmad²

2011

IJCA

View full text Add to dashboard Cite

With the fast growing nature of enterprise business especially with the emergence of information technology, we are moving towards the era where database systems have become mandatory for the organizations to implement. Because of this, it has become very important to specify such access control model for the database systems in organizations that must ensure the security of information but at the same time dynamic. Conventionally, access control models stress on pre-defined users for which access level is pre-determined by the database administrator. Considering the need of today's business, that has become borderless, and most of unknown users also attempt to access the information, we present a design algorithm for access control model that can handle for both existing and unknown users of the database. The algorithm deals with three major parts, Environment Check, Roles and Permissions Check and finally the increment and decrement of permissions dynamically.

show abstract

Section: Fig 2 System Flow Diagram Of Role Based Access Control Modementioning

confidence: 99%

Design of Algorithm for Environment based Dynamic Access Control Model for Database Systems

Ahmad¹,

Ahmad²

2011

IJCA

View full text Add to dashboard Cite

show abstract

“…In database research, incremental computing queries or graph problems have gained great attentions recently [8].…”

Section: Introductionmentioning

confidence: 99%

Dominating sets in directed graphs

Pang

Zhang

et al. 2010

Information Sciences

Self Cite

View full text Add to dashboard Cite

“…The method, which is extended from [16], is efficient and supports a wide range of updates on roles.…”

Section: Introductionmentioning

confidence: 99%

“…They ensure that TC relations are maintainable with at most two consecutive join operations [5,16,17] and can be implemented in SQL.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Managing RBAC states with transitive relations

Pang

Hansen

Maeder

2007

Proceedings of the 2nd ACM Symposium on Information, Computer and Communications Security

Self Cite

View full text Add to dashboard Cite

In this paper, we study the maintenance of role-based access control (RBAC) models in database environments using transitive closure relations. In particular, the algorithms that express and remove redundancy from a component, a RBAC state, and from conflict constraints. The transitive closure relations on a RBAC state specify the reachability among user groups, roles and from user groups to roles. These relations can assist the process of authorization and make some queries easier to answer. Paper [17] shows that the transitive closure relations on a RBAC model can be used to manage and maintain the model's dynamic changes in a simple and efficient way. In this paper, we firstly show that the transitive closure relations are natural byproducts when formulating RBAC components. We then adapt the conventional RBAC model to accord the inherent reachability of a RBAC model. We show that the use of transitive closure relations as the auxiliary relations for the maintenance of a RBAC state alleviates the process of query evaluation, removing redundancy and the description of hierarchies. Thirdly, in the presence of conflict constraints, we explain how conflicts can be expressed, checked and evaluated under the existence of TC relations, in addition to the removal of conflicts redundancy and finding inferred conflicts. Lastly, we briefly discuss the first-order maintenance operations.All the algorithms for the maintenance are first-order algorithms with simple structures and can be implemented in SQL.

show abstract

Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL

Cited by 22 publications

References 25 publications

Design of Algorithm for Environment based Dynamic Access Control Model for Database Systems

Design of Algorithm for Environment based Dynamic Access Control Model for Database Systems

Dominating sets in directed graphs

Managing RBAC states with transitive relations

Contact Info

Product

Resources

About