SSBD SIGNED
Small Summaries for Big Data
Total Cost €
0EC-Contrib. €
0Partnership
0Views
0SSBD project word cloud
Explore the words cloud of the SSBD project. It provides you a very rough idea of what is the project "SSBD" about.
Project "SSBD" data sheet
The following table provides information about the project.
| Coordinator |
THE UNIVERSITY OF WARWICK
Organization address contact info |
| Coordinator Country | United Kingdom [UK] |
| Project website | https://gcormode.wordpress.com/ |
| Total cost | 1˙565˙502 € |
| EC max contribution | 1˙565˙502 € (100%) |
| Programme |
1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC)) |
| Code Call | ERC-2014-CoG |
| Funding Scheme | ERC-COG |
| Starting year | 2015 |
| Duration (year-month-day) | from 2015-05-01 to 2021-04-30 |
Partnership
Take a look of project's partnership.
| # | ||||
|---|---|---|---|---|
| 1 | THE UNIVERSITY OF WARWICK | UK (COVENTRY) | coordinator | 1˙565˙502.00 |
Map
Project objective
A fundamental challenge in processing the massive quantities of information generated by modern applications is in extracting suitable representations of the data that can be stored, manipulated and interrogated on a single machine. A promising approach is in the design and analysis of compact summaries: data structures which capture key features of the data, and which can be created effectively over distributed data sets. Popular summary structures include the Bloom filter, which compactly represents a set of items, and sketches which allow vector norms and products to be estimated. These are very attractive, since they can be computed in parallel and combined to yield a single, compact summary of the data. Yet the full potential of summaries is far from being fully realized.
The Principal Investigator will lead a team, working on important problems around creating Small Summaries for Big Data. The goal is to substantially advance the state of the art in data summarization, to the point where accurate and effective summaries are available for a wide array of problems, and can be used seamlessly in applications that process big data. Several directions will be pursued, including: designing and evaluating new summaries for fundamental computations such as tracking the data distribution; summary techniques for complex structures, such as massive matrices, massive graphs, and beyond; and summaries that allow the verification of outsourced computation over big data. Success in any one of these areas could lead to substantial impact on practice, as evidenced by the influence of existing summary techniques.
Support in the form of a five-year research grant will allow the PI to consolidate his research in this area, and build an expert team to focus on these challenging algorithmic questions.
Publications
| year | authors and title | journal | last update |
|---|---|---|---|
| 2019 |
Graham Cormode, Chris Hickey Efficient Interactive Proofs for Linear Algebra published pages: 48:1--48:19, ISSN: , DOI: 10.4230/lipics.isaac.2019.48 |
30th International Symposium on Algorithms and Computation (ISAAC 2019) | 2020-02-13 |
| 2019 |
Rajesh Chitnis, Graham Cormode Towards a Theory of Parameterized Streaming Algorithms published pages: 7:1--7:15, ISSN: , DOI: 10.4230/lipics.ipec.2019.7 |
14th International Symposium on Parameterized and Exact Computation (IPEC 2019) | 2020-02-13 |
| 2019 |
Graham Cormode, Tejas Kulkarni, Divesh Srivastava Answering Range Queries Under Local Differential Privacy. published pages: , ISSN: , DOI: |
PVLDB | 2020-02-12 |
| 2019 |
Graham Cormode, Tejas Kulkarni, Divesh Srivastava Constrained Private Mechanisms for Count Data published pages: 1-1, ISSN: 1041-4347, DOI: 10.1109/tkde.2019.2912179 |
IEEE Transactions on Knowledge and Data Engineering | 2020-02-12 |
| 2018 |
Charlie Dickens, Graham Cormode, David Woodruff Leveraging Well-Conditioned Bases: Streaming and Distributed Summaries in Minkowski p-Norms published pages: 1243-1251, ISSN: , DOI: |
Proceedings of the 35th International Conference on Machine Learning | 2020-02-12 |
| 2018 |
Graham Cormode, Chris Hickey Cheap checking for cloud computing: Statistical analysis via annotated data streams published pages: 1318-1326, ISSN: , DOI: |
Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics | 2020-02-12 |
| 2019 |
Amit Chakrabarti, Graham Cormode, Andrew McGregor, Justin Thaler, Suresh Venkatasubramanian Verifiable Stream Computation and Arthur--Merlin Communication published pages: 1265-1299, ISSN: 0097-5397, DOI: 10.1137/17m112289x |
SIAM Journal on Computing 48/4 | 2020-02-12 |
| 2019 |
Rajesh Chitnis, Andreas Emil Feldmann, Ondřej Suchý A Tight Lower Bound for Planar Steiner Orientation published pages: 3200-3216, ISSN: 0178-4617, DOI: 10.1007/s00453-019-00580-x |
Algorithmica 81/8 | 2020-02-12 |
| 2019 |
Graham Cormode, Hossein Jowhari L p Samplers and Their Applications published pages: 1-31, ISSN: 0360-0300, DOI: 10.1145/3297715 |
ACM Computing Surveys 52/1 | 2020-02-12 |
| 2018 |
Rajesh Chitnis, Nimrod Talmon Can We Create Large k-Cores by Adding Few Edges published pages: 78-89, ISSN: , DOI: 10.1007/978-3-319-90530-3_8 |
2020-02-12 | |
| 2016 |
Ge Luo, Lu Wang, Ke Yi, Graham Cormode Quantiles over data streams: experimental comparisons, new analyses, and further improvements published pages: 449-472, ISSN: 1066-8888, DOI: 10.1007/s00778-016-0424-7 |
The VLDB Journal 25/4 | 2020-02-12 |
| 2017 |
Graham Cormode Streaming Methods in Data Analysis published pages: 3-6, ISSN: , DOI: 10.1007/978-3-319-20424-6_1 |
2020-02-12 | |
| 2017 |
Graham Cormode Data sketching published pages: 48-55, ISSN: 0001-0782, DOI: 10.1145/3080008 |
Communications of the ACM 60/9 | 2020-02-12 |
| 2018 |
Rajesh Chitnis, Andreas Emil Feldmann A Tight Lower Bound for Steiner Orientation published pages: 65-77, ISSN: , DOI: 10.1007/978-3-319-90530-3_7 |
2020-02-12 | |
| 2016 |
Amit Chakrabarti, Graham Cormode, Andrew McGregor Robust lower bounds for communication and stream computation published pages: 1-35, ISSN: 1557-2862, DOI: 10.4086/toc.2016.v012a010 |
Theory of Computing 12/1 | 2020-02-12 |
| 2018 |
Graham Cormode, Anirban Dasgupta, Amit Goyal, Chi Hoon Lee An evaluation of multi-probe locality sensitive hashing for computing similarities over web-scale query logs published pages: e0191175, ISSN: 1932-6203, DOI: 10.1371/journal.pone.0191175 |
PLOS ONE 13/1 | 2020-02-12 |
| 2018 |
Sandip Banerjee, Sujoy Bhore, Rajesh Chitnis Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets published pages: 80-93, ISSN: , DOI: 10.1007/978-3-319-77404-6_7 |
2020-02-12 | |
| 2017 |
Graham Cormode, Hossein Jowhari A second look at counting triangles in graph streams (corrected) published pages: 22-30, ISSN: 0304-3975, DOI: 10.1016/j.tcs.2016.06.020 |
Theoretical Computer Science 683 | 2020-02-12 |
| 2016 |
Edith Cohen, Graham Cormode, Nick Duffield, Carsten Lund On the Tradeoff between Stability and Fit published pages: 1-24, ISSN: 1549-6325, DOI: 10.1145/2963103 |
ACM Transactions on Algorithms 13/1 | 2020-02-12 |
| 2015 |
Ahn, Kook-Jin, Cormode, Graham, Guha, Sudipto, McGregor, Andrew and Wirth, Anthony Ian Correlation clustering in data streams published pages: 2237–2246, ISSN: , DOI: |
Proceedings of the 32nd International Conference on Machine Learning 32 | 2020-02-12 |
Are you the coordinator (or a participant) of this project? Plaese send me more information about the "SSBD" project.
For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.
Send me an email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.
Thanks. And then put a link of this page into your project's website.
The information about "SSBD" are provided by the European Opendata Portal: CORDIS opendata.