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 条
  • [41] Mining for tree-query associations in a graph
    Hoekx, Eveline
    Van den Bussche, Jan
    ICDM 2006: SIXTH INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2006, : 254 - 264
  • [42] Efficient Reachability Query Evaluation in Large Spatiotemporal Contact Datasets
    Shirani-Mehr, Houtan
    Banaei-Kashani, Farnoush
    Shahabi, Cyrus
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2012, 5 (09): : 848 - 859
  • [43] A decomposition based algorithm of graph containment query
    Li, Xian-Tong
    Li, Jian-Zhong
    Information Technology Journal, 2009, 8 (02) : 214 - 219
  • [44] Efficient Query Processing on Graph Databases
    Cheng, James
    Ke, Yiping
    Ng, Wilfred
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2009, 34 (01):
  • [45] TD-GEN: Graph Generation Using Tree Decomposition
    Shirzad, Hamed
    Hajimirsadeghi, Hossein
    Abdi, Amir H.
    Mori, Greg
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 151, 2022, 151
  • [46] ActiveReach: an active learning framework for approximate reachability query answering in large-scale graphs
    Raghebi, Zohreh
    Banaei-Kashani, Farnoush
    FRONTIERS IN BIG DATA, 2024, 7
  • [47] Trustworthy Knowledge Graph Population From Texts for Domain Query Answering
    Ao, Jing
    Dinakaran, Swathi
    Yang, Hungjian
    Wright, David
    Chirkova, Rada
    2021 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2021, : 4590 - 4599
  • [48] Complex Query Answering on Eventuality Knowledge Graph with Implicit Logical Constraints
    Bai, Jiaxin
    Liu, Xin
    Wang, Weiqi
    Luo, Chen
    Song, Yangqiu
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [49] Answering How-to-Reach Query in Big Attributed Graph Databases
    Yung, Duncan
    Chang, Shi-Kuo
    2017 THIRD IEEE INTERNATIONAL CONFERENCE ON BIG DATA COMPUTING SERVICE AND APPLICATIONS (IEEE BIGDATASERVICE 2017), 2017, : 141 - 148
  • [50] Visual Query Answering by Entity-Attribute Graph Matching and Reasoning
    Xiong, Peixi
    Zhan, Huayi
    Wang, Xin
    Sinha, Baivab
    Wu, Ying
    2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, : 8349 - 8358
12345