Finding successful queries in a mediator context

被引：0
|
作者：
Bidault, A [1 ]
Froidevaux, C [1 ]
Safar, B [1 ]
机构：
[1] CNRS, LRI, F-91405 Orsay, France
来源：
FLEXIBLE QUERY ANSWERING SYSTEMS: RECENT ADVANCES | 2001年
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we study failing queries posed to a mediator in an information integration system and expressed in the logical formalism of the information integration system PICSEL1. First, we present the notion of concept generalisation in a concept hierarchy that is used to repair failing queries. Then, we address two problems arising while rewriting a query using views. The first problem concerns queries that cannot be rewritten due to a lack of sources, the second one concerns queries that have only unsatisfiable rewritings.
引用
收藏
页码：42 / 53
页数：12
相关论文
共 50 条
  • [41] TRANSLATION Finding sense in the context
    Keeling, Kim M.
    Bedwell, David M.
    ELIFE, 2020, 9
  • [42] Finding Context In a Complex World
    Blasch, Erik
    SIGNAL PROCESSING, SENSOR/INFORMATION FUSION, AND TARGET RECOGNITION XXIV, 2015, 9474
  • [43] Finding provenance, seeking context
    Mark, Peter
    AFRIQUES-DEBATS METHODES ET TERRAINS D HISTOIRE, 2019, 10
  • [44] Finding Argument Fragments on Social Media with Corpus Queries and LLMs
    Dykes, Nathan
    Evert, Stephanie
    Heinrich, Philipp
    Humml, Merlin
    Schroder, Lutz
    ROBUST ARGUMENTATION MACHINES, RATIO 2024, 2024, 14638 : 163 - 181
  • [45] Finding ALL Answers to OBDA Queries Using Referring Expressions
    Toman, David
    Weddell, Grant
    AI 2019: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, 11919 : 117 - 129
  • [46] QueryTrans: Finding Similar Queries Based on Query Trace Graph
    Li, Yanan
    Wang, Bin
    Xu, Sheng
    Li, Peng
    Li, Jintao
    2009 IEEE/WIC/ACM INTERNATIONAL JOINT CONFERENCES ON WEB INTELLIGENCE (WI) AND INTELLIGENT AGENT TECHNOLOGIES (IAT), VOL 1, 2009, : 260 - 263
  • [47] A methodology to answer to individual queries : finding relevant and robust controls
    Delbianco F.
    Fioriti A.
    Tohmé F.
    Behaviormetrika, 2021, 48 (2) : 259 - 282
  • [48] Finding Top-k Approximate Answers to Path Queries
    Hurtado, Carlos A.
    Poulovassilis, Alexandra
    Wood, Peter T.
    FLEXIBLE QUERY ANSWERING SYSTEMS: 8TH INTERNATIONAL CONFERENCE, FQAS 2009, 2009, 5822 : 465 - 476
  • [49] Finding Paths in Sparse Random Graphs Requires Many Queries
    Ferber, Asaf
    Krivelevich, Michael
    Sudakov, Benny
    Vieira, Pedro
    RANDOM STRUCTURES & ALGORITHMS, 2017, 50 (01) : 71 - 85
  • [50] An algorithm for finding top-K valid XPath queries
    University of Tsukuba, Tsukuba, Ibaraki
    305-8550, Japan
    IPSJ Online Trans., 2014 (69-81):
12345