Efficient Answering of Why-Not Questions in Similar Graph Matching

No Thumbnail Available
File version
Author(s)
Islam, Md Saiful
Liu, Chengfei
Li, Jianxin
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2016
Size
File type(s)
Location

Helsinki, Finland

License
Abstract

Graph data management and matching similar graphs are very important for many applications including bioinformatics, computer vision, VLSI design, bug localization, road networks, social and communication networking. Many graph indexing and similarity matching techniques have already been proposed for managing and querying graph data. In similar graph matching, a user is returned with the database graphs whose distances with the query graph are below a threshold. In such query settings, a user may not receive certain database graphs that are very similar to the query graph if the initial query graph is inappropriate/imperfect for the expected answer set. To exemplify this, consider a drug designer who is looking for chemical compounds that could be the target of her hypothetical drug before realizing it. In response to her query, the traditional search system may return the structures from the database that are most similar to the query graph. However, she may get surprised if some of the expected targets are missing in the answer set. She may then seek assistance from the system by asking Is there other query graph that can match my expected answer set?. The system may then modify her initial query graph to include the missing answers in the new answer set. Here, we study this kind of problem of answering why-not questions in similar graph matching for graph databases.

Journal Title
Conference Title

2016 IEEE 32nd International Conference on Data Engineering (ICDE)

Book Title
Edition
Volume
Issue
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

Graph, social and multimedia data

Data structures and algorithms

Query processing and optimisation

Science & Technology

Computer Science, Information Systems

Computer Science, Theory & Methods

Engineering, Electrical & Electronic

Persistent link to this record
Citation

Islam, MS; Liu, C; Li, J, Efficient Answering of Why-Not Questions in Similar Graph Matching, 2016 IEEE 32nd International Conference on Data Engineering (ICDE), 2016, pp. 1476-1477