Hard
Your application is a directory of addresses saved in a single database table / document. Each entry contains:
-
A name, address (number and street name) and a postal code
-
The name of the entry creator (unique).
All users of your application can access all addresses in the database.
Users can only request all entries with a certain postal code.
You are asked to partition this table.
That means
-
Replicating the table on multiple slave servers to distribute queries
-
Splitting the table into multiple sub-tables, with each entry appearing in only one table
What are the possible partitioning keys to ensure that each query only reaches one table:
Author: Kevin LefevreStatus: PublishedQuestion passed 204 times
Edit
0
Community EvaluationsNo one has reviewed this question yet, be the first!
Similar QuestionsMore questions about IS Architecture
0
Explain the different types of caching in the context of an information system architecture.0
What are the characteristics of a data warehouse?0
A is faster than B, C is as fast as A, C is faster than B0
Which of the following networks has the highest bandwidth? A, B, or C?0
A network has 3 routers, A, B and C. A and B are connected to each other. B and C are connected to each other. A and C are not connected to each other. A has 1000 packets. B has 2000 packets. C has 3000 packets. How many packets are in the network?