Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
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.
This invention relates to a method for managing and retrieving data in a distributed application environment, particularly where multiple versions of an application interact with shared data stores. The problem addressed involves efficiently accessing and retrieving binary large objects (BLOBs) from a data store based on dynamic order types and identifiers, ensuring compatibility and consistency across different application versions. The method involves a first version of an application searching a table for a specific order type. Upon identifying the order type, the application retrieves a second order identifier associated with that type. Using this second order identifier, the application performs a second search in a first data store to locate and access at least one BLOB. This process ensures that the correct BLOB data is retrieved based on the order type and identifier, maintaining data integrity and accessibility across different application versions. The method leverages a structured approach to data retrieval, where order types and identifiers serve as keys to locate and access BLOBs in a data store. This ensures that even if multiple versions of the application are in use, the data retrieval process remains consistent and reliable. The invention is particularly useful in environments where applications frequently update or where data must be shared across different versions of an application.
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.
The system is designed for managing order data in an electronic marketplace, addressing challenges related to version compatibility and efficient data storage. The system uses hardware processing circuitry and memory to assign distinct identifier ranges to multiple data stores, where each identifier corresponds to an order in the marketplace. Orders are serialized into binary large objects (BLOBs) containing their fields, with each BLOB stored in a specific data store based on the order's identifier range. The system supports multiple versions of a software application by storing different serialized versions of the same order in the same data store. Older application versions access only the initial BLOB, while newer versions can access both the initial and updated BLOBs. This approach ensures backward compatibility while allowing for data evolution without disrupting existing applications. The system efficiently organizes order data across distributed stores, enabling scalable and version-tolerant access to marketplace orders.
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.
A system for managing data in a distributed computing environment addresses the challenge of concurrent access conflicts when multiple users or processes attempt to modify the same data. The system includes a software application that operates in multiple versions, where each version can independently access and modify a binary large object (BLOB) stored in a database. The system ensures data consistency by implementing an optimistic locking mechanism, which allows a version of the software application to obtain an exclusive lock on the BLOB before making modifications. This lock prevents other versions from overwriting changes until the current version releases the lock, thereby reducing conflicts and maintaining data integrity. The system also includes a synchronization mechanism that propagates changes made by one version to other versions, ensuring all instances of the software application remain up-to-date. The optimistic lock is obtained by the first version of the software application before modifying the BLOB, ensuring that concurrent modifications do not result in data corruption or loss. This approach improves collaboration in distributed environments by minimizing conflicts and ensuring that all users work with the latest version of the data.
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.
A system for managing data in a distributed computing environment addresses the challenge of efficiently organizing and retrieving information across multiple nodes. The system includes a distributed storage mechanism that stores data objects in a decentralized manner, ensuring high availability and fault tolerance. A query processing module receives requests for data and processes them by locating the relevant data objects across the distributed storage. The system also includes a metadata management module that maintains metadata about the stored data objects, such as their locations, access permissions, and other attributes, to facilitate efficient retrieval and management. The system further includes a table generation module that creates structured tables to organize the metadata and data objects. These tables include identifiers that uniquely reference the data objects, allowing for quick lookup and retrieval. The table generation module ensures that the tables are dynamically updated as new data objects are added or existing ones are modified, maintaining consistency across the distributed system. Additionally, the system includes a first-order identifier, which is a unique reference assigned to each data object at the time of creation. This identifier is included in the generated tables to provide a direct and unambiguous way to access the data objects, improving the efficiency of data retrieval operations. The system may also include a synchronization module that ensures the tables and identifiers remain consistent across all nodes in the distributed environment, even in the presence of network partitions or node failures.
12. The system of claim 11 , wherein the first order identifier is an index for both the table and the first data store.
A system for managing data storage and retrieval involves organizing data in a structured format to improve efficiency. The system includes a table that stores data entries, each associated with a first order identifier. This identifier serves as an index for both the table and a first data store, enabling quick access to the corresponding data. The first data store contains data entries linked to the table, and the system may also include a second data store for additional data entries. The system further includes a processor that executes instructions to perform operations such as retrieving data from the table or the first data store based on the first order identifier. The system may also include a user interface for interacting with the data, allowing users to input or retrieve information. The first order identifier ensures that data can be efficiently located and accessed, reducing search time and improving overall system performance. The system may also include a network interface for remote data access, enabling users to interact with the data from different locations. The use of the first order identifier as an index for both the table and the first data store simplifies data management and enhances retrieval speed.
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.
This invention relates to data storage and retrieval systems, specifically addressing the challenge of efficiently organizing and accessing large datasets. The system involves a non-transitory computer-readable storage medium containing instructions for performing operations that include writing a table to a first data store. The table contains a subset of fields from a larger dataset, formatted for searchability. This allows users to quickly locate specific information without processing the entire dataset. The table is generated by extracting relevant fields from the original data, ensuring that only the most critical information is included. The searchable format enables fast querying, improving performance in applications requiring rapid data access. The system may also involve additional operations such as validating the data before writing it to the table, ensuring accuracy and consistency. By storing a subset of fields in a structured, searchable format, the invention optimizes storage efficiency and retrieval speed, making it particularly useful in databases, data warehouses, or any system handling large volumes of information.
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.
Unknown
February 2, 2021
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.