Back to Search
Start Over
Efficient Answering of Why-Not Questions in Similar Graph Matching
- Source :
- ICDE
- Publication Year :
- 2015
- Publisher :
- Institute of Electrical and Electronics Engineers (IEEE), 2015.
-
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.
- Subjects :
- Factor-critical graph
Theoretical computer science
Matching (graph theory)
Computer science
Data management
Comparability graph
02 engineering and technology
Strength of a graph
computer.software_genre
Simplex graph
law.invention
Graph power
law
020204 information systems
Line graph
Clique-width
0202 electrical engineering, electronic engineering, information engineering
Graph property
Complement graph
Distance-hereditary graph
Discrete mathematics
Wait-for graph
Information retrieval
Graph database
business.industry
Voltage graph
Approximation algorithm
Quartic graph
Data structure
Graph
Computer Science Applications
Graph bandwidth
Computational Theory and Mathematics
Bounded function
Graph (abstract data type)
business
Null graph
computer
Distance
MathematicsofComputing_DISCRETEMATHEMATICS
Information Systems
Subjects
Details
- ISSN :
- 10414347
- Volume :
- 27
- Database :
- OpenAIRE
- Journal :
- IEEE Transactions on Knowledge and Data Engineering
- Accession number :
- edsair.doi.dedup.....4c9a8a3d2f512e30cebd2b99b2f22f5f