Multi-Query Optimization for Subgraph Isomorphism Search

No Thumbnail Available
File version
Author(s)
Ren, Xuguang
Wang, Junhu
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2016
Size
File type(s)
Location
License
Abstract

Existing work on subgraph isomorphism search mainly focuses on a-query-at-a-time approaches: Optimizing and answering each query separately. When multiple queries arrive at the same time, sequential processing is not always the most efficient. In this paper, we study multi-query optimization for subgraph isomorphism search. We first propose a novel method for efficiently detecting useful common subgraphs and a data structure to organize them. Then we propose a heuristic algorithm based on the data structure to compute a query execution order so that cached intermediate results can be effectively utilized. To balance memory usage and the time for cached results retrieval, we present a novel structure for caching the intermediate results. We provide strategies to revise existing single-query subgraph isomorphism algorithms to seamlessly utilize the cached results, which leads to significant performance improvement. Extensive experiments verified the effectiveness of our solution.

Journal Title

Proceedings of the VLDB Endowment

Conference Title
Book Title
Edition
Volume

10

Issue

3

Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Theory of computation

Information systems

Library and information studies

Science & Technology

Technology

Computer Science, Information Systems

Computer Science, Theory & Methods

Computer Science

Persistent link to this record
Citation

Ren, X; Wang, J, Multi-Query Optimization for Subgraph Isomorphism Search, Proceedings of the VLDB Endowment, 2016, 10 (3), pp. 121-132

Collections