ArchimedesOne: Query Processing over Probabilistic Knowledge Bases

被引:6
|
作者
Zhou, Xiaofeng [1 ]
Chen, Yang [1 ]
Wang, Daisy Zhe [1 ]
机构
[1] Univ Florida, Dept Comp & Informat Sci & Engn, Gainesville, FL 32611 USA
来源
PROCEEDINGS OF THE VLDB ENDOWMENT | 2016年 / 9卷 / 13期
关键词
D O I
10.14778/3007263.3007284
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Knowledge bases are becoming increasingly important in structuring and representing information from the web. Meanwhile, webscale information poses significant scalability and quality challenges to knowledge base systems. To address these challenges, we develop a probabilistic knowledge base system, ARCHIMEDESONE, by scaling up the knowledge expansion and statistical inference algorithms. We design a web interface for users to query and update large knowledge bases. In this paper, we demonstrate the ARCHIMEDESONE system to showcase its efficient query and inference engines. The demonstration serves two purposes: 1) to provide an interface for users to interact with ARCHIMEDESONE through load, search, and update queries; and 2) to validate our approaches of knowledge expansion by applying inference rules in batches using relational operations and query-driven inference by focusing computation on the query facts. We compare ARCHIMEDESONE with state-of-the-art approaches using two knowledge bases: NELL-sports with 4.5 million facts and Reverb-Sherlock with 15 million facts.
引用
收藏
页码:1461 / 1464
页数:4
相关论文
共 50 条
  • [21] Amalgamating knowledge bases .3. Algorithms, data structures, and query processing
    Adali, S
    Subrahmanian, VS
    JOURNAL OF LOGIC PROGRAMMING, 1996, 28 (01): : 45 - 88
  • [22] Fast and Accurate Optimizer for Query Processing over Knowledge Graphs
    Wu, Jingqi
    Chen, Rong
    Xia, Yubin
    PROCEEDINGS OF THE 2021 ACM SYMPOSIUM ON CLOUD COMPUTING (SOCC '21), 2021, : 503 - 517
  • [23] Weight-based consistent query answering over inconsistent knowledge bases
    Du, Jianfeng
    Qi, Guilin
    Shen, Yi-Dong
    KNOWLEDGE AND INFORMATION SYSTEMS, 2013, 34 (02) : 335 - 371
  • [24] Scalable Grounded Conjunctive Query Evaluation over Large and Expressive Knowledge Bases
    Dolby, Julian
    Fokoue, Achille
    Kalyanpur, Aditya
    Ma, Li
    Schonberg, Edith
    Srinivas, Kavitha
    Sun, Xingzhi
    SEMANTIC WEB - ISWC 2008, 2008, 5318 : 403 - +
  • [25] Inconsistency-tolerant reasoning over linear probabilistic knowledge bases
    Potyka, Nico
    Thimm, Matthias
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2017, 88 : 209 - 236
  • [26] Query answering in rough knowledge bases
    Vitória, A
    Damásio, CV
    Maluszyniski, J
    ROUGH SETS, FUZZY SETS, DATA MINING, AND GRANULAR COMPUTING, 2003, 2639 : 197 - 204
  • [27] TOWARDS PROBABILISTIC KNOWLEDGE BASES
    WUTHRICH, B
    LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1992, 624 : 66 - 77
  • [28] Local probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
    Lukasiewicz, T
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 1999, 21 (01) : 23 - 61
  • [29] Processing Probabilistic range query over imprecise data based on quality of result
    Zhang, W
    Li, JZ
    ADVANCED WEB AND NETWORK TECHNOLOGIES, AND APPLICATIONS, PROCEEDINGS, 2006, 3842 : 441 - 449
  • [30] Query Processing Techniques in Probabilistic Databases
    Jumde, Amol S.
    Chaudhari, Narendra S.
    2016 INTERNATIONAL CONFERENCE ON COMPUTING, ANALYTICS AND SECURITY TRENDS (CAST), 2016, : 483 - 488