An array cannot contain another array value as one of its elements.

Within an array, elements maintain the position assigned to them. When sorting two or more arrays, arrays are ordered based on their element values.

When comparing two arrays, the first elements of each array are compared. If the first elements are equal, then the second elements are compared and so on until a difference is found. If an array runs out of elements to compare but is equal up to that point, then the shorter array is ordered before the longer array.

For example,[1, 2, 3]< [1, 2, 3, 1]< [2]. The array[2] has the greatest first element value. The array[1, 2, 3] has elements equal to the first three elements of[1, 2, 3, 1] but is shorter in length.

Represents an object embedded within a document. When indexed, you can queryon subfields. If you exclude this value from indexing, then all subfields are also excluded from indexing.

Key ordering is always sorted. For example, if you write{c: "foo", a: "bar", b: "qux"} the map is sorted by key and saved as{a: "bar", b: "qux", c: "foo"}.

Map fields are sorted by key and compared by key-value pairs, first comparing the keys and then the values. If the first key-value pairs are equal, the next key-value pairs are compared, and so on. If two maps have all of the same key-value pairs, then map length is considered. For example, the following maps are in ascending order:

{a: "aaa", b: "baz"}
{a: "foo", b: "bar"}
{a: "foo", b: "bar", c: "qux"}
{a: "foo", b: "baz"}
{b: "aaa", c: "baz"}
{c: "aaa"}