11 search results - page 1 / 3 » Computing label-constraint reachability in graph databases |
SIGMOD
2010
ACM
14 years 3 months ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
SIGMOD
2012
ACM
12 years 1 months ago
2012
ACM
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
EDBT
2008
ACM
14 years 11 months ago
2008
ACM
EDBT
2006
ACM
14 years 11 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...
CIKM
2010
Springer
13 years 9 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...