Abstract: Systems and methods for managing timestamps for a sequential update stream in a distributed system. A system includes a plurality of storage nodes of a data stream service of a provider network. Each storage node includes one or more processors and memory storing instructions executable by the one or more processors. The instructions cause the one or more processors to create a shard, at the storage node, for storing records of a sequential update stream recording changes to a database partition. The instructions also cause the one or more processors to assign a timestamp for the shard based on a local clock of the storage node. The instructions further cause the one or more processors to adjust the timestamp for the shard to a time later than a timestamp for a previous shard of the sequential update stream stored at a different storage node of the plurality of storage nodes.

Abstract: Scalable architecture for propagating updates may be implemented for data replicated from a data set. A node may receive updates to items in a data set that have been committed to the data set. The node may determine whether the update should be applied to a replicated portion of the data set. For updates that should be applied, the node may identify another node that hosts the replicated portion of the data set and send a request to the other node to perform a conditional atomic operation to apply the update to the item in the replicated portion of the data set. The condition may compare a version identifier associated with an update and a current version identifier for the item at the other node. If the condition evaluates true, then the update to the item in the replicated portion may be performed.

Abstract: A distributed database system maintains data for a logical table by storing, on a plurality of storage nodes, a collection of key-item pairs. An operation to delete a range of these items is processed by first storing, on each of the plurality of storage nodes, a tombstone record indicative of the items to be deleted. The tombstones are committed once each of the plurality of nodes has stored the tombstone. Items within the range are treated as deleted. A cleanup operation deletes items within the range and updates the tombstone.

Abstract: Various systems and methods of tracking database partition change log dependencies are described herein. A system is disclosed herein, according to some embodiments. A change log for a database partition of the plurality of database partitions is stored to a log store. An indication that a split of the database partition into two or more child database partitions has occurred is received. Responsive to the split of the database partition, the change log is split into two or more corresponding child change logs. A portion of the change log is deleted responsive to a determination that a respective complete snapshot is stored for each child database partition corresponding to a child change log of the change log and a determination that a retention window for the portion of the change log has passed.

Abstract: Transaction requests may be ordered in a distributed database according to an independently assigned sequence. Different distributed system nodes, such as a transaction coordinator and a storage node may independently assign sequence numbers to requests to access a distributed database. A storage node may receive the request from a transaction coordinator with an assigned sequence number and another request to which the storage node may assign a sequence number. The storage node can then order performance of the requests based on the sequence numbers.

Abstract: Offline building of a projected data subset may be performed. A request to create a data set that is a projected subset of data from a source data set may be received. A data store separate from the data store storing the source data set may store a copy of the source data set that is used to replicate items to the projected subset of data according to a schema for the projected data subset. Updates made to the source data set may also be replicated to the projected data subset according to the schema. Conflicts between replicated items and replicated updates to the projected data set may be resolved by comparing a version identifier for the replicated update and replicated item to determine what to store in the projected data subset.

Abstract: The present invention relates to novel compounds useful as malic enzyme (ME) inhibitors, processes for their preparation and use of these compounds for the therapeutic treatment of disorders mediated by ME such as cancers (e.g. pancreatic ductal adenocarcinoma (PDAC)) in humans. The novel compounds have a structure according to Formula I or a pharmaceutically acceptable salt, stereoisomer or deuterated analog thereof, wherein X, R1, R2 and Y are as described herein.

Abstract: Glitch source identification and ranking is provided by: identifying a plurality of glitch sources in a circuit layout; back referencing the plurality of glitch sources to corresponding lines in a Resistor Transistor Logic (RTL) file defining the plurality of glitch sources; identifying, in the circuit layout, a plurality of glitch terminuses associated with the plurality of glitch sources; determining a plurality of glitch power consumption values associated with the plurality of glitch sources based on fanouts in the circuit layout extending from the plurality of glitch sources to the plurality of glitch terminuses; ranking, by a processor, the plurality of glitch sources based on corresponding glitch power consumption values of the plurality of glitch power consumption values corresponding to individual glitch sources of the plurality of glitch sources; and reporting the corresponding lines in the RTL file associated with the ranked plurality of glitch sources.

Abstract: Systems and methods are described for processing voice input to detect and remove voice recognition errors in the context of a product attribute query. Spoken-word input may be processed to tentatively identify a query regarding a product and an attribute. A hierarchical product catalog is then used to identify categories that include the identified product, and an affinity score is determined for each category to indicate the relative strength of the relationship between the category and the attribute. The affinity score for each category is determined based on historical questions submitted to a question and answer service with regard to other products in the category. An affinity score for the product-attribute pairing is then determined based on a weighted average of the affinity scores for the product categories, and the affinity score is used to determine whether the question is valid and the voice input has been correctly processed.

Abstract: Transaction operations may be graphed in order to determine performance compliance of transactions. An event to analyze transactions may be detected. Transactions to analyze for the event may be identified and a description of transaction operations for the identified transactions may be obtained. A graph of the transaction operations may be generated to indicate the dependencies between transactions and an evaluation of the graph may be performed to determine whether the transactions were performed with serializable isolation.

Abstract: Various systems and methods of tracking database partition change log dependencies are described herein. A system is disclosed herein, according to some embodiments. A change log for a database partition of the plurality of database partitions is stored to a log store. An indication that a split of the database partition into two or more child database partitions has occurred is received. Responsive to the split of the database partition, the change log is split into two or more corresponding child change logs. A portion of the change log is deleted responsive to a determination that a respective complete snapshot is stored for each child database partition corresponding to a child change log of the change log and a determination that a retention window for the portion of the change log has passed.

Abstract: A database proxy includes a computing device and a hardware-accelerated database proxy module. The computing device and the database proxy module. The database proxy is configured to receive a write request from a client; store the write request in a commit log in a first non-volatile memory device; in response to storing the write request in the commit log, return to the client a signal acknowledging success of the write request; store the write request in a cache in a second non-volatile memory device; cause the write request to be written in a database store; and based on a first determination that the write request is stored in the cache and on a second determination that the write request is written in the database store, remove the write request from the commit log.

Abstract: An example operation may include one or more of storing state information of a system component via a data block included among a hash-linked chain of data blocks of a blockchain, the state information identifying operating features of the system component at a first point in time, receiving, from the system component, re-computed state information of the system component captured at a second point in time that is subsequent to the first point in time, determining an integrity of the system component based on the re-computed state information and the previously stored state information of the system component stored among the hash-linked chain of data blocks, and transmitting information about the determined integrity to a computing system associated with the system component.

Abstract: Transaction requests may be ordered in a distributed database according to an independently assigned sequence. Different distributed system nodes, such as a transaction coordinator and a storage node may independently assign sequence numbers to requests to access a distributed database. A storage node may receive the request from a transaction coordinator with an assigned sequence number and another request to which the storage node may assign a sequence number. The storage node can then order performance of the requests based on the sequence numbers.

Abstract: Updates performed as part of transaction requests to a data store may be included in a stream of updates. Updates to items in the data store that are included in transactions determined not to be committed to the data store may be excluded from the stream of updates. Records in the stream of updates may include an identifier for the transaction that included the update described by the record. The identifier for the transaction may be used to identify updates to other items in the data store that are included in the same transaction.

Abstract: Various systems and methods of tracking a size of a database change log are described herein. A system is disclosed herein, according to some embodiments. An indication of a plurality of change events that have occurred at the database is received. A new log segment is generated for the change log for the database based on the received indication including the plurality of change events. Metadata for an end log segment from the change log is retrieved to identify a cumulative size for the change log. A new cumulative size for the change log is determined based on a size of the new log segment and the identified cumulative size. The new log segment is stored to the change log as a new end log segment with metadata indicating the new cumulative size for the change log.

Abstract: The present invention relates to novel compounds useful as malic enzyme (ME) inhibitors, processes for their preparation and use of these compounds for the therapeutic treatment of disorders mediated by ME such as cancers (e.g. pancreatic ductal adenocarcinoma (PDAC)) in humans.

Abstract: Systems and methods are provided to implement a database system configured to return the state of a data item upon failure of a condition check on the data item during a conditional write. In embodiments, a write request may specify an indicator to return the item state upon condition failure. The request may specify multiple database operations to execute as a transaction, where failure of a single condition check will cause the entire transaction to fail and an item state causing the failure to be returned. The returned state of the data item may include a selection of the item's attributes specified by the request. Advantageously, these features allow a client to easily obtain the precise cause of a write's failure. Moreover, because the item state is returned only when a conditional write fails and only when requested, the response size of most write requests remains unchanged.

Abstract: A computer-implemented technique is described herein for defining and applying constraints that regulate a supervisee's interaction with applications. In one implementation, the technique provides a user interface presentation to a supervisor that lists a set of applications that run on plural application execution platforms. The user interface presentation also allows the supervisor to set platform-agnostic constraint information for any identified application. The platform-agnostic constraint information, once set for an application, constrains interaction by a supervisee with all versions of that same application. That is, the constraint information is said to be agnostic with respect to platform in the sense that it applies to a variety of application execution platforms that run the application. In one example, the platform-agnostic constraint information specifies a permitted amount of an activity that the supervisee is permitted to perform across all versions of an application.

Abstract: Techniques to restore data from backup are disclosed. In various embodiments, an indication of a subcomponent to be restored from backup is received. View information associated with the backup is used to determine a set of physical components required to be retrieved from the backup to restore the requested subcomponent. The determined set of physical components is retrieved from the backup. The retrieved physical components are used to restore the subcomponent. In various embodiments, the view information includes data that identifies each of a plurality of separately-recoverable subcomponents of the backup and for each one or more physical components comprising the backup which would be required to restore that subcomponent.