$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 ${\tt IFTree}$ $({\tt MIFTree})$ where Merkle hash trees are applied into our Intersection-aware Feature-subgraph Tree $({\tt IFTree})$. ${\tt 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 ( ${\cal VO}$s) and the authentication time are both minimized. Subsequently, the overall response time is minimized. For optimizations, we propose an enhanced authentication method on ${\tt MIFTree}$. Our detailed experiments on both real and synthetic datasets demonstrate that ${\tt MIFTree}$ is clearly more efficient than a baseline method." /> $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 ${\tt IFTree}$ $({\tt MIFTree})$ where Merkle hash trees are applied into our Intersection-aware Feature-subgraph Tree $({\tt IFTree})$. ${\tt 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 ( ${\cal VO}$s) and the authentication time are both minimized. Subsequently, the overall response time is minimized. For optimizations, we propose an enhanced authentication method on ${\tt MIFTree}$. Our detailed experiments on both real and synthetic datasets demonstrate that ${\tt MIFTree}$ is clearly more efficient than a baseline method." /> $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 ${\tt IFTree}$ $({\tt MIFTree})$ where Merkle hash trees are applied into our Intersection-aware Feature-subgraph Tree $({\tt IFTree})$. ${\tt 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 ( ${\cal VO}$s) and the authentication time are both minimized. Subsequently, the overall response time is minimized. For optimizations, we propose an enhanced authentication method on ${\tt MIFTree}$. Our detailed experiments on both real and synthetic datasets demonstrate that ${\tt MIFTree}$ is clearly more efficient than a baseline method." /> Towards Efficient Authenticated Subgraph Query Service in Outsourced Graph Databases
The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - Oct.-Dec. (2014 vol.7)
pp: 696-713
Zhe Fan , Department of Computer Science, Hong Kong Baptist University, China
Yun Peng , Department of Computer Science, Hong Kong Baptist University, China
Byron Choi , Department of Computer Science, Hong Kong Baptist University, China
Jianliang Xu , Department of Computer Science, Hong Kong Baptist University, China
Sourav S. Bhowmick , School of Computer Engineering, Nanyang Technological University, Singapore
ABSTRACT
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 ${\tt IFTree}$ $({\tt MIFTree})$ where Merkle hash trees are applied into our Intersection-aware Feature-subgraph Tree $({\tt IFTree})$. ${\tt 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 ( ${\cal VO}$s) and the authentication time are both minimized. Subsequently, the overall response time is minimized. For optimizations, we propose an enhanced authentication method on ${\tt MIFTree}$. Our detailed experiments on both real and synthetic datasets demonstrate that ${\tt MIFTree}$ is clearly more efficient than a baseline method.
INDEX TERMS
Authentication, Query processing, Quality of service, Public key cryptography, Graphs,outsourced graph databases, Security concerns of service-oriented solutions, service-oriented security enablement at software level, subgraph query service, query answer authentication
CITATION
Zhe Fan, Yun Peng, Byron Choi, Jianliang Xu, Sourav S. Bhowmick, "Towards Efficient Authenticated Subgraph Query Service in Outsourced Graph Databases", IEEE Transactions on Services Computing, vol.7, no. 4, pp. 696-713, Oct.-Dec. 2014, doi:10.1109/TSC.2013.42
59 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool