Reachability in Large Graphs using Bloom Filters

被引:1
|
作者
Saha, Arkaprava [1 ]
Sengupta, Neha [1 ]
Ramanath, Maya [1 ]
机构
[1] Indian Inst Technol Delhi, Delhi, India
来源
2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOPS (ICDEW 2019) | 2019年
关键词
Reachability; Dynamic graphs; Large graphs; Bloom filters; Low memory footprint; ALGORITHM; INDEX;
D O I
10.1109/ICDEW.2019.000-9
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Reachability queries are a fundamental graph operation with applications in several domains. There has been extensive research over several decades on answering reachability queries efficiently using sophisticated index structures. However, most of these methods are built for static graphs. For graphs that are updated very frequently and are massive in size, maintaining such index structures is often infeasible due to a large memory footprint and extremely slow updates. In this paper, we introduce a technique to compute reachability queries for very large and highly dynamic graphs that minimizes the memory footprint and update time. In particular, we enable a previously proposed, index-free, approximate method for reachability called ARROW on a compact graph representation called Bloom graphs. Bloom graphs use collections of the well known summary data structure called the Bloom filter to store the edges of the graph. In our experimental evaluation with real world graph datasets with up to millions of nodes and edges, we show that using ARROW with a Bloom graph achieves memory savings of up to 50%, while having accuracy close to 100% for all graphs.
引用
收藏
页码:217 / 224
页数:8
相关论文
共 50 条
  • [31] Jacobian sparsity detection using Bloom filters
    Hovland, Paul D.
    OPTIMIZATION METHODS & SOFTWARE, 2024,
  • [32] Classification of DNA sequences using Bloom filters
    Stranneheim, Henrik
    Kaller, Max
    Allander, Tobias
    Andersson, Bjorn
    Arvestad, Lars
    Lundeberg, Joakim
    BIOINFORMATICS, 2010, 26 (13) : 1595 - 1600
  • [33] Temporal Reachability Graphs
    Whitbeck, John
    de Amorim, Marcelo Dias
    Conan, Vania
    Guillaume, Jean-Loup
    MOBICOM 12: PROCEEDINGS OF THE 18TH ANNUAL INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND NETWORKING, 2012, : 377 - 388
  • [34] Longest prefix matching using bloom filters
    Dharmapurikar, S
    Krishnamurthy, P
    Taylor, DE
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2003, 33 (04) : 201 - 212
  • [35] Efficient processing of label-constraint reachability queries in large graphs
    Zou, Lei
    Xu, Kun
    Yu, Jeffrey Xu
    Chen, Lei
    Xiao, Yanghua
    Zhao, Dongyan
    INFORMATION SYSTEMS, 2014, 40 : 47 - 66
  • [36] Longest prefix matching using bloom filters
    Dharmapurikar, S
    Krishnamurthy, P
    Taylor, DE
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2006, 14 (02) : 397 - 409
  • [37] DistR: A Distributed Method for the Reachability Query over Large Uncertain Graphs
    Cheng, Yurong
    Yuan, Ye
    Chen, Lei
    Wang, Guoren
    Giraud-Carrier, Christophe
    Sun, Yongjiao
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2016, 27 (11) : 3172 - 3185
  • [38] Efficiently Answering Span-Reachability Queries in Large Temporal Graphs
    Wen, Dong
    Huang, Yilun
    Zhang, Ying
    Qin, Lu
    Zhang, Wenjie
    Lin, Xuemin
    2020 IEEE 36TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2020), 2020, : 1153 - 1164
  • [39] Path-Tree: An Efficient Reachability Indexing Scheme for Large Directed Graphs
    Jin, Ruoming
    Ruan, Ning
    Xiang, Yang
    Wang, Haixun
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2011, 36 (01):
  • [40] Answering reachability and K-reach queries on large graphs with label constraints
    You Peng
    Xuemin Lin
    Ying Zhang
    Wenjie Zhang
    Lu Qin
    The VLDB Journal, 2022, 31 : 101 - 127