Query Racing: Fast Completeness Certification of Query Results

Abstract : We present a general and effective method to certify completeness of query results on relational tables stored in an untrusted DBMS. Our main contribution is the concept of "Query Race": we split up a general query into several single attribute queries, and exploit concurrency and speed to bind the complexity to the fastest of them. Our method supports selection queries with general composition of conjunctive and disjunctive order-based conditions on different attributes at the same time. To achieve our results, we require neither previous knowledge of queries nor specific support by the DBMS. We validate our approach with experimental results performed on a prototypical implementation.
Document type :
Conference papers
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/hal-01056689
Contributor : Hal Ifip <>
Submitted on : Wednesday, August 20, 2014 - 1:24:13 PM
Last modification on : Wednesday, April 17, 2019 - 12:46:17 PM
Long-term archiving on : Thursday, November 27, 2014 - 11:48:37 AM

File

_27.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Bernardo Palazzi, Maurizio Pizzonia, Stefano Pucacco. Query Racing: Fast Completeness Certification of Query Results. 24th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy (DBSEC), Jun 2010, Rome, Italy. pp.177-192, ⟨10.1007/978-3-642-13739-6_12⟩. ⟨hal-01056689⟩

Share

Metrics

Record views

79

Files downloads

139