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

Peng, Y; Zhao, W; Zhang, W; Lin, X; Zhang, Y

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

Peng, Y Zhao, W Zhang, W Lin, X Zhang, Y

Permalink

Publisher:: ACM
Publication Type:: Conference Proceeding
Citation:: International Conference on Information and Knowledge Management, Proceedings, 2021, pp. 4764-4768
Issue Date:: 2021-10-26

Closed Access

	Filename	Description	Size
	CIKM.pdf	Accepted version	2.03 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Peng, Y
dc.contributor.author	Zhao, W
dc.contributor.author	Zhang, W
dc.contributor.author	Lin, X
dc.contributor.author	Zhang, Y https://orcid.org/0000-0002-2674-1638
dc.date	2021-11-01
dc.date.accessioned	2024-03-04T04:32:37Z
dc.date.available	2024-03-04T04:32:37Z
dc.date.issued	2021-10-26
dc.identifier.citation	International Conference on Information and Knowledge Management, Proceedings, 2021, pp. 4764-4768
dc.identifier.isbn	9781450384469
dc.identifier.uri	http://hdl.handle.net/10453/176072
dc.description.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.
dc.language	en
dc.publisher	ACM
dc.relation.ispartof	International Conference on Information and Knowledge Management, Proceedings
dc.relation.ispartof	ACM International Conference on Information & Knowledge Management
dc.relation.isbasedon	10.1145/3459637.3481978
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	DLQ: A System for Label-Constrained Reachability Queries on Dynamic Graphs
dc.type	Conference Proceeding
utslib.location.activity	Virtual Event Queensland Australia
pubs.organisational-group	University of Technology Sydney
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	University of Technology Sydney/Strength - AAII - Australian Artificial Intelligence Institute
utslib.copyright.status	closed_access	*
pubs.consider-herdc	false
dc.date.updated	2024-03-04T04:32:35Z
pubs.finish-date	2021-11-05
pubs.place-of-publication	USA
pubs.publication-status	Published
pubs.start-date	2021-11-01
dc.location	USA

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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/176072