2010
DOI: 10.1007/978-3-642-13739-6_12
|View full text |Cite
|
Sign up to set email alerts
|

Query Racing: Fast Completeness Certification of Query Results

Abstract: 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 14 publications
(11 citation statements)
references
References 26 publications
0
11
0
Order By: Relevance
“…Some notable works in this direction are reported in [17,14,5,7,18,23,25,36]. These techniques involve using a special data structure along with some cryptographic authentication mechanism like hash functions and/or signatures schemes.…”
Section: Incomplete Resultmentioning
confidence: 99%
“…Some notable works in this direction are reported in [17,14,5,7,18,23,25,36]. These techniques involve using a special data structure along with some cryptographic authentication mechanism like hash functions and/or signatures schemes.…”
Section: Incomplete Resultmentioning
confidence: 99%
“…Palazzi [16,17] constructs one skip list for each searchable column in each table. An important problem with this scheme is that for multi-dimensional queries, only the result of one skip list (determined by the First Column Returned approach [16], or the fastest one [17]) is used.…”
Section: Related Workmentioning
confidence: 99%
“…An important problem with this scheme is that for multi-dimensional queries, only the result of one skip list (determined by the First Column Returned approach [16], or the fastest one [17]) is used. The result set is sent to the client who will apply the other clauses.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…• The tree-based approach: Basically, this approach uses the Merkle hash tree [15] or its variants to index search keys [11,17,13,7,16,31,20,21]. As a result, this approach leads to logarithmic complexity in terms of both communication and verification, possibly with some further tricks (e.g., using the Merkle hash tree to maintain signatures at multiple hash tree levels [11]).…”
Section: Related Workmentioning
confidence: 99%