Reachability Queries with Label and Substructure Constraints on Knowledge Graphs (Extended abstract)

Xiaolong Wan; Hongzhi Wang

doi:10.1109/ICDE55515.2023.00311

Reachability Queries with Label and Substructure Constraints on Knowledge Graphs (Extended abstract)

Xiaolong Wan^*
, Hongzhi Wang

^*Corresponding author for this work

School of Computer Science and Technology, Harbin Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Since knowledge graphs (KGs) describe and model the relationships between entities and concepts in the real world, reasoning on KGs often corresponds to the r eachability queries with l abel and s ubstructure c onstraints (LSCR queries). Specifically, for a search path p , LSCR queries not only require that the labels of the edges passed by p are in a label set, but also claim that a vertex in p could satisfy a substructure constraint.

Original language	English
Title of host publication	Proceedings - 2023 IEEE 39th International Conference on Data Engineering, ICDE 2023
Publisher	IEEE Computer Society
Pages	3769-3770
Number of pages	2
ISBN (Electronic)	9798350322279
DOIs	https://doi.org/10.1109/ICDE55515.2023.00311
State	Published - 2023
Externally published	Yes
Event	39th IEEE International Conference on Data Engineering, ICDE 2023 - Anaheim, United States Duration: 3 Apr 2023 → 7 Apr 2023

Publication series

Name	Proceedings - International Conference on Data Engineering
Volume	2023-April
ISSN (Print)	1084-4627

Conference

Conference	39th IEEE International Conference on Data Engineering, ICDE 2023
Country/Territory	United States
City	Anaheim
Period	3/04/23 → 7/04/23

Access to Document

10.1109/ICDE55515.2023.00311

Cite this

Wan, X., & Wang, H. (2023). Reachability Queries with Label and Substructure Constraints on Knowledge Graphs (Extended abstract). In Proceedings - 2023 IEEE 39th International Conference on Data Engineering, ICDE 2023 (pp. 3769-3770). (Proceedings - International Conference on Data Engineering; Vol. 2023-April). IEEE Computer Society. https://doi.org/10.1109/ICDE55515.2023.00311

@inproceedings{aa8eb2aeeb5c45daa3b92eeb0dd60efb,

title = "Reachability Queries with Label and Substructure Constraints on Knowledge Graphs (Extended abstract)",

abstract = "Since knowledge graphs (KGs) describe and model the relationships between entities and concepts in the real world, reasoning on KGs often corresponds to the r eachability queries with l abel and s ubstructure c onstraints (LSCR queries). Specifically, for a search path p , LSCR queries not only require that the labels of the edges passed by p are in a label set, but also claim that a vertex in p could satisfy a substructure constraint.",

author = "Xiaolong Wan and Hongzhi Wang",

note = "Publisher Copyright: {\textcopyright} 2023 IEEE.; 39th IEEE International Conference on Data Engineering, ICDE 2023 ; Conference date: 03-04-2023 Through 07-04-2023",

year = "2023",

doi = "10.1109/ICDE55515.2023.00311",

language = "英语",

series = "Proceedings - International Conference on Data Engineering",

publisher = "IEEE Computer Society",

pages = "3769--3770",

booktitle = "Proceedings - 2023 IEEE 39th International Conference on Data Engineering, ICDE 2023",

address = "美国",

}

Wan, X & Wang, H 2023, Reachability Queries with Label and Substructure Constraints on Knowledge Graphs (Extended abstract). in Proceedings - 2023 IEEE 39th International Conference on Data Engineering, ICDE 2023. Proceedings - International Conference on Data Engineering, vol. 2023-April, IEEE Computer Society, pp. 3769-3770, 39th IEEE International Conference on Data Engineering, ICDE 2023, Anaheim, United States, 3/04/23. https://doi.org/10.1109/ICDE55515.2023.00311

Reachability Queries with Label and Substructure Constraints on Knowledge Graphs (Extended abstract). / Wan, Xiaolong ; Wang, Hongzhi.
Proceedings - 2023 IEEE 39th International Conference on Data Engineering, ICDE 2023. IEEE Computer Society, 2023. p. 3769-3770 (Proceedings - International Conference on Data Engineering; Vol. 2023-April).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Reachability Queries with Label and Substructure Constraints on Knowledge Graphs (Extended abstract)

AU - Wan, Xiaolong

AU - Wang, Hongzhi

PY - 2023

Y1 - 2023

N2 - Since knowledge graphs (KGs) describe and model the relationships between entities and concepts in the real world, reasoning on KGs often corresponds to the r eachability queries with l abel and s ubstructure c onstraints (LSCR queries). Specifically, for a search path p , LSCR queries not only require that the labels of the edges passed by p are in a label set, but also claim that a vertex in p could satisfy a substructure constraint.

AB - Since knowledge graphs (KGs) describe and model the relationships between entities and concepts in the real world, reasoning on KGs often corresponds to the r eachability queries with l abel and s ubstructure c onstraints (LSCR queries). Specifically, for a search path p , LSCR queries not only require that the labels of the edges passed by p are in a label set, but also claim that a vertex in p could satisfy a substructure constraint.

UR - https://www.scopus.com/pages/publications/85167657482

U2 - 10.1109/ICDE55515.2023.00311

DO - 10.1109/ICDE55515.2023.00311

M3 - 会议稿件

AN - SCOPUS:85167657482

T3 - Proceedings - International Conference on Data Engineering

SP - 3769

EP - 3770

BT - Proceedings - 2023 IEEE 39th International Conference on Data Engineering, ICDE 2023

PB - IEEE Computer Society

T2 - 39th IEEE International Conference on Data Engineering, ICDE 2023

Y2 - 3 April 2023 through 7 April 2023

ER -

Reachability Queries with Label and Substructure Constraints on Knowledge Graphs (Extended abstract)

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this