Distributed hash table based logging service

    公开(公告)号:US11132401B1

    公开(公告)日:2021-09-28

    申请号:US16513637

    申请日:2019-07-16

    Abstract: A distributed hash table (DHT) based logging service utilizes a DHT to store an event log or another type of data. For example, applications can utilize the logging service to store data that logs aspects of their operation. A key/value storage service can provide access to the DHT. The data stored in the DHT can be organized into a “skipchain” data structure. The data structure includes nodes storing the data that are distributed across partitions of the DHT. Nodes in the data structure can identify “redundancy nodes” and “skip nodes.” When a request is received to add new data to the skipchain data structure, a new node is stored in the DHT that includes the new data. A head node for the data structure is updated in the DHT. The head node can also be utilized to recover from a failure to write an internal node to the data structure.

    HIGHLY AVAILABLE DISTRIBUTED QUEUE USING REPLICATED MESSAGES

    公开(公告)号:US20200210236A1

    公开(公告)日:2020-07-02

    申请号:US16817225

    申请日:2020-03-12

    Abstract: Methods and systems for implementing a highly available distributed queue using replicated messages are disclosed. An enqueue request is received from a client at a particular queue host of a plurality of queue hosts. The enqueue request comprises a message and a replica count greater than one. One or more copies of a replication request are sent from the particular queue host to one or more additional queue hosts. The replication request comprises the message. The quantity of copies of the replication request is determined based at least in part on the replica count. An initial replica of the message is enqueued at the particular queue host. One or more additional replicas of the message are enqueued at the one or more additional queue hosts. A quantity of the one or more additional replicas is determined based at least in part on the replica count.

    Distributed hash table based logging service

    公开(公告)号:US10402452B1

    公开(公告)日:2019-09-03

    申请号:US14738214

    申请日:2015-06-12

    Abstract: A distributed hash table (DHT) based logging service utilizes a DHT to store an event log or another type of data. For example, applications can utilize the logging service to store data that logs aspects of their operation. A key/value storage service can provide access to the DHT. The data stored in the DHT can be organized into a “skipchain” data structure. The data structure includes nodes storing the data that are distributed across partitions of the DHT. Nodes in the data structure can identify “redundancy nodes” and “skip nodes.” When a request is received to add new data to the skipchain data structure, a new node is stored in the DHT that includes the new data. A head node for the data structure is updated in the DHT. The head node can also be utilized to recover from a failure to write an internal node to the data structure.

    Systems and methods storing a collection of item data

    公开(公告)号:US10114909B1

    公开(公告)日:2018-10-30

    申请号:US14275616

    申请日:2014-05-12

    Abstract: Described herein are storage systems, computer readable mediums, and methods for overcoming storage limitations associated with storage systems. The storage system may generate manifest data which includes information used to locate data stored in a distributed hash table system. The distributed hash table system may store data as read-only data. The storage system may include a variety of different manifest data generated for different versions of objects.

    Highly available distributed queue using replicated messages

    公开(公告)号:US11442777B2

    公开(公告)日:2022-09-13

    申请号:US16817225

    申请日:2020-03-12

    Abstract: Methods and systems for implementing a highly available distributed queue using replicated messages are disclosed. An enqueue request is received from a client at a particular queue host of a plurality of queue hosts. The enqueue request comprises a message and a replica count greater than one. One or more copies of a replication request are sent from the particular queue host to one or more additional queue hosts. The replication request comprises the message. The quantity of copies of the replication request is determined based at least in part on the replica count. An initial replica of the message is enqueued at the particular queue host. One or more additional replicas of the message are enqueued at the one or more additional queue hosts. A quantity of the one or more additional replicas is determined based at least in part on the replica count.

    System for differentiating encoding of text fields between networked services

    公开(公告)号:US10949617B1

    公开(公告)日:2021-03-16

    申请号:US16145006

    申请日:2018-09-27

    Abstract: Techniques for determining the relationships between a network of services include determining encoding of text fields received and transmitted by the services. Correspondence between the bytes representing a text string in a first data field and encoding data that associates byte characteristics with encoding schemes may be used to determine the encoding scheme associated with the first data field. Other data fields that were transmitted or received close-in-time to the first data field and have a value within a threshold similarity of that of the first data field may be determined to be associated with the first data field. Subsequent to a modification to the network of services, if the encoding of one or more data fields changes or if the associations between data fields change, the particular services that were affected by the modification may be determined based on the differences in encoding schemes and data field associations.

    Immediately-consistent lock-free indexing for distributed applications

    公开(公告)号:US10275480B1

    公开(公告)日:2019-04-30

    申请号:US15184943

    申请日:2016-06-16

    Abstract: An index handler determines, with respect to a key to be inserted into an index, that a candidate destination node of the index meets a split criterion. The index handler generates and embeds a deferred split descriptor comprising an identifier of a new node within the destination node. Before an insert-completed indication is provided, the destination node is written to a back-end data store without acquiring a lock and without writing out the new node to the back-end data store. During the traversal of the index, the index handler identifies another deferred split descriptor indicating a second new node. After providing the indication that the key was successfully inserted, the index handler writes the second new node to the back-end data store.

    Chain logging using key-value data storage

    公开(公告)号:US10942912B1

    公开(公告)日:2021-03-09

    申请号:US15192776

    申请日:2016-06-24

    Abstract: Methods, systems, and computer-readable media for chain logging using key-value data storage are disclosed. A chain is generated that represents a plurality of events in chronological order. The chain comprises a head and one or more nodes. The head and the one or more nodes are stored in a persistent data store as a plurality of key-value pairs. For a request to add data indicative of a new event to the chain, the head is updated in the data store to include the data indicative of the new event.

Patent Agency Ranking