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. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Palazzi, B., Pizzonia, M., & Pucacco, S. (2010). Query racing: Fast completeness certification of query results. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6166 LNCS, pp. 177–192). https://doi.org/10.1007/978-3-642-13739-6_12
Mendeley helps you to discover research relevant for your work.