Document Type

Journal Article

Department/Unit

Department of Computer Science

Title

Structure-Preserving Subgraph Query Services

Language

English

Abstract

A fundamental problem of graph databases is subgraph isomorphism query (a.k.a subgraph query): given a query graph Q and a graph database, it retrieves the graphs Gs from the database that contain Q. Due to the cost of managing massive data coupled with the computational hardness of subgraph isomorphism testing, outsourcing the computations to a third-party provider is an appealing alternative. However, confidentiality has been a critical attribute of Quality of Service (QoS) in query services. To the best of our knowledge, subgraph query services with tunable preservation of privacy of structural information have never been addressed. In this paper, we present the first work on structure-preserving subIso (SPsubIso). A crucial step of our work is to transform subIso — the seminal subgraph isomorphism algorithm (the Ullmann’s algorithm) — into a series of matrix operations. We propose a novel cyclic group based encryption (CGBE) method for private matrix operations. We propose a protocol that involves the query client and static indexes to optimize SPsubIso. We prove that the structural information of both Q and G are preserved under CGBE and analyze the privacy preservation in the presence of the optimizations. Our extensive experiments on both real and synthetic datasets verify that SPsubIso is efficient and the optimizations are effective.

Publication Date

2-3-2015

Source Publication Title

IEEE Transactions on Knowledge and Data Engineering

Volume

27

Issue

8

Start Page

2275

End Page

2290

Publisher

IEEE

DOI

10.1109/TKDE.2015.2399292

Link to Publisher's Edition

https://ieeexplore.ieee.org/document/7029663/

ISSN (print)

1041-4347

This document is currently not available here.

Share

COinS