Adler, I and Harwath, F (2018) Property Testing for Bounded Degree Databases. In: 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018). STACS 2018, 28 Feb - 03 Mar 2018, Caen, France. Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , 6:1-6:14. ISBN 978-3-95977-062-0
Abstract
Aiming at extremely efficient algorithms for big data sets, we introduce property testing of relational databases of bounded degree. Our model generalises the bounded degree model for graphs (Goldreich and Ron, STOC 1997). We prove that in this model, if the databases have bounded tree-width, then every query definable in monadic second-order logic with modulo counting is testable with a constant number of oracle queries and polylogarithmic running time. This is the first logical meta-theorem in property testing of sparse models. Furthermore, we discuss conditions for the existence of uniform and non-uniform testers.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | (c) Isolde Adler and Frederik Harwath; licensed under Creative Commons License CC-BY. (https://creativecommons.org/licenses/by/3.0/) |
Keywords: | Logic and Databases; Property Testing; Logical Meta-theorems; Bounded |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 30 Jan 2018 11:25 |
Last Modified: | 25 Jun 2023 21:13 |
Status: | Published |
Publisher: | Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik |
Identification Number: | 10.4230/LIPIcs.STACS.2018.6 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:126769 |