edited bounds

Author: jdeboi

source/tutorial/inserting-documents-into-a-sharded-collection.txt

@@ -31,15 +31,15 @@ keys of the data being inserted aren't evenly distributed, you may need to pre-s
 data before doing high volume inserts. As an example, consider a collection sharded by last
 name with the following key distribution:
 
-[-∞, "Henri") 
+(-∞, "Henri") 
 ["Henri", "Peters") 
 ["Peters",+∞) 
 
 Although the chunk ranges may be split evenly, inserting lots of users with with a common
 last name such as "Smith" will potentially hammer a single shard. Making the chunk range
 more granular in this portion of the alphabet may improve write performance.
 
-[-∞, "Henri") 
+(-∞, "Henri") 
 ["Henri", "Peters")
 ["Peters", "Smith"] 
 ["Smith", "Tyler"]
@@ -54,7 +54,7 @@ Documents with monotonically increasing shard keys, such as the BSON ObjectID, w
 be inserted into the last chunk in a collection. To illustrate why, consider a sharded
 collection with two chunks, the second of which has an unbounded upper limit. 
 
-[-∞, 100) 
+(-∞, 100) 
 [100,+∞)
 
 If the data being inserted has an increasing key, at any given time writes will always hit
@@ -157,5 +157,5 @@ use a dedicated mongos for the export and the import.
 
 https://jira.mongodb.org/browse/SERVER-4000
 
-Incremental Inserts
-~~~~~~~~~~~~~~~~~~~
+Pre-allocating Documents
+~~~~~~~~~~~~~~~~~~~~~~~~