Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Efficient processing of $$k$$ k -hop reachability queries

Efficient processing of $$k$$ k -hop reachability queries We study the problem of answering k -hop reachability queries in a directed graph, i.e., whether there exists a directed path of length $$k$$ k , from a source query vertex to a target query vertex in the input graph. The problem of $$k$$ k -hop reachability is a general problem of the classic reachability (where $$k=\infty $$ k = ∞ ). Existing indexes for processing classic reachability queries, as well as for processing shortest path distance queries, are not applicable or not efficient for processing $$k$$ k -hop reachability queries. We propose an efficient index for processing $$k$$ k -hop reachability queries. Our experimental results on a wide range of real datasets show that our method is efficient and scalable in terms of both index construction and query processing. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png The VLDB Journal Springer Journals

Efficient processing of $$k$$ k -hop reachability queries

Loading next page...
 
/lp/springer_journal/efficient-processing-of-k-k-hop-reachability-queries-cu0MJ55wa2

References (11)

Publisher
Springer Journals
Copyright
Copyright © 2014 by Springer-Verlag Berlin Heidelberg
Subject
Computer Science; Database Management
ISSN
1066-8888
eISSN
0949-877X
DOI
10.1007/s00778-013-0346-6
Publisher site
See Article on Publisher Site

Abstract

We study the problem of answering k -hop reachability queries in a directed graph, i.e., whether there exists a directed path of length $$k$$ k , from a source query vertex to a target query vertex in the input graph. The problem of $$k$$ k -hop reachability is a general problem of the classic reachability (where $$k=\infty $$ k = ∞ ). Existing indexes for processing classic reachability queries, as well as for processing shortest path distance queries, are not applicable or not efficient for processing $$k$$ k -hop reachability queries. We propose an efficient index for processing $$k$$ k -hop reachability queries. Our experimental results on a wide range of real datasets show that our method is efficient and scalable in terms of both index construction and query processing.

Journal

The VLDB JournalSpringer Journals

Published: Apr 1, 2014

There are no references for this article.