160 search results - page 8 / 32 » Towards effective partition management for large graphs |
ICSE
2008
IEEE-ACM
15 years 10 months ago
2008
IEEE-ACM
Large-scale software development requires coordination within and between very large engineering teams, each of which may be located in different locations and time zones. Numerou...
EDBT
2006
ACM
15 years 10 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
106
click to vote
SIGMOD
2010
ACM
14 years 8 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...
103
click to vote
APWEB
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. XML provides a natural mechanism for representing semistructured and unstructured data. It becomes the basis for encoding a large variety of information, for example, the...
CIKM
2008
Springer
14 years 12 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...