Hacker News new | ask | show | jobs
by ysleepy 1472 days ago
This looks cool, I've been looking at time series DBs lately and mostly landed with timescale because of the ability to have complete freedom querying the dataset with postgres kitchen sink.

The post here really focuses on one query and that is weirdly without a time sort. Would similar queries be also fast? - What about a join, aggregates, lag()-over, subqueries, unions, etc queries

2 comments

It does not look really convincing if you look deeper: https://telegra.ph/No-QuestDB-is-not-Faster-than-ClickHouse-...
You're right, this post focuses on filter queries with the WHERE clause. Aggregates are also pretty fast, a live demo is currently available with three datasets, one of them being more than 1.6 billion rows: https://demo.questdb.io/ On this you can also perform a join, in particular ASOF joins (where timestamps do not exactly match).

NB: The launch of this demo was done some time ago on HN: https://news.ycombinator.com/item?id=23616878