Sorting in case of Sharding in mongodb

Question

I implemented sharding in mongodb when we outlined a collection of up to two mongod skulls based on a hashed fragment key, so that it performs parallel sorting inside the fragments. After that, how does it sort the collection based on _id? and what other considerations might be? what:

• Limiting the hashed fragment key?
• What sorting procedure does the mongo query router use to sort records received from fragments?
• Will the request be affected due to network latency?

Answer 1

• Not sure.

• , mongo , , , - . , . . mongos docs

• .

( , Google .)