フリー問題

問題文

One part of an application joins five tables on every read, and another part reads a whole nested profile by its key. Which store fits each part, and what is the cost of the second choice?

選択肢

1. The joining part fits a relational store because the engine can plan a join across tables, and the profile fits a document store because one read returns the whole tree, but the second choice usually gives up the enforced schema and pushes the same value into many documents at once.
2. The joining part fits a relational store because the engine can plan a join across tables, and the profile fits a document store because one read returns the whole tree, but the second choice usually gives up the enforced ordering and pushes the same value into many tables at once.
3. The joining part fits a relational store because the engine can plan a patch across tables, and the profile fits a document store because one read returns the whole index, but the second choice usually gives up the enforced ordering and pushes the same value into many tables at once.
4. The joining part fits a relational store because the engine can plan a patch across tables, and the profile fits a document store because one read returns the whole index, but the second choice usually gives up the enforced schema and pushes the same value into many documents at once.