Coder Social home page Coder Social logo

elastic-sensitivity-experiments's Introduction

Overview

This class calculates error of elastic sensitivity-based differential privacy for queries from the TCP-H benchmark.

Building & Running

sbt run

Generating benchmark data

The /data directory contains the generated SQL queries and results of each query executed on a populated database with scale factor 1.

If you want to regenerate the queries and database from scratch, see the instructions in data/README.txt. You will need to import the data into a relational database to execute the benchmark queries.

elastic-sensitivity-experiments's People

Contributors

jnear avatar noahj avatar

Stargazers

YC.kong avatar  avatar harapan avatar Michael Tu avatar Mahmoud Rusty Abdelkader avatar  avatar  avatar NTAbraham avatar

Watchers

Richard Shin avatar James Cloos avatar  avatar  avatar Chao Zhang avatar  avatar  avatar Xinyun Chen avatar  avatar  avatar

elastic-sensitivity-experiments's Issues

Query 16 question

Hi folks! Me again. =/

I don't understand how query 16 works for you, and I thought I would talk through the inconsistencies I see.

Query 16 involves a join with suppliers: it reports for each (brand, type, size) the number of distinct suppliers of such a part who have no customer complaints in their comments field. Complaints seems like sensitive information for the supplier, and if each of the counts of any parts they supply changed as a result, that could leak through. Suppliers supply exactly 80 parts each, because skew doesn't exist in TPCH it seems, which makes me think that with 0.1-DP you'll need error of magnitude at least 800.

Each part is only supplied by four suppliers (this is all at scale factor 1), and almost all (brand, type, size) triples are represented by just a few parts (2/3rds by just one) so this noise should be pretty significant, I would think. That is, 800 relative to 4.

According to your schema the supplier relation is not public, but also there is no max_freq for PS_SUPPKEY in the partsupp relation. This is where I was expecting to see 80. Is it possible that this bound is just missing, and that when absent the analysis is overly optimistic?

Possibly related: in Query 04 you indicate in the paper that there is no join, but there is a join on orderkey between lineitem and orders (count orders with late lineitems, by priority). Should this join be present too? It seems like the cardinality isn't high (in PINQ it would be a join with a distinct applied to the order keys in late lineitems; cardinality one), but something should be there, right?

Is there a cute way you are getting around exists and not in fragments for these two queries?

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.