Department of Computer Science
Towards efficient authenticated subgraph query service in outsourced graph databases
© 2013 IEEE. Graphs are powerful tools suitable for a large variety of applications including chemical databases and the Semantic Web, among others. A fundamental query of graph databases is the subgraph query: given a query graph q, it retrieves the data graphs from a database that contain q. Due to the cost of managing massive data coupled with the computational hardness of subgraph query processing, outsourcing the processing to a third-party service provider is an appealing alternative. However, security properties such as data integrity and the response time are critical Quality of Service (QoS) issues in query services. Unfortunately, to our knowledge, authenticated subgraph query services have not been addressed before. To support the service, we propose Merkle IFTree (MIFTree) where Merkle hash trees are applied into our Intersection-aware Feature-subgraph Tree (IFTree). IFTree aims to minimize I/O in a well-received subgraph query paradigm called the filtering-and-verification framework. The structures that need to be introduced to verification objects (VOs) and the authentication time are both minimized. Subsequently, the overall response time is minimized. For optimizations, we propose an enhanced authentication method on MIFTree. Our detailed experiments on both real and synthetic datasets demonstrate that MIFTree is clearly more efficient than a baseline method.
Outsourced graph databases, Query answer authentication, Security concerns of service-oriented solutions, Service-oriented security enablement at software level, Subgraph query service
Source Publication Title
IEEE Transactions on Services Computing
Institute of Electrical and Electronics Engineers
Link to Publisher's Edition
Fan, Zhe, Yun Peng, Byron Choi, Jianliang Xu, and Sourav S. Bhowmick. "Towards efficient authenticated subgraph query service in outsourced graph databases." IEEE Transactions on Services Computing 7.4 (2014): 696-713.