Verifying the Correctness of Analytic Query Results

  title={Verifying the Correctness of Analytic Query Results},
  author={Masoud S. Nosrati and Ying Cai},
Data outsourcing is a cost-effective solution for data owners to tackle issues such as large volumes of data, huge number of users, and intensive computation needed for data analysis. They can simply upload their databases to a cloud and let it perform all management works, including query processing. One problem with this service model is how query issuers can verify the query results they receive are indeed correct. This concern is legitimate because, as a third party, clouds may not be fully… 

Figures from this paper


Authenticating Multi-dimensional Query Results in Data Publishing
This paper introduces a mechanism for users to verify that their query answers on a multi-dimensional dataset are correct, in the sense of being complete and authentic, by constructing certified chains on the points within each partition, as well as on all the partitions in the data space.
Verifying completeness of relational query results in data publishing
This paper introduces a scheme for users to verify that their query results are complete and authentic, and supports range selection on key and non-key attributes and join queries on relational databases.
Authentication of function queries
This work presents authentication solutions that work on a variety of functions, including univariate linear function, multivariatelinear function, and multivariate high degree function, based on the fact that the functions can be sorted in the subdomains defined by their intersections and thus can be chained to produce a signature mesh for query result verification.
Outsourcing multi-version key-value stores with verifiable data freshness
This paper proposes a memory-resident digest structure that utilizes limited memory effectively and can have efficient verification performance and is named IncBM-Tree because it can INCrementally build a Bloom filter-embedded Merkle Tree.
Authenticated indexing for outsourced spatial databases
The MR-tree is introduced, a space-efficient ADS that supports fast query processing and verification and the MR*-tree, a modified version of the MR- tree, which significantly reduces the VO size through a novel embedding technique.
Authenticated Top-K Aggregation in Distributed and Outsourced Databases
  • Sunoh Choi, Hyo-Sang Lim, E. Bertino
  • Computer Science
    2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing
  • 2012
This paper proposes a new algorithm, called Authenticated Three Phase Uniform Threshold (A-TPUT), which provides not only efficient top-k aggregation over distributed databases but also authentication on the top- k results.
Authentic Data Publication Over the Internet
This work gives techniques based on Merkle hash trees that publishers can use to provide authenticity and nonrepudiation of the answer to database queries posed by a client without requiring a key to be held in an on-line system.
Spatial Outsourcing for Location-based Services
It is shown, analytically and experimentally, that the MR-tree outperforms the VR-tree, usually by orders of magnitude, on all performance metrics, including construction cost, index size, query and verification overhead.
Reverse top-k queries
This work identifies a novel query type, namely reverse top-k query, that is essential for manufacturers to assess the potential market and impact of their products based on the competition, and introduces two versions of the query, namely monochromatic and bichromatic.
Querying a Collection of Continuous Functions
By interpreting the database as a set of user-defined functions, FQ can achieve the same functionality as existing analytic queries such as top-k query and scalar product query and outperform existing techniques in terms of various performance metrics.