TEDI: Efficient Shortest Path Query Answering on Graphs

@inproceedings{WeiKleiner2010TEDIES,
  title={TEDI: Efficient Shortest Path Query Answering on Graphs},
  author={Fang Wei-Kleiner},
  booktitle={Graph Data Management},
  year={2010}
}
Efficient shortest path query answering in large graphs is enjoying a growing number of applications, such as ranked keyword search in databases, social networks, ontology reasoning and bioinformatics. A shortest path query on a graph finds the shortest path for the given source and target vertices in the graph. Current techniques for efficient evaluation of such queries are based on the pre-computation of compressed Breadth First Search trees of the graph. However, they suffer from drawbacks… 

TopCom: Index for Shortest Distance Query in Directed Graph

TLDR
This work proposes TopCom, a novel indexing-based solution for exactly answering distance queries in a directed acyclic graph DAG and shows the superiority of TopCom over the existing state-of-the-art methods IS-Label and TreeMap considering scalability and query time.

Fast shortest-path queries on large-scale graphs

TLDR
This paper proposes an efficient shortest-path query algorithm, called BBQ, which reduces the running time of both stages via tree decomposition, and constructs a distance oracle in a bottom-top-bottom manner, which significantly reduces preprocessing time over existing algorithms.

Efficient top-k shortest path query processing in sparse graph databases

TLDR
A pre-computed reachability index is proposed in order to reduce the cost by a factor of O(n) needed to discover each of k single-source shortest paths and it is demonstrated that as k approaches the number of possible paths, the algorithm outperforms contemporary methods.

Relational Approach for Shortest Path Discovery over Large Graphs

TLDR
This paper introduces a relational FEM framework with three corresponding operators to implement graph search tasks in the RDB context with new features such as window function and merge statement introduced by recent SQL standards that can not only simplify the expression but also improve the performance of the F EM framework.

Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks

TLDR
This paper proposes a novel method, Query-by-Sketch (QbS), which efficiently leverages offline labelling to guide online searching through a fast sketching process that summarizes the important structural aspects of shortest paths in answering shortest-path-graph queries and shows that QbS can answer shortest- paths queries in microseconds for million-scale graphs and less than half a second for billion-scale graph queries.

Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement

TLDR
A new extension-based approach is proposed, Monotonic Landmark Labeling (MLL), to reduce the required space cost while still guaranteeing query time and reveal the characteristics of various methods, allowing practitioners to select the appropriate method for a specific application.

Efficient Constrained Shortest Path Query Answering with Forest Hop Labeling

TLDR
This paper proposes a novel skyline path concatenation approach to avoid the expensive skyline path search, which is then used to efficiently construct a 2-hop labeling index for the CSP queries and outperforms the state-of-the-art CSP solutions by several orders of magnitude.

Answering pattern match queries in large graph databases via graph embedding

TLDR
This paper addresses distance-based pattern match queries over a large data graph G by adopting a filter-and-refine framework and finding a set of candidate matches by a graph embedding technique and then evaluating these to find the exact matches.

Efficient computation of distance labeling for decremental updates in large dynamic graphs

TLDR
This paper proposes maintenance algorithms based on distance labeling, which can handle decremental updates efficiently and can speed up index re-computation by up to an order of magnitude compared with the state-of-the-art method, Pruned Landmark Labeling (PLL).

SHORTEST PATH ESTIMATION FOR GRAPH DATA USING A RELATIONAL TECHNIQUE

TLDR
This work presents a system which will find the shortest path between nodes and contribute to performance of the system with the help of different shortest path algorithms such as bidirectional search and AStar algorithm and takes a relational approach using some new standard SQL queries to solve the problem.
...

References

SHOWING 1-10 OF 55 REFERENCES

Efficiently indexing shortest paths by exploiting symmetry in graphs

TLDR
This paper develops a framework to index a large graph at the orbit level instead of the vertex level so that the number of breadth-first search trees materialized is reduced from O(N) to O(|Δ|), where |Δ | ≤ N is the numberof orbits in the graph.

Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data

TLDR
A novel keyword search paradigm for graph-structured data, focusing in particular on the RDF data model, which first compute queries from the keywords, allowing the user to choose the appropriate query, and finally, process the query using the underlying database engine.

Efficiently answering reachability queries on very large directed graphs

TLDR
This paper introduces a novel graph structure, referred to as path-tree, to help labeling very large graphs, which is a spanning subgraph of G in a tree shape and demonstrates both analytically and empirically the effectiveness of the new approaches.

BLINKS: ranked keyword searches on graphs

TLDR
BLINKS follows a search strategy with provable performance bounds, while additionally exploiting a bi-level index for pruning and accelerating the search, and offers orders-of-magnitude performance improvement over existing approaches.

Reachability and distance queries via 2-hop labels

TLDR
The proposed data structure for representing all distances in a graph is distributed in the sense that it may be viewed as assigning labels to the vertices, such that a query involving vertices u and v may be answered using only the labels of u andV.

3-HOP: a high-compression indexing scheme for reachability query

TLDR
A new 3-hop indexing scheme for directed graphs with higher density over dense DAGs with minimum index size is proposed and an efficient algorithm is developed to discover a transitive closure contour, which yields near optimal index size.

Dual Labeling: Answering Graph Reachability Queries in Constant Time

TLDR
This paper proposes a novel labeling scheme for sparse graphs that ensures that graph reachability queries can be answered in constant time, and provides an alternative scheme to tradeoff query time for label space, which further benefits applications that use tree-like graphs.

Fast and practical indexing and querying of very large graphs

TLDR
The GRIPP index structure (GRaph Indexing based on Pre- and Postorder numbering) for answering reachability queries in graphs is presented and can be integrated into existing graph-oriented applications.

On the Efficiency of Querying and Storing RDF Documents

TLDR
The authors have empirically studied the performance of the Bhyper based techniques, and experimental results show that the proposed hypergraph based formalization reduces the RDF data access time as well as the space needed to store the B hyper structures, while the query execution time of state-the-of-art RDF engines can be sped up by up to two orders of magnitude.

Stack-based Algorithms for Pattern Matching on DAGs

TLDR
This paper proposes a family of stack-based algorithms to handle path, twig, and dag pattern queries for directed acyclic graphs (DAGs) in particular and achieves an optimal runtime complexity quadratic in the average size of the query variable bindings.
...