85 search results - page 1 / 17 » Fast and practical indexing and querying of very large graph... |
SIGMOD
2007
ACM
14 years 5 months ago
2007
ACM
CIKM
2010
Springer
13 years 3 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...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
EDBT
2009
ACM
13 years 11 months ago
2009
ACM
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
EDBT
2006
ACM
14 years 5 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...