30 Hits in 3.9 sec


Fang Wei
2010 Proceedings of the 2010 international conference on Management of data - SIGMOD '10  
Table: Comparison between TEDI and SYMM on query time over real dataset.  ...  • Based on the tree index, we can execute the shortest path search in a bottom-up manner and the query time is decided by the height and the bag cardinality of the tree, instead of the size of the graph  ...  • An index structure based on tree decomposition for answering shortest path queries over (un)directed graph. • Efficiency on query answering, index construction. • Can be extended to weighted graphs:  ... 
doi:10.1145/1807167.1807181 dblp:conf/sigmod/Wei10 fatcat:3v524ulz7rcihdpofr2bdlniue

TEDI [chapter]

Fang Wei
Advances in Data Mining and Database Management  
To address these problems, we propose TEDI, an indexing and query processing scheme for the shortest path query answering. TEDI is based on the tree decomposition methodology.  ...  A shortest path query on a graph finds the shortest path for the given source and target vertices in the graph.  ...  The shortest path query answering in a graph is among the fundamental operations on the graph data.  ... 
doi:10.4018/978-1-61350-053-8.ch009 fatcat:3bk5to6mfjf5jeysxo6jqenefa

The exact distance to destination in undirected world

Lijun Chang, Jeffrey Xu Yu, Lu Qin, Hong Cheng, Miao Qiao
2012 The VLDB journal  
traversing the large graph when answering queries.  ...  For intensive queries on large graphs, it is impractical to compute shortest distances on-line from scratch, and impractical to materialize all-pairs shortest distances.  ...  Shortest path query is one of the fundamental operations on graph data.  ... 
doi:10.1007/s00778-012-0274-x fatcat:4s7u3b2nafen3hlr7cfkiaypui

Dynamic graph query primitives for SDN-based cloudnetwork management

Ramya Raghavendra, Jorge Lobo, Kang-Won Lee
2012 Proceedings of the first workshop on Hot topics in software defined networks - HotSDN '12  
Using the illustrative case of all pair shortest path algorithm, we demonstrate how scalable lightweight dynamic graph query mechanisms can be implemented to enable practical computation times, in presence  ...  These network management functionalities depend on a set of underlying graph primitives.  ...  RELATED WORK Our paper builds on the TEDI algorithm [13] an indexing and query processing scheme for the shortest path query answering.  ... 
doi:10.1145/2342441.2342461 dblp:conf/sigcomm/Raghavendra0L12 fatcat:swyc6gmwa5e4li7mok4knynh7u

Shortest-path queries for complex networks

Takuya Akiba, Christian Sommer, Ken-ichi Kawarabayashi
2012 Proceedings of the 15th International Conference on Extending Database Technology - EDBT '12  
We present new and improved methods for efficient shortestpath query processing. Our methods are tailored to work for two specific classes of graphs: graphs with small treewidth and complex networks.  ...  Our experiments on several real-world complex networks further confirm the efficiency of our methods: Both the exact and the hybrid method have faster preprocessing and query times than existing methods  ...  There are also data structures that answer shortest-path queries more efficiently than those for general graphs [13, 20] .  ... 
doi:10.1145/2247596.2247614 dblp:conf/edbt/AkibaSK12 fatcat:t5qoq4jnfjcsjacod2dsecnyaq


Ada Wai-Chee Fu, Huanhuan Wu, James Cheng, Raymond Chi-Wing Wong
2013 Proceedings of the VLDB Endowment  
We study the problem of computing shortest path or distance between two query vertices in a graph, which has numerous important applications.  ...  We propose an efficient index, which is a novel labeling scheme based on the independent set of a graph.  ...  PATH QUERIES In this section, we discuss the extension of our method to answer shortest-path queries. To answer a P2P shortest-path query, we need to keep some extra information in the vertex labels.  ... 
doi:10.14778/2536336.2536346 fatcat:nbp53r3kdbfmpf3smzucsikqpm

Answering pattern match queries in large graph databases via graph embedding

Lei Zou, Lei Chen, M. Tamer Özsu, Dongyan Zhao
2011 The VLDB journal  
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern matching.  ...  Due to the huge search space, we adopt a filter-and-refine framework to answer a pattern match query over a large graph.  ...  However, BFS cannot be used to compute shortest paths in weighted graphs. Therefore, TEDI can only support unweighted graphs, but GP is a general solution for shortest path distance queries.  ... 
doi:10.1007/s00778-011-0238-6 fatcat:htpxhxr46fadrl4x5huhninfzy

Graph Calculus: Scalable Shortest Path Analytics for Large Social Graphs through Core Net

Lixin Fu, Jing Deng
2013 2013 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT)  
We focus on the problem of scalable shortest path analytics for large social graphs in this paper.  ...  When the shortest path between two arbitrary vertices, u and v, is queried, we approximate it with triangulation.  ...  These algorithms try to approximate the shortest-path queries in order to be more computationally efficient.  ... 
doi:10.1109/wi-iat.2013.59 dblp:conf/webi/FuD13 fatcat:yi4ji4ooivhfhkfnuonrykgmji

A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks [article]

Muhammad Farhan, Qing Wang, Yu Lin, Brendan Mckay
2021 arXiv   pre-print
Answering exact shortest path distance queries is a fundamental task in graph theory.  ...  In this work, we present novel techniques to efficiently construct distance labelling and process exact shortest path distance queries for complex networks with billions of vertices and billions of edges  ...  To efficiently answer exact shortest-path distance queries on graphs, labelling-based methods have been developed with great success [1-3, 12, 17, 19] .  ... 
arXiv:1812.02363v2 fatcat:lp6xmip7ujfc7fe6qddegcfuea

TRS: A New Structure for Shortest Path Query [chapter]

Qi Wang, Junting Jin, Hong Chen
2013 Communications in Computer and Information Science  
Shortest path queries between arbitrary nodes are performed upon this structure. The final result could be a detail path with exact path cost.  ...  Shortest Path Query is being applied to more and more professional scopes, such as social networks and bioinformatics.  ...  Conclusion and Future Work Answering shortest path query on a graph which does not fit in memory is now a very important problem with the development of networks.  ... 
doi:10.1007/978-3-642-41629-3_2 fatcat:bd6pvr2zorhffkr7rajdc3zg44

Towards Online Shortest Path Computation

Leong Hou U, Hong Jun Zhao, Man Lung Yiu, Yuhong Li, Zhiguo Gong
2014 IEEE Transactions on Knowledge and Data Engineering  
The online shortest path problem aims at computing the shortest path based on live traffic circumstances.  ...  To our best knowledge, there is no efficient system/solution that can offer affordable costs at both client and server sides for online shortest path computation.  ...  [34] [35] focus on precomputing certain shortest path distances called oracles in order to answer approximate shortest path queries efficiently.  ... 
doi:10.1109/tkde.2013.176 fatcat:e2id3tfmrngutkjgqxhz5nwiri

Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme

Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
2012 2012 IEEE 28th International Conference on Data Engineering  
Two optimization techniques on graph compression and graph online search are also proposed, with the goal to further reduce index size and improve query accuracy.  ...  Specifically, a local landmark is defined as the least common ancestor of the two query nodes in the shortest path tree rooted at a global landmark.  ...  [25] proposes TEDI, an indexing and query processing scheme for the shortest path query based on tree decomposition. VIII.  ... 
doi:10.1109/icde.2012.53 dblp:conf/icde/QiaoCCY12 fatcat:hhyge23ujnd4locqkulz6ammce

Effective caching of shortest paths for location-based services

Jeppe Rishede Thomsen, Man Lung Yiu, Christian S. Jensen
2012 Proceedings of the 2012 international conference on Management of Data - SIGMOD '12  
Our cache exploits the optimal subpath property, which allows a cached shortest path to answer any query with source and target nodes on the path.  ...  Also, we design a compact cache structure that supports efficient query matching at runtime. Empirical results on real datasets confirm the effectiveness of our proposed techniques.  ...  ., landmarks [13] , HiTi [12] , and TEDI [21] , attempt to materialize some distances/paths in order to accelerate the processing of shortest path queries.  ... 
doi:10.1145/2213836.2213872 dblp:conf/sigmod/ThomsenYJ12 fatcat:ecs3ew6duzb6nj4yd6sbvus44m

Fast exact shortest-path distance queries on large networks by pruned landmark labeling

Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
2013 Proceedings of the 2013 international conference on Management of data - SIGMOD '13  
We propose a new exact method for shortest-path distance queries on large-scale networks. Our method precomputes distance labels for vertices by performing a breadth-first search from every vertex.  ...  We experimentally demonstrate that the combination of these two techniques is efficient and robust on various kinds of large-scale real-world networks.  ...  Graph Project.  ... 
doi:10.1145/2463676.2465315 dblp:conf/sigmod/AkibaIY13 fatcat:6gclsiynp5g2lhmxrrzuzyuv2u

Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling [article]

Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
2013 arXiv   pre-print
We propose a new exact method for shortest-path distance queries on large-scale networks. Our method precomputes distance labels for vertices by performing a breadth-first search from every vertex.  ...  We experimentally demonstrate that the combination of these two techniques is efficient and robust on various kinds of large-scale real-world networks.  ...  Graph Project.  ... 
arXiv:1304.4661v1 fatcat:5xxpiw6n7zeijj2qngn2fswtii
« Previous Showing results 1 — 15 out of 30 results