O'Reilly logo

DynamoDB Applied Design Patterns by Prabhakaran Kuppusamy, Uchit Vyas

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Parallel scanning

As we discussed in DynamoDB sharding, the table data is partitioned based on the hash key value. Even though this sharding will smoothen the read and write operations, it doesn't help us to scan the partitions in parallel. For example, if the table data is available in five partitions (each partition has a throughput capacity of five units), then even if the table could provision more than five capacity units, it cannot do so. The maximum throughput capacity of the table cannot exceed the fastest (having high throughput) partition. So based on these facts, what we infer is:

  • A scan operation will return maximum 1 MB of data at a time
  • Scan operations can read data from only one partition at a time
  • For a larger table, no matter how ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required