# US 2022/0035876 A1 · Systems and Methods for Clustered Inventory Management

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2022/0035876 A1
- Document ID: US20220035876A1
- Status: Published application
- Kind: A1
- Application number: 16/983,733
- Filed: 2020-08-03
- Published: 2022-02-03
- Earliest claimed: 2020-08-03
- Assignees: Walmart Apollo, LLC
- Applicants: Walmart Apollo, LLC
- Inventors: Bala Srinivas Pillarisetty; Sermandurai Venkatachalam Konar; Harikrishnan Ramakrishna Pillai; Santhosh Kumar Ramalingam; Chandni Jain
- Web page: https://patentgrep.com/patent/US20220035876A1

## CPC

- G06F 16/953: Querying, e.g. by the use of web search engines
- G06F 16/93: Document management systems
- G06Q 10/087: Inventory or stock management, e.g. order filling, procurement or balancing against orders
- G06Q 10/0877: {by inventory control or reporting using inventory tracking or counting}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

An inventory management system may have at least one document database and a search server. The search server may have a data structure engine storing a hierarchical data structure, at least one indexing engine, and a non-transitory computer readable medium having instructions, wherein the instructions, when executed by a processor cause the search server to receive an input document, parse one or more sub documents from the input document, prepare a search document based on the one or more sub documents, and update, by the data structure engine, the hierarchical data structure based on the search document. The search engine may further construct a relationship query based on a query for information and the hierarchical data structure, determine one or more sub documents responsive to the relationship query based on the hierarchical data structure, and extract information requested by the query from the sub documents.

## Claims

### Claim 1

A system comprising:
at least one document database storing a plurality of documents containing data; and
a search server communicatively coupled to the document database, the search server comprising a data structure engine storing a hierarchical data structure, at least one indexing engine, and a non-transitory computer readable medium having instructions stored thereon, wherein the instructions, when executed by a processor cause the search server to:
receive an input document from the document database;
parse one or more sub documents from the input document;
prepare a search document based on the one or more sub documents;
update, by the data structure engine, the hierarchical data structure based on the search document; and
in response to a query for information from the input document:
construct a relationship query based on the query for information and the hierarchical data structure;
determine, by the search server, one or more sub documents responsive to the relationship query based on the hierarchical data structure; and
extract information requested by the query from the one or more sub documents responsive to the relationship query.

### Claim 2 (depends on 1)

The system of claim 1, wherein preparing the search document comprises assigning a relationship between a sub document parsed from the input document and stored data in the hierarchical data structure.

### Claim 3 (depends on 2)

The system of claim 2, wherein preparing the search document comprises determining a parent sub document for each sub document parsed from the input document.

### Claim 4 (depends on 3)

The system of claim 3, wherein updating the hierarchical data structure comprises writing the relationship and parent to the hierarchical data structure by the data structure engine.

### Claim 5 (depends on 1)

The system of claim 1, wherein the search server comprises a plurality of indexing engines, each configured to prepare a respective search document.

### Claim 6 (depends on 1)

The system of claim 1, wherein the hierarchical data structure comprises a plurality of interconnected clusters of data.

### Claim 7 (depends on 6)

The system of claim 6, wherein the plurality of interconnected clusters of data comprises at least a store cluster, an offer cluster, and a product cluster.

### Claim 8

A computer-implemented method comprising:
receiving, at an indexing engine, an input document from a document database;
parsing one or more sub documents from the input document;
preparing a search document based on the one or more sub documents and an indexing algorithm associated with the indexing engine;
updating the hierarchical data structure based on the search document; and
in response to a query for information from the input document:
constructing a relationship query based on the query for information and the hierarchical data structure;
determining, by the search server, one or more sub documents responsive to the relationship query based on the hierarchical data structure; and
extracting information requested by the query from the one or more sub documents responsive to the relationship query.

### Claim 9 (depends on 8)

The method of claim 8, wherein preparing the search document comprises assigning a relationship between a sub document parsed from the input document and stored data in the hierarchical data structure based on the indexing algorithm.

### Claim 10 (depends on 9)

The method of claim 9, wherein preparing the search document comprises determining a parent sub document for each sub document parsed from the input document.

### Claim 11 (depends on 10)

The method of claim 10, wherein updating the hierarchical data structure comprises writing the relationship and parent to the hierarchical data structure by the data structure engine.

### Claim 12 (depends on 1)

The method of claim 1, further comprising selecting an indexing algorithm based on the document database.

### Claim 13 (depends on 1)

The method of claim 1, wherein the hierarchical data structure comprises a plurality of interconnected clusters of data.

### Claim 14 (depends on 13)

The method of claim 13, wherein the plurality of interconnected clusters of data comprises at least a store cluster, an offer cluster, and a product cluster.

### Claim 15

A non-transitory computer readable medium having instructions stored thereon, wherein the instructions, when executed by a processor cause a device to perform operations comprising:
receiving, at an indexing engine, an input document from a document database;
parsing one or more sub documents from the input document;
preparing a search document based on the one or more sub documents and an indexing algorithm associated with the indexing engine;
updating the hierarchical data structure based on the search document; and
in response to a query for information from the input document:
constructing a relationship query based on the query for information and the hierarchical data structure;
determining, by the search server, one or more sub documents responsive to the relationship query based on the hierarchical data structure; and
extracting information requested by the query from the one or more sub documents responsive to the relationship query.

### Claim 16 (depends on 15)

The non-transitory computer readable medium of claim 15, wherein preparing the search document comprises assigning a relationship between a sub document parsed from the input document and stored data in the hierarchical data structure based on the indexing algorithm.

### Claim 17 (depends on 16)

The non-transitory computer readable medium of claim 16, wherein preparing the search document comprises determining a parent sub document for each sub document parsed from the input document.

### Claim 18 (depends on 17)

The non-transitory computer readable medium of claim 17, wherein updating the hierarchical data structure comprises writing the relationship and parent to the hierarchical data structure by the data structure engine.

### Claim 19 (depends on 15)

The non-transitory computer readable medium of claim 15, wherein the hierarchical data structure comprises a plurality of interconnected clusters of data.

### Claim 20 (depends on 19)

The non-transitory computer readable medium of claim 19, wherein the plurality of interconnected clusters of data comprises at least a store cluster, an offer cluster, and a product cluster.
