F1 Query: Declarative Querying at Google Scale [pdf] (vldb.org) 75 points by anuragbiyani 7y ago ↗ HN
[–] learning2write 7y ago ↗ Related Reading (FB Equivalent): https://www.facebook.com/notes/facebook-engineering/presto-i... [–] ebikelaw 7y ago ↗ 30000 queries per day, and 550000 queries per second seem like two radically different things. [–] learning2write 7y ago ↗ That number was from 2013. Don't underestimate exponential growth :) [–] azurezyq 7y ago ↗ This is for offline data analysis, more like Google's bigquery / Dremel. They are different things.
[–] ebikelaw 7y ago ↗ 30000 queries per day, and 550000 queries per second seem like two radically different things. [–] learning2write 7y ago ↗ That number was from 2013. Don't underestimate exponential growth :)
[–] azurezyq 7y ago ↗ This is for offline data analysis, more like Google's bigquery / Dremel. They are different things.
[–] willemave 7y ago ↗ I read this as we have so many query / data platforms so we're going to build another query standard to standardize all the query languages. Just another flavor of the standards problem. [–] utopcell 7y ago ↗ I see F1 as: ``what is the largest SQL subset we can support without compromising scalability.''
[–] utopcell 7y ago ↗ I see F1 as: ``what is the largest SQL subset we can support without compromising scalability.''
[–] mk926 7y ago ↗ What's relation with BigQuery? [–] azurezyq 7y ago ↗ Bq is based on Dremel, which is for data warehouse, not facing user traffic. You can find the original paper for Dremel easily.
[–] azurezyq 7y ago ↗ Bq is based on Dremel, which is for data warehouse, not facing user traffic. You can find the original paper for Dremel easily.
8 comments
[ 3.1 ms ] story [ 22.2 ms ] thread