BIROn - Birkbeck Institutional Research Online

    Exponential lower bounds and separation for query rewriting

    Kikot, Stanislav and Kontchakov, Roman and Podolskii, V. and Zakharyaschev, Michael (2012) Exponential lower bounds and separation for query rewriting. In: Czumaj, A. and Mehlhorn, K. and Pitts, A. and Wattenhofer, R. (eds.) Automata, Languages, and Programming. Lecture Notes in Computer Science 7392 7392. Berlin, Germany: Springer, pp. 263-274. ISBN 9783642315848.

    This is the latest version of this item.

    ICALP-final.pdf - Author's Accepted Manuscript

    Download (409kB) | Preview


    We establish connections between the size of circuits and formulas computing monotone Boolean functions and the size of first-order and nonrecursive Datalog rewritings for conjunctive queries over OWL 2 QL ontologies. We use known lower bounds and separation results from circuit complexity to prove similar results for the size of rewritings that do not use non-signature constants. For example, we show that, in the worst case, positive existential and nonrecursive Datalog rewritings are exponentially longer than the original queries; nonrecursive Datalog rewritings are in general exponentially more succinct than positive existential rewritings; while first-order rewritings can be superpolynomially more succinct than positive existential rewritings.


    Item Type: Book Section
    Additional Information: 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Roman Kontchakov
    Date Deposited: 13 May 2013 08:21
    Last Modified: 10 Jun 2021 05:39

    Available Versions of this Item


    Activity Overview
    6 month trend
    6 month trend

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item