7 search results - page 1 / 2 » Substructure Similarity Search in Graph Databases |
162
click to vote
SIGMOD
2005
ACM
16 years 5 months ago
2005
ACM
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
151
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
243
click to vote
SIGMOD
2007
ACM
16 years 5 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
183
click to vote
SIGMOD
2011
ACM
14 years 8 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
223
click to vote
SIGMOD
2008
ACM
16 years 5 months ago
2008
ACM
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...