909 search results - page 45 / 182 » Performance Evaluation of the VF Graph Matching Algorithm |
108
click to vote
SBBD
2003
15 years 2 months ago
2003
A common requirement of many scientific applications is the ability to process queries involving expensive predicates corresponding to user programs. Optimizing such queries is ha...
135
click to vote
SIGMOD
2010
ACM
14 years 11 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
226
click to vote
ICDE
2009
IEEE
16 years 3 months ago
2009
IEEE
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
117
click to vote
PLILP
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
119
click to vote
DEBS
2010
ACM
14 years 8 months ago
2010
ACM
Many XML filtering systems have emerged in recent years identifying XML data that structurally match XPath queries in an efficient way. However, apart from structural matching, it...