0.25
0.5
0.75
1.25
1.5
1.75
2
Query-based Linked Data Anonymization
Published on Nov 22, 20182876 Views
We introduce and develop a declarative framework for privacy-preserving Linked Data publishing in which privacy and utility policies are specified as SPARQL queries. Our approach is data-independen
Related categories
Chapter list
Query-based Linked Data Anonymization ISWC 201800:00
Linked Open Data and why anonymize it00:15
Summary - 101:46
Summary - 202:37
Summary - 302:53
Query-based policy specification03:21
Query-based anonymization operators04:40
Delete query for triple deletion05:58
Update query for replacement of IRIs by blank nodes06:10
Problems to be addressed06:35
Our contribution07:16
Illustration by example: Step 1.1 - 108:09
Illustration by example: Step 1.1 - 208:21
Illustration by example: Step 1.1 - 308:38
Illustration by example: Step 1.1 - 408:49
Illustration by example: First result of Step 108:53
Illustration by example: Step 1.2 - 109:07
Illustration by example: Step 1.2 - 209:13
Illustration by example: Step 1.2 - 309:21
Illustration by example: Step 1.2 - 409:35
Illustration by example: Second result of Step 109:45
Result of Step 209:58
Experimental evaluation - 110:14
Experimental evaluation - 211:14
Conclusion11:41
References12:44
Acknowledgements12:50