Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

186

Voted

SIGMOD
2008
ACM

111views Database» more SIGMOD 2008»

Efficiently answering reachability queries on very large directed graphs

16 years 2 months ago

Efficiently answering reachability queries on very large directed graphs

Download www.seas.upenn.edu

Ruoming Jin, Yang Xiang, Ning Ruan, Haixun Wang

Real-time Traffic

Database | Large Directed Graphs | SIGMOD 2008 |

claim paper

Related Content

» Efficient Graph Reachability Query Answering Using Tree Decomposition

» Fast Computation of Reachability Labeling for Large Graphs

» A hierarchical approach to reachability query answering in very large graph databases

» A Uniform Framework for AdHoc Indexes to Answer Reachability Queries on Large Graphs

» GRAIL Scalable Reachability Index for Large Graphs

» SCARAB scaling reachability computation on large graphs

» Dual Labeling Answering Graph Reachability Queries in Constant Time

» 3HOP a highcompression indexing scheme for reachability query

» An Efficient Algorithm for Solving the DyckCFL Reachability Problem on Trees

Post Info
More Details (n/a)

Added	08 Dec 2009
Updated	08 Dec 2009
Type	Conference
Year	2008
Where	SIGMOD
Authors	Ruoming Jin, Yang Xiang, Ning Ruan, Haixun Wang

Comments (0)