Privacy Operators for Semantic Graph Databases as Graph Rewriting

Privacy Operators for Semantic Graph Databases as Graph Rewriting

연구 분야: Databases

학회: European Conference on Advances in Databases and Information Systems

Database sanitization allows to share and publish open (linked) data without jeopardizing privacy. During their sanitization, graph databases are transformed following graph transformations that are usually described informally or through ad-hoc processes. This paper is a first effort toward bridging the gap between the rigorous graph rewriting approaches and graph sanitization by providing basic generic graph rewriting operators to serve as a basis for the construction of sanitization mechanisms. As a proof of concept, we formalize two operators, blank node creation and weighted relation randomization, using an algebraic graph rewriting approach that takes into account semantic through the equivalent of WHERE and EXCEPT clauses. We show that these operators can be used to achieve pseudonymity and local differential privacy. Both operators and all related rewriting rules are implemented using the Attributed Graph Grammar System (AGG), providing a concrete tool implementing formal graph rewriting mechanisms to sanitize semantic graph databases.