Datenschutzerklärung|Data Privacy
Impressum

15.11.2011
A. Borusan

12.12.2011, 4:00 PM, Humboldt-Kabinett im Institut fĂĽr Informatik (HU Berlin), Rudower Chaussee 25, 12489 Berlin: "Some Results in Graph Data Management" (Prof. Tamer Ozsu, University of Waterloo)

Graphs have always been important data types for database researchers. With the recent growth of social networks, Wikipedia, Linked Data, RDF, and other networks, the interest in managing very large graphs have again gained momentum. I will summarize some of our recent work in this area, focusing on two results: anonymization of published (social) network data, and answering SPARQL queries over RDF graphs. The first problem deals with the release of (social) network data for analysis without releasing confidential identity information. In this research, we propose k-automorphismto protect against multiple structural attacks and develop an algorithm that ensures k-automorphism. The second problem focuses on evaluating SPARQL queries with wildcards over an RDF graph that sees frequent updates. We propose an approach that maps both the RDF data and the SPARQL query into graphs and converts the query evaluation problem to one of subgraph matching. In order to speed up query processing, we propose an indexing mechanism and pruning rules to reduce the search space.