# US 2025/0148411 A1 · Data Ingestion Pipeline for Bucketized Search and Selection

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

- Number: US 2025/0148411 A1
- Document ID: US20250148411A1
- Status: Published application
- Kind: A1
- Application number: 18/504,847
- Filed: 2023-11-08
- Published: 2025-05-08
- Earliest claimed: 2023-11-08
- Assignees: Uber Technologies, Inc.
- Applicants: Uber Technologies, Inc.
- Inventors: Atul Anand; Janini Narayanan; Karthikeyan Ramasamy; Juan-Pablo Cristian Silva Peña
- Web page: https://patentgrep.com/patent/US20250148411A1

## CPC

- G06Q 10/0836: Recipient pick-ups
- 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

Systems and method for data ingestion pipeline for bucketized search and selection. The method includes accessing a data structure including a number of delivery zones, merchants, and associated travel durations. A bucketized index data structure can be generated including travel duration buckets and associated merchants. The method includes obtaining a service order request including a drop-off location. The method includes determining a cross-bucket subset of merchants based at least in part on the index data structure and drop-off location. The method includes transmitting data including instructions that, when executed by a client device, cause the cross-bucket subset of merchants to be provided for display via an interface of the client device.

## Claims

### Claim 1

A computer-implemented method, comprising:
accessing a data structure comprising a plurality of delivery zones, a plurality of merchants, and a travel duration associated with each respective delivery zone of the plurality of delivery zones;
generating, based at least in part on the accessed data structure, an index data structure comprising for each delivery zone of the plurality of delivery zones:
(i) a first travel duration bucket;
(ii) a second travel duration bucket; and
(iii) one or more merchants associated with the first travel duration bucket and one or more merchants associated with the second travel duration bucket;
accessing data associated with a delivery service request comprising at least a drop-off location;
responsive to accessing the data associated with the delivery service request:
(i) determining a first delivery zone of the plurality of delivery zones comprising the drop-off location; and
(ii) parsing the index data structure to determine one or more merchants in a first travel duration bucket associated with the first delivery zone and one or more merchants in a second travel duration bucket associated with the first delivery zone, wherein the first travel duration bucket and second travel duration bucket are non-overlapping sets of merchants;
selecting a cross-bucket subset of merchants comprising a first subset of merchants from the first travel duration bucket and a second subset of merchants from the second travel duration bucket; and
transmitting data comprising instructions that, when executed by a client device, cause the cross-bucket subset of merchants to be provided for display via an interface of the client device.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein transmitting data comprising instructions that, when executed by the client device, cause the cross-bucket subset of merchants to be provided for display via an interface of the client device comprises:
providing the cross-bucket subset of merchants to be presented in an order based at least in part on a blending algorithm.

### Claim 3 (depends on 2)

The computer-implemented method of claim 2, wherein the blending algorithm determines a ranking for each merchant within the cross-bucket subset of merchants and orders the merchants according to the ranking, wherein a high ranking for a merchant results in the merchant being displayed in a more prominent manner than a lower ranking merchant.

### Claim 4 (depends on 3)

The computer-implemented method of claim 3, wherein the ranking for each respective merchant of the plurality of merchants is determined based at least in part on at least one of: a conversion rate, a delivery radius, a user selection history data, a cuisine type, an order frequency, or a search frequency.

### Claim 5 (depends on 4)

The computer-implemented method of claim 4, wherein selecting the cross-bucket subset of merchants is based at least in part on a score associated with each respective merchant.

### Claim 6 (depends on 5)

The computer-implemented method of claim 5, wherein the score of each respective merchant is based at least in part on: (i) a travel duration associated with the first or second travel duration bucket associated with the respective merchant and (ii) a conversion rate of the respective merchant.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein the travel duration associated with the respective delivery zones comprises an isochrone-based travel duration.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, wherein the travel duration associated with the respective delivery zones comprises a haversine distance-based travel duration.

### Claim 9 (depends on 1)

The computer-implemented method of claim 1, wherein the travel duration associated with the respective delivery zones is determined using a travel duration algorithm.

### Claim 10 (depends on 1)

The computer-implemented method of claim 1, wherein the selecting the cross-bucket subset of merchants comprises:
(i) selecting a first percentage of merchants of the first travel duration bucket as the first subset;
(ii) selecting a second percentage of merchants of the second travel duration bucket as the second subset; and
(iii) combining the first subset and second subset into the cross-bucket subset of merchants.

### Claim 11

A computing system, comprising:
one or more processors; and
one or more non-transitory, computer-readable media storing instructions that are executable by the one or more processors to cause the computing system to perform operations, the operations comprising:
accessing a data structure comprising a plurality of delivery zones, a plurality of merchants, and a travel duration associated with each respective delivery zone of the plurality of delivery zones;
generating, based at least in part on the accessed data structure, an index data structure comprising for each delivery zone of the plurality of delivery zones:
(i) a first travel duration bucket;
(ii) a second travel duration bucket; and
(iii) one or more merchants associated with the first travel duration bucket and one or more merchants associated with the second travel duration bucket;
accessing data associated with a delivery service request comprising at least a drop-off location;
responsive to accessing the data associated with the delivery service request:
(i) determining a first delivery zone of the plurality of delivery zones comprising the drop-off location; and
(ii) parsing the index data structure to determine one or more merchants in a first travel duration bucket associated with the first delivery zone and one or more merchants in a second travel duration bucket associated with the first delivery zone, wherein the first travel duration bucket and second travel duration bucket are non-overlapping sets of merchants;
selecting a cross-bucket subset of merchants comprising a first subset of merchants from the first travel duration bucket and a second subset of merchants from the second travel duration bucket; and
transmitting data comprising instructions that, when executed by a client device, cause the cross-bucket subset of merchants to be provided for display via an interface of the client device.

### Claim 12 (depends on 11)

The computing system of claim 11, wherein the selecting the cross-bucket subset of merchants comprises:
(i) selecting a first percentage of merchants of the first travel duration bucket as the first subset;
(ii) selecting a second percentage of merchants of the second travel duration bucket as the second subset; and
(iii) combining the first subset and second subset into the cross-bucket subset of merchants.

### Claim 13 (depends on 11)

The computing system of claim 11, wherein transmitting data comprising instructions that, when executed by the client device, cause the cross-bucket subset of merchants to be provided for display via an interface of the client device comprises:
providing the cross-bucket subset of merchants to be presented in an order based at least in part on a blending algorithm.

### Claim 14 (depends on 13)

The computing system of claim 13, wherein the blending algorithm determines a ranking for each merchant within the cross-bucket subset of merchants and orders the merchants according to the ranking, wherein a high ranking for a merchant results in the merchant being displayed in a more prominent manner than a lower ranking merchant.

### Claim 15 (depends on 14)

The computing system of claim 14, wherein the ranking for each respective merchant of the plurality of merchants is determined based at least in part on at least one of: a conversion rate, a delivery radius, a user selection history data, a cuisine type, an order frequency, or a search frequency.

### Claim 16

One or more non-transitory computer readable media storing instructions that are executable by one or more processors to perform operations comprising:
accessing a data structure comprising a plurality of delivery zones, a plurality of merchants, and a travel duration associated with each respective delivery zone of the plurality of delivery zones;
generating, based at least in part on the accessed data structure, an index data structure comprising for each delivery zone of the plurality of delivery zones:
(i) a first travel duration bucket;
(ii) a second travel duration bucket; and
(iii) one or more merchants associated with the first travel duration bucket and one or more merchants associated with the second travel duration bucket;
accessing data associated with a delivery service request comprising at least a drop-off location;
responsive to accessing the data associated with the delivery service request:
(i) determining a first delivery zone of the plurality of delivery zones comprising the drop-off location; and
(ii) parsing the index data structure to determine one or more merchants in a first travel duration bucket associated with the first delivery zone and one or more merchants in a second travel duration bucket associated with the first delivery zone, wherein the first travel duration bucket and second travel duration bucket are non-overlapping sets of merchants;
selecting a cross-bucket subset of merchants comprising a first subset of merchants from the first travel duration bucket and a second subset of merchants from the second travel duration bucket; and
transmitting data comprising instructions that, when executed by a client device, cause the cross-bucket subset of merchants to be provided for display via an interface of the client device.

### Claim 17 (depends on 16)

The one or more non-transitory computer readable media of claim 16, wherein transmitting data comprising instructions that, when executed by the client device, cause the cross-bucket subset of merchants to be provided for display via an interface of the client device comprises:
providing the cross-bucket subset of merchants to be presented in an order based at least in part on a blending algorithm.

### Claim 18 (depends on 17)

The one or more non-transitory computer readable media of claim 17, wherein the blending algorithm determines a ranking for each merchant within the cross-bucket subset of merchants and orders the merchants according to the ranking, wherein a high ranking for a merchant results in the merchant being displayed in a more prominent manner than a lower ranking merchant.

### Claim 19 (depends on 18)

The one or more non-transitory computer readable media of claim 18, wherein the ranking for each respective merchant of the plurality of merchants is determined based at least in part on at least one of: a conversion rate, a delivery radius, a user selection history data, a cuisine type, an order frequency, or a search frequency.

### Claim 20 (depends on 16)

The one or more non-transitory computer readable media of claim 16, wherein the travel duration associated with the respective delivery zones comprises an isochrone-based travel duration.
