Filters








141 Hits in 8.5 sec

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

Yosuke Yano, Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
2013 Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13  
In this paper, we propose new labeling-based methods for reachability queries, referred to as pruned landmark labeling and pruned path labeling.  ...  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.  ...  Contributions To address these issues, in this paper, we propose new labeling-based methods for reachability queries, referred to as pruned landmark labeling and pruned path labeling.  ... 
doi:10.1145/2505515.2505724 dblp:conf/cikm/YanoAIY13 fatcat:mpbr5eo4wzcrrowlo6e626neba

DBL: Efficient Reachability Queries on Dynamic Graphs (Complete Version) [article]

Qiuyi Lyu, Yuchen Li, Bingsheng He, Bin Gong
2021 arXiv   pre-print
The former leverages landmark nodes to quickly determine reachable pairs whereas the latter prunes unreachable pairs by indexing the leaf nodes in the graph.  ...  DBL builds on two complementary indexes: Dynamic Landmark (DL) label and Bidirectional Leaf (BL) label.  ...  DL label is built on the landmark nodes to determine reachable vertex pairs that connected by the landmarks, whereas BL label prunes unreachable pairs by examining their reachability information on the  ... 
arXiv:2101.09441v2 fatcat:r5ff2x34njd5xg4nihoe57itve

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.  ...  In particular, our method can handle social networks and web graphs with hundreds of millions of edges, which are two orders of magnitude larger than the limits of previous exact methods, with comparable  ...  Yuichi Yoshida is supported by JSPS Grant-in-Aid for Research Activity Start-up (24800082), MEXT Grant-in-Aid for Scientific Research on Innovative Areas (24106001), and JST, ERATO, Kawarabayashi Large  ... 
arXiv:1304.4661v1 fatcat:5xxpiw6n7zeijj2qngn2fswtii

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.  ...  In particular, our method can handle social networks and web graphs with hundreds of millions of edges, which are two orders of magnitude larger than the limits of previous exact methods, with comparable  ...  Yuichi Yoshida is supported by JSPS Grant-in-Aid for Research Activity Start-up (24800082), MEXT Grant-in-Aid for Scientific Research on Innovative Areas (24106001), and JST, ERATO, Kawarabayashi Large  ... 
doi:10.1145/2463676.2465315 dblp:conf/sigmod/AkibaIY13 fatcat:6gclsiynp5g2lhmxrrzuzyuv2u

Simple, fast, and scalable reachability oracle

Ruoming Jin, Guan Wang
2013 Proceedings of the VLDB Endowment  
On large graphs, their index sizes and their query performance can now beat the state-of-the-art transitive closure compression and online search approaches.  ...  In this paper, we present two simple and efficient labeling algorithms, Hierarchical-Labeling and Distribution-Labeling, which can work on massive real-world graphs: Their construction time is an order  ...  IIS-0953950 and by the Ohio Supercomputer Center under Grant no. PGS0218.  ... 
doi:10.14778/2556549.2556578 fatcat:yn6omi2a4bebtoaxl7z3d6kffm

Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling

Takuya Akiba, Yoichi Iwata, Yuichi Yoshida
2014 Proceedings of the 23rd international conference on World wide web - WWW '14  
We propose two dynamic indexing schemes for shortest-path and distance queries on large time-evolving graphs, which are useful in a wide range of important applications such as real-time network-aware  ...  The scalability and efficiency of its offline indexing algorithm and query algorithm are competitive even with previous static methods.  ...  The two methods are referred to as dynamic pruned landmark labeling and historical pruned landmark labeling.  ... 
doi:10.1145/2566486.2568007 dblp:conf/www/AkibaIY14 fatcat:4agtw5xogrge3pctubokok6qam

Label constrained shortest path estimation

Ankita Likhyani, Srikanta Bedathur
2013 Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13  
However, none of these techniques work very well when we have additional constraints on the labels associated with edges that constitute the path.  ...  Shortest path querying is a fundamental graph problem which is computationally quite challenging when operating over massive scale graphs.  ...  the landmark for the node from landmark set Sj, and pij is the path between vi and lij augmented with edge-labels.  ... 
doi:10.1145/2505515.2507818 dblp:conf/cikm/LikhyaniB13 fatcat:tmtegtzqqvh4hin6atyaz44srm

Powerful and efficient bulk shortest-path queries

Peter Rutgers, Claudio Martella, Spyros Voulgaris, Peter Boncz
2016 Proceedings of the Fourth International Workshop on Graph Data Management Experiences and Systems - GRADES '16  
on the path edges and vertices.  ...  Shortest-path computation is central to many graph queries.  ...  Our operator supports filters of edges and vertices on the paths based on labels and properties, and it requires a monotonic cost function to evaluate path costs as well as path-independent filters on  ... 
doi:10.1145/2960414.2960420 dblp:conf/grades/RutgersMVB16 fatcat:3la56oprzfeltl3r7yn4nwl4eu

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

Yongrui Qin, Quan Z. Sheng, Nickolas J. G. Falkner, Lina Yao, Simon Parkinson
2016 World wide web (Bussum)  
More specifically, our method can speed up index re-computation by up to an order of magnitude compared with the state-ofthe-art method, Pruned Landmark Labeling (PLL).  ...  Shortest path computation is one of the most fundamental operations for managing and analyzing large graphs.  ...  We obtained all these results by using the Pruned Landmark Labeling (PLL) technique presented in [2] , with or without bitparallel BFSs.  ... 
doi:10.1007/s11280-016-0421-1 fatcat:aq2h5lwkgvdwtdfjuchk5fcdfm

SALT. A unified framework for all shortest-path query variants on road networks [article]

Alexandros Efentakis, Dieter Pfoser, Yannis Vassiliou
2014 arXiv   pre-print
Although recent scientific output focuses on multiple shortest-path problem definitions for road networks, none of the existing solutions does efficiently answer all different types of SP queries.  ...  This work proposes SALT, a novel framework that not only efficiently answers SP related queries but also k-nearest neighbor queries not handled by previous approaches.  ...  of single-source shortest-path (SSSP) queries, including one-to-all, one-to-many and range queries by using the GRASP, reGRASP and isoGRASP algorithms presented in [15] .  ... 
arXiv:1411.0257v1 fatcat:c5s4dnbu4jdihe7yohzeilloqi

An experimental study on hub labeling based shortest path algorithms

Ye Li, Leong Hou U, Man Lung Yiu, Ngai Meng Kou
2017 Proceedings of the VLDB Endowment  
For a decade, hub labeling (HL) techniques have been considered as a practical solution with fast query response time (e.g., 1-3 orders of magnitude faster), competitive indexing time, and slightly larger  ...  To address the above issues, we provide a comprehensive experimental study on the state-of-the-art HL technique with analysis of their efficiency, effectiveness and applicability.  ...  [6] proposed a pruning method, called Pruned Landmark Labeling (PLL), where a label v stops pushing further at a vertex w if it has been covered by any prior label(s) in L(w) ∩ L(v).  ... 
doi:10.1145/3186728.3164141 fatcat:5vc7fzo46baufd4aw273okm5ty

Bonding vertex sets over distributed graph

Xiaofei Zhang, Hong Cheng, Lei Chen
2015 Proceedings of the VLDB Endowment  
In this work, we formally define a Vertex Set Bonding query (shorted as VSB), which returns a minimum set of vertices with the maximum importance w.r.t total betweenness and shortest path reachability  ...  With the development of two novel techniques, guided graph exploration and betweenness ranking on exploration, we are able to efficiently evaluate queries for error bounded results with bounded space cost  ...  There is a rich literature on structure oriented graph queries, such as shortest path, reachability, subgraph matching, influential maximization [28] and etc.  ... 
doi:10.14778/2824032.2824041 fatcat:ighvu5v7rfaozie3s6n3245ukm

Querying big graphs within bounded resources

Wenfei Fan, Xin Wang, Yinghui Wu
2014 Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14  
Given a query Q, a graph G and a small ratio α, it aims to answer Q in G by accessing only a fraction GQ of G of size |GQ| ≤ α|G|.  ...  We show that it is hard to get resource-bounded algorithms with 100% accuracy: NP-hard for pattern queries, and non-existing for reachability when α = 1.  ...  Fan, Wang and Wu are supported in part by 973 Programs 2014CB340302 and 2012CB316200, NSFC 61133002, Guangdong Innovative Research Team Program 2011D005, Shenzhen Peacock Program 1105100030834361, EPSRC  ... 
doi:10.1145/2588555.2610513 dblp:conf/sigmod/FanWW14 fatcat:zwjextk4sngnnjspvttgrtc5rm

Reachability Queries with Label and Substructure Constraints on Knowledge Graphs [article]

Xiaolong Wan, Hongzhi Wang
2020 arXiv   pre-print
Since knowledge graphs (KGs) describe and model the relationships between entities and concepts in the real world, reasoning on KGs often correspond to the reachability queries with label and substructure  ...  Motivated by this, we introduce two solutions for such queries on KGs, UIS and INS.  ...  ACKNOWLEDGMENTS This paper was partially supported by NSFC grant U1509216, U1866602, 61602129 and Microsoft Research Asia.  ... 
arXiv:2007.11881v1 fatcat:tocpvxiq4zgyvmxev56fdehjka

TopCom: Index for Shortest Distance Query in Directed Graph [article]

Vachik S. Dave, Mohammad Al Hasan
2016 arXiv   pre-print
Our experiments with two of the existing state-of-the-art methods (IS-Label and TreeMap) show the superiority of T OP C OM over these two methods considering scalability and query time.  ...  Classical algorithms (such as, Dijkstra) solve this problem in polynomial time, but these algorithms cannot provide real-time response for a large number of bursty queries on a large graph.  ...  Highway centric label (HCL) [Jin et al. 2012b ] is one of the fastest recent methods that is proposed for a shortest distance query on both directed and undirected graphs.  ... 
arXiv:1602.01537v2 fatcat:5nqozsqskjclblhfkwpwkvwrj4
« Previous Showing results 1 — 15 out of 141 results