Data exchange: On the complexity of answering queries with inequalities

被引：10
|
作者：
Madry, A [1 ]
机构：
[1] Univ Wroclaw, Inst Comp Sci, PL-50138 Wroclaw, Poland
来源：
INFORMATION PROCESSING LETTERS | 2005年 / 94卷 / 06期
关键词：
data exchange; query answering; certain answers; computational complexity;
D O I：
10.1016/j.ipl.2005.03.001
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The complexity of answering Boolean queries and the local-as-view (LAV) setting, which is a special case of the general data exchange problem setting, is described. It is observed that the certain answers for queries being unions of conjunctive queries can be computed in polynomial time. There is a polynomial-time algorithm for computing the certain answers of unions of conjunctive queries with at most one inequality per disjunct. Thus the minimal number of inequalities giving rise to co-NP-hardness of this problem is at least two and six at most.
引用
收藏
页码：253 / 257
页数：5
相关论文
共 50 条
  • [21] Answering Count Queries for Genomic Data With Perfect Privacy
    Jiang, Bo
    Seif, Mohamed
    Tandon, Ravi
    Li, Ming
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2023, 18 : 3862 - 3875
  • [22] The approach for data warehouse to answering spatial OLAP queries
    Li, Y
    Chen, Y
    Rao, FY
    INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING, 2003, 2690 : 270 - 277
  • [23] ON THE COMPLEXITY OF QUERIES IN THE LOGICAL DATA MODEL
    KUPER, GM
    VARDI, MY
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 326 : 267 - 280
  • [24] ON THE COMPLEXITY OF QUERIES IN THE LOGICAL DATA MODEL
    KUPER, GM
    VARDI, MY
    THEORETICAL COMPUTER SCIENCE, 1993, 116 (01) : 33 - 57
  • [25] The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints
    Koutris, Paraschos
    Wijsen, Jef
    PODS'15: PROCEEDINGS OF THE 33RD ACM SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, 2015, : 17 - 29
  • [26] Data exchange: semantics and query answering
    Fagin, R
    Kolaitis, PG
    Miller, RJ
    Popa, L
    THEORETICAL COMPUTER SCIENCE, 2005, 336 (01) : 89 - 124
  • [27] Data exchange: Semantics and query answering
    Fagin, R
    Kolaitis, PG
    Miller, RJ
    Popa, L
    DATABASE THEORY ICDT 2003, PROCEEDINGS, 2003, 2572 : 207 - 224
  • [28] A distributed system for answering range queries on sensor network data
    Cuzzocrea, A
    Furfaro, F
    Greco, S
    Masciari, E
    Mazzeo, GM
    Saccà, D
    THIRD IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS, WORKSHOPS, 2005, : 369 - 373
  • [29] Capturing Continuous Data and Answering Aggregate Queries in Probabilistic XML
    Abiteboul, Serge
    Chan, T. -H. Hubert
    Kharlamov, Evgeny
    Nutt, Werner
    Senellart, Pierre
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2011, 36 (04):
  • [30] A Neural Database for Answering Aggregate Queries on Incomplete Relational Data
    Zeighami, Sepanta
    Seshadri, Raghav
    Shahabi, Cyrus
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (07) : 2790 - 2802
12345