Consistent Schema-Less Scalable Storage System for Orders

1. A method, comprising: assigning a plurality of identifier ranges to a corresponding plurality of data stores, each identifier within the plurality of identifier ranges identifying an order of an electronic marketplace; serializing a plurality of fields of an order having a first order identifier; identifying a first data store of the plurality of data stores based on a range assigned to the first data store and the first order identifier; storing, to the first data store, a first binary large object (BLOB) comprising the serialized plurality of fields, the first BLOB stored in association with the first order identifier; serializing a second plurality of fields of the order; storing, to the first data store, a second BLOB comprising the serialized second plurality of fields in association with the first order identifier; accessing, by a first version of a software application, only the first BLOB; and accessing, by a second version of the software application, the first BLOB and the second BLOB.

2. The method of claim 1 , further comprising obtaining, by the first version of the software application, an optimistic lock on the first BLOB.

3. The method of claim 1 , further comprising writing a table to the first data store, the table comprising a subset of the plurality of fields in a searchable format.

4. The method of claim 3 , further comprising generating the table to include the first order identifier.

5. The method of claim 4 , wherein the first order identifier is an index for both the table and the first data store.

6. The method of claim 4 , further comprising: searching, by the second version of the application, the table for an attribute; identifying, based on the searching of the table, a second order identifier associated with the attribute; second searching, based on the second order identifier, the first data store; and accessing, by the second version of the application, at least a third BLOB based on the second searching.

7. The method of claim 4 , further comprising: searching, by the first version of the application, the table for an order type; identifying, based on the searching, a second order identifier which is associated with the order type; second searching, based on the second order identifier, the first data store; and accessing, by the first version of the application, at least a third BLOB based on the second searching.

8. A system, comprising: hardware processing circuitry; one or more hardware memories comprising instructions that when executed configure the hardware processing circuitry to perform operations comprising: assigning a plurality of identifier ranges to a corresponding plurality of data stores, each identifier within the plurality of identifier ranges identifying an order of an electronic marketplace; serializing a plurality of fields of an order having a first order identifier; identifying a first data store of the plurality of data stores based on a range assigned to the first data store and the first order identifier; storing, to the first data store, a first binary large object (BLOB) comprising the serialized plurality of fields, the first BLOB stored in association with the first order identifier; serializing a second plurality of fields of the order; storing, to the first data store, a second BLOB comprising the serialized second plurality of fields in association with the first order identifier; accessing, by a first version of a software application, only the first BLOB; and accessing, by a second version of the software application, the first BLOB and the second BLOB.

9. The system of claim 8 , the operations further comprising obtaining, by the first version of the software application, an optimistic lock on the first BLOB.

10. The system of claim 8 , the operations further comprising writing a table to the first data store, the table comprising a subset of the plurality of fields in a searchable format.

11. The system of claim 10 , the operations further comprising generating the table to include the first order identifier.

12. The system of claim 11 , wherein the first order identifier is an index for both the table and the first data store.

13. The system of claim 11 , the operations further comprising: searching, by the second version of the application, the table for an attribute; identifying, based on the searching of the table, a second order identifier associated with the attribute; second searching, based on the second order identifier, the first data store; and accessing, by the second version of the application, at least a third BLOB based on the second searching.

14. The system of claim 11 , the operations further comprising: searching, by the first version of the application, the table for an order type; identifying, based on the searching, a second order identifier which is associated with the order type; second searching, based on the second order identifier, the first data store; and accessing, by the first version of the application, at least a third BLOB based on the second searching.

15. A non-transitory computer readable storage medium comprising instructions that when executed configure hardware processing circuitry to perform operations comprising: assigning a plurality of identifier ranges to a corresponding plurality of data stores, each identifier within the plurality of identifier ranges identifying an order of an electronic marketplace; serializing a plurality of fields of an order having a first order identifier; identifying a first data store of the plurality of data stores based on a range assigned to the first data store and the first order identifier; storing, to the first data store, a first binary large object (BLOB) comprising the serialized plurality of fields, the first BLOB stored in association with the first order identifier; serializing a second plurality of fields of the order; storing, to the first data store, a second BLOB comprising the serialized second plurality of fields in association with the first order identifier; accessing, by a first version of a software application, only the first BLOB; and accessing, by a second version of the software application, the first BLOB and the second BLOB.

16. The non-transitory computer readable storage medium of claim 15 , the operations further comprising obtaining, by the first version of the software application, an optimistic lock on the first BLOB.

17. The non-transitory computer readable storage medium of claim 15 , the operations further comprising writing a table to the first data store, the table comprising a subset of the plurality of fields in a searchable format.

18. The non-transitory computer readable storage medium of claim 17 , the operations further comprising generating the table to include the first order identifier.

19. The non-transitory computer readable storage medium of claim 18 , wherein the first order identifier is an index for both the table and the first data store.

20. The non-transitory computer readable storage medium of claim 18 , the operations further comprising: searching, by the second version of the application, the table for an attribute; identifying, based on the searching of the table, a second order identifier associated with the attribute; second searching, based on the second order identifier, the first data store; and accessing, by the second version of the application, at least a third BLOB based on the second searching.