Is NoSQL in general, and DynamoDB in particular, well suited to performing greatest-n-per-group type queries, as compared to MySQL?
相关问题
- .Net Core DynamodDB unit testing with XUnit
- DynamoDB Stream in-ordering processing
- postgres: get top n occurrences of a value within
- MongoDB: groupby subdocument and count + add total
- MySQL get last date records from multiple
相关文章
- How to batch_get_item many items at once given a l
- How does Cassandra scale horizontally ?
- Modelling a Chat like Application in Firebase
- Dynamo DB + In put Item Request how to pass null v
- DynamoDB: How can I create a table with nested JSO
- Error: “The security token included in the request
- NoSQL Injection? (PHP->phpcassa->Cassandra)
- Read capacity cost of a DynamoDB table scan
DynamoDB support only 2 index and can only be queried efficiently on these.
Using DynamoDB to find the biggest values in a random "row" is not a good idea at all. Querying on a random row implies scanning the whole dataset which will cost you a lot of money.
Nonetheless, if your data is properly modeled, query method may be used to find the biggest range_key for a given hash_key
Here is how to proceed: