Approximate schemas, source-consistency and query answering

被引：0
|
作者：
Michel de Rougemont
Adrien Vieilleribière
机构：
[1] University Paris-II,CNRS
[2] University Paris-Sud,LRI
来源：
Journal of Intelligent Information Systems | 2008年 / 31卷
关键词：
Approximate schemas; Source-consistency; Query answering; Distances; Complexity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are ε-close if every word (tree) of one language is ε-close to the other. A transducer model is introduced to compare tree languages (schemas) with different alphabets and attributes. Using the statistical embedding of Fischer et al. (Proceedings of 21st IEEE Symposium on Logic in Computer Science, pp. 421–430, 2006), we show that Source-Consistency and Approximate Query Answering are testable on words and trees, i.e. can be approximately decided within ε by only looking at a constant fraction of the input.
引用
收藏
页码：127 / 146
页数：19
相关论文
共 50 条
  • [11] An Evolutionary Perspective on Approximate RDF Query Answering
    Gueret, Christophe
    Oren, Eyal
    Schlobach, Stefan
    Schut, Martijn
    SCALABLE UNCERTAINTY MANAGEMENT, SUM 2008, 2008, 5291 : 215 - 228
  • [12] Approximate Query Answering by Twig Level Analysis
    Sijin, P.
    Champa, H. N.
    PROCEEDINGS OF THE 2021 FIFTH INTERNATIONAL CONFERENCE ON I-SMAC (IOT IN SOCIAL, MOBILE, ANALYTICS AND CLOUD) (I-SMAC 2021), 2021, : 942 - 950
  • [13] Overcoming limitations of approximate query answering in OLAP
    Cuzzocrea, A
    9TH INTERNATIONAL DATABASE ENGINEERING & APPLICATION SYMPOSIUM, PROCEEDINGS, 2005, : 200 - 209
  • [14] Approximate Query Answering over Open Data
    Zhang, Mengqi
    Mundra, Pranay
    Chikweze, Chukwubuikem
    Nargesian, Fatemeh
    Weikum, Gerhard
    WORKSHOP ON HUMAN-IN-THE-LOOP DATA ANALYTICS, HILDA 2023, 2023,
  • [15] Relaxed Marginal Consistency for Differentially Private Query Answering
    McKenna, Ryan
    Pradhan, Siddhant
    Sheldon, Daniel
    Miklau, Gerome
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [16] Approximate Query Answering in Complex Gaussian Mixture Models
    Hartwig, Mattis
    Gehrke, Marcel
    Moeller, Ralf
    2019 10TH IEEE INTERNATIONAL CONFERENCE ON BIG KNOWLEDGE (ICBK 2019), 2019, : 81 - 86
  • [17] Approximate Query Answering and Result Refinement on XML Data
    Seidler, Katja
    Peukert, Eric
    Hackenbroich, Gregor
    Lehner, Wolfgang
    SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT, 2010, 6187 : 78 - +
  • [18] Approximate query answering using data warehouse striping
    Bernardino, JR
    Furtado, PS
    Madeira, HC
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2002, 19 (02) : 145 - 167
  • [19] Approximate query answering for a heterogeneous XML document base
    Mandreoli, F
    Martoglia, R
    Tiberio, P
    WEB INFORMATION SYSTEMS - WISE 2004, PROCEEDINGS, 2004, 3306 : 337 - 351
  • [20] Approximate query answering on sensor network data streams
    Cuzzocrea, A
    Furfaro, F
    Masciari, E
    Saccà, D
    Sirangelo, C
    GEOSENSOR NETWORKS, 2005, : 53 - 72
12345