Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths

    CIKM, pp. 1601-1606, 2013.

    Cited by: 32|Bibtex|Views3|Links
    EI
    Keywords:
    large index spaceonline-search-based methods answerindexing timereachability queryquery timeMore(8+)

    Abstract:

    Answering reachability queries on directed graphs is ubiquitous in many applications involved with graph-shaped data as one of the most fundamental and important operations. However, it is still highly challenging to efficiently process them on large-scale graphs. Transitive-closure-based methods consume prohibitively large index space, a...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments