Efficient Graph Reachability Query Answering Using Tree Decomposition

被引：0
|
作者：
Wei, Fang [1 ]
机构：
[1] Univ Freiburg, Dept Comp Sci, D-7800 Freiburg, Germany
来源：
REACHABILITY PROBLEMS | 2010年 / 6227卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data processing, ontology reasoning and bioinformatics. In this paper, we present a novel indexing method based on the concept of tree decomposition. We show analytically that this intuitive approach is both time and space efficient. We demonstrate empirically the efficiency and the effectiveness of our method.
引用
收藏
页码：183 / 197
页数：15
相关论文
共 50 条
  • [21] Answering Location-Aware Graph Reachability Queries on GeoSocial Data
    Sarwat, Mohamed
    Sun, Yuhan
    2017 IEEE 33RD INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2017), 2017, : 207 - 210
  • [22] Query-Driven Knowledge Graph Construction using Question Answering and Multimodal Fusion
    Peng, Yang
    COMPANION OF THE WORLD WIDE WEB CONFERENCE, WWW 2023, 2023, : 1119 - 1126
  • [23] Efficient Methods for Label-Constraint Reachability Query
    Du M.
    Yang Y.
    Zhou J.
    Chen Z.
    Yang A.
    Zhou, Junfeng (zhoujf@dhu.edu.cn), 1949, Science Press (57): : 1949 - 1960
  • [24] Hierarchical Query Graph Generation for Complex Question Answering over Knowledge Graph
    Qiu, Yunqi
    Zhang, Kun
    Wang, Yuanzhuo
    Jin, Xiaolong
    Bai, Long
    Guan, Saiping
    Cheng, Xueqi
    CIKM '20: PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, 2020, : 1285 - 1294
  • [25] Drawing clustered Graph using modular decomposition tree
    Deng, W.-Y., 1600, Asian Network for Scientific Information (12):
  • [26] StarMR: An Efficient Star-Decomposition Based Query Processor for SPARQL Basic Graph Patterns Using MapReduce
    Xu, Qiang
    Wang, Xin
    Li, Jianxin
    Gan, Ying
    Chai, Lele
    Wang, Junhu
    WEB AND BIG DATA (APWEB-WAIM 2018), PT I, 2018, 10987 : 415 - 430
  • [27] Efficient Answering of k-Reachability on Temporal Bipartite Graphs
    Xu, Zhuoqing
    Yang, Zhengyi
    Chen, Xiaoshuang
    He, Huangleshuai
    Cao, Xin
    DATABASES THEORY AND APPLICATIONS, ADC 2024, 2025, 15449 : 224 - 238
  • [28] On the data complexity of consistent query answering over graph databases
    Barcelo, Pablo
    Fontaine, Gaelle
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 88 : 164 - 194
  • [29] A New Reachability Query Method for Graph-structured XML Data
    Lu Yan
    Ma, Funing
    Chu, Shanzhong
    ADVANCES IN COMPUTING, CONTROL AND INDUSTRIAL ENGINEERING, 2012, 235 : 394 - +
  • [30] Effective and Efficient Keyword Query Interpretation Using a Hybrid Graph
    Chen, Junquan
    Xu, Kaifeng
    Wang, Haofen
    Jin, Wei
    Yu, Yong
    WEB INFORMATION SYSTEM ENGINEERING-WISE 2010, 2010, 6488 : 175 - +
12345