公开(公告)号：US10223393B1

公开(公告)日：2019-03-05

申请号：US14750925

申请日：2015-06-25

Applicant: Amazon Technologies, Inc.

Inventor： Matthew Roy Noble ,  Wade Alvin Matveyenko ,  Yilun Cui ,  Clare Emma Liguori

IPC: G06F7/00 ,  G06F17/30

Abstract: A computing resource service provider may operate a build service configured to store data object on behalf of a customer of the computing resource service provide. The build service may receive a stream of data objects including object objects that reference one or more other data objects. A Bloom filter may be used to determine whether a one or more referenced data objects have been previously processed by the build service. This may enable the build service to reorder processing of the data object based at least in part on whether the one or more referenced data objects have previously been processed by the build service.

公开(公告)号：US20230099061A1

公开(公告)日：2023-03-30

申请号：US17491255

申请日：2021-09-30

Applicant: Amazon Technologies, Inc.

Inventor： Yilun Cui ,  Neil Kulkarni ,  Sahil Palvia ,  Yuxiang Guo ,  Rajesh Babu Srikakollu ,  Daiying Li ,  Arend Peter Castelein ,  Lakshmi Anand

IPC: G06F16/245 ,  G06F16/23 ,  G06F21/60 ,  G06F8/77

Abstract: Multi-tenant hosting of inverted indexes for text searches is implemented. Text search requests are routed to different index nodes that cache inverted indexes for different user accounts. Updates to inverted indexes are routed to index nodes that have acquired a lock on an inverted index. The index nodes have access to a common data store that persistently stores the inverted indexes.

公开(公告)号：US11748346B2

公开(公告)日：2023-09-05

申请号：US17491255

申请日：2021-09-30

Applicant: Amazon Technologies, Inc.

Inventor： Yilun Cui ,  Neil Kulkarni ,  Sahil Palvia ,  Yuxiang Guo ,  Rajesh Babu Srikakollu ,  Daiying Li ,  Arend Peter Castelein ,  Lakshmi Anand

IPC: G06F16/245 ,  G06F16/23 ,  G06F8/77

CPC classification number: G06F16/245 ,  G06F8/77 ,  G06F16/2343 ,  G06F16/2379

Abstract: Multi-tenant hosting of inverted indexes for text searches is implemented. Text search requests are routed to different index nodes that cache inverted indexes for different user accounts. Updates to inverted indexes are routed to index nodes that have acquired a lock on an inverted index. The index nodes have access to a common data store that persistently stores the inverted indexes.