Distributed multidimensional range search system and method

A computer-implemented method for managing a plurality of data objects including dimensional attributes to facilitate distribution of computational and storage loads, the method comprising:

• receiving a plurality of data objects including dimensional attributes corresponding to at least one of a two dimensional geographic area and geographic coordinates within the geographic area;
• assigning each of a plurality of storage nodes to at least one of a plurality of keyspace positions of a keyspace, wherein the plurality of storage nodes define partitions of the keyspace wherein the plurality of storage nodes comprise a plurality of network-connectable computing devices;
• applying a space filling curve to the dimensional attributes of each of the plurality of data objects to generate a plurality of key values which correspond to the plurality of keyspace positions;
• and
• transmitting each of the plurality of data objects to at least one of the plurality of storage nodes assigned to a keyspace position corresponding to the key value of the respective data object.

A computer-implemented method for managing a plurality of data objects including dimensional attributes to facilitate distribution of computational and storage loads, the method comprising:

• receiving a plurality of data objects including dimensional attributes;
• assigning each of a plurality of storage nodes to at least one of a plurality of keyspace positions of a keyspace, wherein the plurality of storage nodes define partitions of the keyspace wherein the plurality of storage nodes comprise a plurality of network-connectable computing devices, and wherein at least one of the plurality of storage nodes is assigned to a plurality of positions of the keyspace at a particular time, whereby one of the plurality of storage nodes can define a plurality of the keyspace partitions;
• applying a space filling curve to the dimensional attributes of each of the plurality of data objects to generate a plurality of key values which correspond to the plurality of keyspace positions;
• and
• transmitting each of the plurality of data objects to at least one of the plurality of storage nodes assigned to a keyspace position corresponding to the key value of the respective data object.

A computer-implemented method for managing a plurality of data objects including dimensional attributes to facilitate distribution of computational and storage loads, the method comprising:

• receiving a plurality of data objects including spatial dimensional attributes and time attributes;
• assigning each of a plurality of storage nodes to at least one of a plurality of keyspace positions of a keyspace, wherein the plurality of storage nodes define partitions of the keyspace wherein the plurality of storage nodes comprise a plurality of network-connectable computing devices;
• applying a space filling curve to the dimensional attributes of each of the plurality of data objects to generate a plurality of key values which correspond to the plurality of keyspace positions, wherein generating the plurality of key values based on the time attributes of the plurality objects, wherein each key value corresponds to at least one spatial dimensional attribute and at least one time attribute;
• and
• transmitting each of the plurality of data objects to at least one of the plurality of storage nodes assigned to a keyspace position corresponding to the key value of the respective data object.

A system for managing a plurality of data objects including dimensional attributes to facilitate distribution of computational and storage loads, the system comprising at least one computing device including at least one memory comprising instructions operable to enable the computing device to perform a procedure comprising:

• receiving a plurality of data objects including dimensional attributes;
• assigning each of a plurality of storage nodes to at least one of a plurality of keyspace positions of a keyspace, wherein the plurality of storage nodes define partitions of the keyspace wherein the plurality of storage nodes comprise a plurality of network-connectable computing devices;
• applying a space filling curve to the dimensional attributes of each of the plurality of data objects to generate a plurality of key values which correspond to the plurality of keyspace positions;
• and
• transmitting each of the plurality of data objects to at least one of the plurality of storage nodes assigned to a keyspace position corresponding to the key value of the respective data object;
• wherein the plurality of storage nodes are assigned to the plurality of keyspace positions based on a function including a non-uniform random variable, wherein the plurality of storage nodes are assigned on the basis of the probability of the occurrence of particular dimensional attributes corresponding to a particular key value, wherein storage nodes assigned to keyspace positions corresponding to a first probability of occurrence are greater than storage nodes assigned to keyspace positions associated with a second probability of occurrence, wherein the first probability is greater than the second probability.