short-paper

DLQ: A System for Label-Constrained Reachability Queries on Dynamic Graphs

Authors:

Ying ZhangAuthors Info & Claims

CIKM '21: Proceedings of the 30th ACM International Conference on Information & Knowledge Management

Pages 4764 - 4768

https://doi.org/10.1145/3459637.3481978

Published: 30 October 2021 Publication History

Abstract

Label-Constraint Reachability query (LCR) which extracts of reachability information from large edge-labeled graphs, has attracted tremendous interest. Various LCR algorithms have been proposed to solve this fundamental query, which has a wide range of applications in social networks, biological networks, economic networks, etc. In this paper, we implement the state-of-the-art P2H+ algorithm as well as functions to analyze the effectiveness. Moreover, our Dynamic LCR Query (DLQ) system also supports dynamic updates with the 2-hop labeling method. In this demonstration, we present the DLQ system for Label-Constrained Reachability Queries that utilize the 2-hop labeling algorithm with dynamic graph maintenance.

Supplementary Material

MP4 File (CIKM21-de3089.mp4)

Presentation video - slides and demo.

Download
68.65 MB

References

[1]

Saurabh Asthana, Oliver D King, Francis D Gibbons, and Frederick P Roth. 2004. Predicting protein complex membership using probabilistic network reliability. Genome research, Vol. 14, 6 (2004), 1170--1175.

[2]

Scott Beamer, Krste Asanovic, and David Patterson. 2012. Direction-optimizing breadth-first search. In SC'12: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis. IEEE, 1--10.

Digital Library

[3]

James Cheng, Silu Huang, Huanhuan Wu, and Ada Wai-Chee Fu. 2013. Tf-label: a topological-folding labeling scheme for reachability querying in a large graph. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data. 193--204.

Digital Library

[4]

Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun Wang, and S Yu Philip. 2006. Fast computation of reachability labeling for large graphs. In International Conference on Extending Database Technology. Springer, 961--979.

Digital Library

[5]

Pankaj Choudhary and Upasna Singh. 2015. A survey on social network analysis for counter-terrorism. International Journal of Computer Applications, Vol. 112, 9 (2015), 24--29.

[6]

Yixiang Fang, Reynold Cheng, Xiaodong Li, Siqiang Luo, and Jiafeng Hu. 2017. Effective community search over large spatial graphs. PVLDB, Vol. 10, 6 (2017), 709--720.

Digital Library

[7]

Yixiang Fang, Reynold Cheng, Siqiang Luo, and Jiafeng Hu. 2016. Effective community search for large attributed graphs. PVLDB, Vol. 9, 12 (2016), 1233--1244.

Digital Library

[8]

Yixiang Fang, Kaiqiang Yu, Reynold Cheng, Laks V.S. Lakshmanan, and Xuemin Lin. 2019. Efficient algorithms for densest subgraph discovery. PVLDB, Vol. 12, 11 (2019), 1719--1732.

Digital Library

[9]

Jiafeng Hu, Reynold Cheng, Kevin Chen-Chuan Chang, Aravind Sankar, Yixiang Fang, and Brian YH Lam. 2019. Discovering maximal motif cliques in large heterogeneous information networks. In International Conference on Data Engineering (ICDE). IEEE, 746--757.

[10]

Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, and Yang Xiang. 2010. Computing label-constraint reachability in graph databases. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of data. 123--134.

Digital Library

[11]

Ruoming Jin, Ning Ruan, Saikat Dey, and Jeffrey Yu Xu. 2012. Scarab: scaling reachability computation on large graphs. In Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data. 169--180.

Digital Library

[12]

Xin Jin, Zhengyi Yang, Xuemin Lin, Shiyu Yang, Lu Qin, and You Peng. 2021. FAST: FPGA-based Subgraph Matching on Massive Graphs. arXiv preprint arXiv:2102.10768 (2021).

[13]

Zhengmin Lai, You Peng, Shiyu Yang, Xuemin Lin, and Wenjie Zhang. 2021. PEFP: Efficient k-hop Constrained s-t Simple Path Enumeration on FPGA. In ICDE. IEEE.

[14]

Chenhao Ma, Yixiang Fang, Reynold Cheng, Laks VS Lakshmanan, Wenjie Zhang, and Xuemin Lin. 2020. Efficient algorithms for densest subgraph discovery on large directed graphs. In ACM SIGMOD. 1051--1066.

Digital Library

[15]

You Peng, Xuemin Lin, Ying Zhang, Wenjie Zhang, and Lu Qin. 2021 a. Answering Reachability and K-Reach Queries on Large Graphs with Label-Constraints. The VLDB Journal (2021), 1--25.

[16]

You Peng, Xuemin Lin, Ying Zhang, Wenjie Zhang, Lu Qin, and Jingren Zhou. 2021 b. Efficient Hop-constrained s-t Simple Path Enumeration. The VLDB Journal (2021), 1--24.

[17]

You Peng, Ying Zhang, Xuemin Lin, Lu Qin, and Wenjie Zhang. 2020. Answering billion-scale label-constrained reachability queries within microsecond. Proceedings of the VLDB Endowment, Vol. 13, 6 (2020), 812--825.

Digital Library

[18]

You Peng, Ying Zhang, Xuemin Lin, Wenjie Zhang, Lu Qin, and Jingren Zhou. 2019. Towards bridging theory and practice: hop-constrained st simple path enumeration. Proceedings of the VLDB Endowment, Vol. 13, 4 (2019), 463--476.

Digital Library

[19]

You Peng, Ying Zhang, Wenjie Zhang, Xuemin Lin, and Lu Qin. 2018. Efficient probabilistic k-core computation on uncertain graphs. In 2018 IEEE 34th International Conference on Data Engineering (ICDE). IEEE, 1192--1203.

[20]

Lu Qin, Wenjie Zhang, Ying Zhang, You Peng, Hiroyuki Kato, Wei Wang, and Chuan Xiao. [n.d.]. Software Foundations for Data Interoperability and Large Scale Graph Data Analytics.([n.,d.]).

[21]

Xiafei Qiu, Wubin Cen, Zhengping Qian, You Peng, Ying Zhang, Xuemin Lin, and Jingren Zhou. 2018. Real-time constrained cycle detection in large dynamic graphs. Proceedings of the VLDB Endowment, Vol. 11, 12 (2018), 1876--1888.

Digital Library

[22]

Stephan Seufert, Avishek Anand, Srikanta Bedathur, and Gerhard Weikum. 2013. Ferrari: Flexible and efficient reachability range assignment for graph indexing. In 2013 IEEE 29th International Conference on Data Engineering (ICDE). IEEE, 1009--1020.

Digital Library

[23]

Klaus Simon. 1988. An improved algorithm for transitive closure on acyclic digraphs. Theoretical Computer Science, Vol. 58, 1--3 (1988), 325--346.

Digital Library

[24]

Lucien DJ Valstar, George HL Fletcher, and Yuichi Yoshida. 2017. Landmark indexing for evaluation of label-constrained reachability queries. In Proceedings of the 2017 ACM International Conference on Management of Data. 345--358.

Digital Library

[25]

Sebastiaan J van Schaik and Oege de Moor. 2011. A memory efficient reachability data structure through bit vector compression. In Proceedings of the 2011 ACM SIGMOD International Conference on Management of data. 913--924.

Digital Library

[26]

Jeffrey Xu Yu and Jiefeng Cheng. 2010. Graph reachability queries: A survey. In Managing and Mining Graph Data. Springer, 181--215.

[27]

Lei Zou, Kun Xu, Jeffrey Xu Yu, Lei Chen, Yanghua Xiao, and Dongyan Zhao. 2014. Efficient processing of label-constraint reachability queries in large graphs. Information Systems, Vol. 40 (2014), 47--66.

Digital Library

Cited By

Wang YChu JYuan YGu YJi HZhang H(2024)Label Constrained Reachability Queries on Time Dependent Graphs2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00251(3244-3256)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00251
Peng YMa ZZhang WLin XZhang YChen X(2023)Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00071(856-868)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00071
Peng YLin XYu MZhang WQin L(2023)TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00018(137-150)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00018
Show More Cited By

Index Terms

DLQ: A System for Label-Constrained Reachability Queries on Dynamic Graphs
1. Information systems
  1. Data management systems
    1. Query languages
      1. Query languages for non-relational engines
  2. World Wide Web
    1. Web applications
      1. Social networks
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms

Recommendations

Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph

An i-triangulated graph is a graph in which every odd cycle has two non-crossing chords; i-triangulated graphs form a subfamily of perfect graphs. A slightly more general family of perfect graphs are clique-separable graphs. A graph is clique-separable ...
Computing a Minimum Cut in a Graph with Dynamic Edges Incident to a Designated Vertex

We consider an edge-weighted graph G with a designated vertex v₀ such that weights of edges incident to v₀ may increase or decrease. We show that, with an O(mn + n² log n) time preprocessing, a minimum cut of the current G can be computed in O(log n) ...
Algorithmic aspects of semitotal domination in graphs
Abstract
For a graph G = ( V , E ), a set D ⊆ V is called a semitotal dominating set of G if D is a dominating set of G, and every vertex in D is within distance 2 of another vertex of D. The Minimum Semitotal Domination problem is to find a ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CIKM '21: Proceedings of the 30th ACM International Conference on Information & Knowledge Management

October 2021

4966 pages

ISBN:9781450384469

DOI:10.1145/3459637

General Chairs:
Gianluca Demartini
The University of Queensland, Australia
,
Guido Zuccon
The University of Queensland, Australia
,
Program Chairs:
J. Shane Culpepper
RMIT University, Australia
,
Zi Huang
The University of Queensland, Australia
,
Hanghang Tong
University of Illinois at Urbana-Champaign, USA

Copyright © 2021 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 October 2021

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Conference

CIKM '21

Sponsor:

CIKM '21: The 30th ACM International Conference on Information and Knowledge Management

November 1 - 5, 2021

Queensland, Virtual Event, Australia

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
182
Total Downloads

Downloads (Last 12 months)23
Downloads (Last 6 weeks)2

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wang YChu JYuan YGu YJi HZhang H(2024)Label Constrained Reachability Queries on Time Dependent Graphs2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00251(3244-3256)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00251
Peng YMa ZZhang WLin XZhang YChen X(2023)Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00071(856-868)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00071
Peng YLin XYu MZhang WQin L(2023)TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00018(137-150)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00018
Chen XPeng YWang SYu J(2022)DLCRProceedings of the VLDB Endowment10.14778/3529337.352934815:8(1645-1657)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.14778/3529337.3529348
Yuan ZPeng YCheng PHan LLin XChen LZhang W(2022)Efficient $k-\text{clique}$ Listing with Set Intersection Speedup2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00192(1955-1968)Online publication date: May-2022
https://doi.org/10.1109/ICDE53745.2022.00192
Peng YBian SLi RWang SYu J(2022)Finding Top-r Influential Communities under Aggregation Functions2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00191(1941-1954)Online publication date: May-2022
https://doi.org/10.1109/ICDE53745.2022.00191
Feng QPeng YZhang WZhang YLin X(2022)Towards Real-Time Counting Shortest Cycles on Dynamic Graphs: A Hub Labeling Approach2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00043(512-524)Online publication date: May-2022
https://doi.org/10.1109/ICDE53745.2022.00043
Peng YLin XZhang YZhang WQin L(2021)Answering reachability and K-reach queries on large graphs with label constraintsThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-021-00695-031:1(101-127)Online publication date: 28-Aug-2021
https://dl.acm.org/doi/10.1007/s00778-021-00695-0

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents