22 search results - page 3 / 5 » Answering pattern match queries in large graph databases via... |
SIGMOD
2000
ACM
13 years 10 months ago
2000
ACM
We investigate the problem of using materialized views to answer SQL queries. We focus on modern decision-support queries, which involve joins, arithmetic operations and other (po...
CVPR
2004
IEEE
14 years 8 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
CIKM
2007
Springer
14 years 7 days ago
2007
Springer
Regular path queries (RPQ’s) are given by means of regular expressions and ask for matching patterns on labeled graphs. RPQ’s have received great attention in the context of s...
ICDE
2009
IEEE
14 years 7 months ago
2009
IEEE
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
KDD
2004
ACM
13 years 11 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...