Abstract: Providing at least one contextually relevant suggestion to one or more users of an ongoing message exchange thread between the users. The suggestion is provided for presentation to the user(s) via user interface output device(s) of computing device(s) of the user(s). The suggestion indicates a query that can be submitted to an automated assistant to cause the automated assistant to incorporate, into the message exchange thread, content that is responsive to the query. In some implementations, the suggestion is a selectable suggestion and content that is responsive to the query is incorporated into the message exchange thread in response to user interface input that is directed to the selectable suggestion. In some implementations, the suggestion is determined based on one or more messages that have already been communicated between users of the message exchange thread.

Abstract: A method, system, and computer program product for identifying network appliances on a network which includes a processor configured to intercept network communications from one or more devices between a first network and a second network. The processor may store the information about each connection in a database, the information including a Client Id and a destination address. The processor may query the database for a list of all destination addresses which were attempted to be contacted for each Client Id and generate metadata for each Client Id. The processor may analyze each Client Id, the associated metadata for each Client Id, and the destination addresses associated with each Client Id using one or more rules in a device identification tree and assign a device label to each Client Id of the one or more devices.

Abstract: An optimistic byzantine agreement protocol (the protocol) first tries to reach agreement via an efficient deterministic algorithm (synchronous protocol) that relies on synchrony for termination. If an agreement is not reached (e.g., due to asynchrony), the protocol uses a randomized asynchronous algorithm (asynchronous protocol) for fallback. Although randomized asynchronous algorithms are considered to be costly, the rationale here is to bound communication in non-synchronous runs after an equivalent cost has already paid.

Abstract: A computer-implemented database system for storing data relating to a series of events may include a memory storing instructions and at least one processor configured to execute the instructions to perform a process. The process may include receiving data relating to a first return request initiated by a first customer via a first user device, and creating a first data structure for the first return request into a first database. The process may also include create a first event for the first return request, and storing the first event in the first data structure. The process may further include receiving data relating to an update associated with the first return request, creating a second event for the update, and inserting the second event into the first data structure.

Abstract: Techniques are described for enabling a database service to provide a zonal consistency model for read and write operations involving database tables replicated across a plurality of availability zones of a cloud provider network according to some embodiments. A database service routes zonally consistent operations to request routers and storage nodes that are located in a same availability zone as the client device from which the request originates. For example, in contrast to standard write operations and strongly consistent read operations, which are processed by a leader storage node that may be located in a different availability zone than the originating request, zonally consistent operations can be processed by any storage node and, in particular, by a storage node in a same availability zone as the originating client device.

Abstract: Techniques for reconstructing or building metadata pages in storage nodes that have a delta-log based architecture. The techniques include walking “up” an ancestor chain of a metadata page, detecting the most recent delta update for a metadata entry of the metadata page, writing the most recent delta update to a location of the metadata entry in the metadata page, setting a bitmap entry corresponding to the location of the metadata entry in the metadata page, detecting a less recent delta update for the metadata entry of the metadata page, and, having previously set the bitmap entry corresponding to the location of the metadata entry in the metadata page, avoiding writing the less recent delta update to the location of the metadata entry in the metadata page. In this way, the need to save in memory the entire ancestor chain of the metadata page can be eliminated.

Abstract: Structured object generation is disclosed. A source record is accessed. The source record includes a plurality of object data fields. An interpolated source record that has a plurality of object data fields corresponding to the plurality of object data fields of the first source record is generated. A template record is accessed. The template record includes a plurality of template record data fields. Subsequent to generating the interpolated source record, an interpolated template record is generated by, for each template record data field that includes a variable, accessing content of the object data field in the interpolated source record to which the variable refers, and replacing the variable with the content to generate a fixed value for the object data field in the interpolated template record.

Abstract: Implementations are directed to receiving a search query from a user, obtaining environmental signal(s) associated with an environment in which the user is located when the search query is received, processing the environmental signal(s) to generate a privacy measure associated with submission of the search query, obtaining additional environmental signal(s) associated with the environment in which the user is located when user input directed to a search interface is received, processing the additional environmental signal(s) to generate an additional privacy measure associated with the user input, selecting, from a superset of historical search queries of the user, a subset of the historical search queries based on at least the privacy measure and the additional privacy measure, and causing the subset of the historical search queries to be presented to the user in response to receiving the user input directed to the search interface.

Abstract: There is described a system and method for managing timeseries data. A timeseries consumer receives timeseries data from multiple devices, provides the timeseries data to a particular partition of a data table based on an insert time of the timeseries data to the data table, and records metadata associated with the timeseries data provided to the particular partition at a track table. A timeseries archiver identifies recent records of the data table based on insert time(s) and archival time(s) of a milestone table, archives the timeseries data of the data table associated with the recent records to an external system, and updates the archival time(s) of the milestone table and the track table. The timeseries purger drops an archived partition of the data table based on determining that all records of the archived partition have been archived.

Abstract: Systems, methods, and storage media are provided that are useful in a computing environment for receiving, modifying, and transforming service level information from database servers and entities in a hosted database environment. Multiple application programming interface (API) calls are made by a database observation system to request information for multiple service level indicators from database servers belonging to multiple different entities. Database observation system receives and aggregates the information for multiple service level indicators from each of the database servers belonging to multiple different entities. The database observation system provides, within a dashboard interface, the aggregated information for each of the multiple service level indicators, individual service level indicator scores, and aggregated service level indicator scores for each of the database servers for each of the multiple entities.

Abstract: A system may receive a cluster prediction requirement. The system may determine a first node conglomerate by sorting a first dataset into a first plurality of nodes. The system may determine a plurality of attributes by sorting a second dataset associated with the cluster prediction requirement. The system may determine a second node conglomerate for each of the plurality of attributes. A node confidence score may be assigned to each of the second plurality of nodes. The system may determine a node graph based on a comparison between the first node conglomerate and the second node conglomerate. The node graph may be iteratively modified based on a node optimization threshold value to generate a harmonized node graph. The node optimization threshold value may be based on a map confidence score allotted to the node graph.

Abstract: A system for dynamic file chunking is provided. The system includes a memory and a processor configured to access one or more files to be chunked for a data backup operation and to identify a type of the one or more files. The type of the file is based upon an extension of the respective file. The processor is configured to analyze storage data associated with each type of files corresponding to a plurality of chunking techniques. The processor is configured to associate each of files with a corresponding data chunk size and a chunking technique class based upon the analyzed storage data and to analyze data backup parameters in-real time during the data backup operation and to update at least one of the data chunk size and the chunking technique for each of the type of files based upon the data backup parameters.

Abstract: Methods and systems for coordinating migration for a database of a service are described herein. Multiple releases of the service may be simultaneously implemented, and these multiple releases may access a shared database. As new releases of the service are activated, the database may be incrementally migrated to a new data schema version. The new data schema version may be compatible with each release of the service that is in use. After a migration has begun, instances of the service may be instructed to perform database operations using methods compatible with the new data schema version. Continuation tokens may be returned during the migration, which indicate portions of the shared database that have not yet been migrated. If an error occurs during the migration, the continuation tokens may be discarded, and the migration may be restarted.

Abstract: A computer system implements a file system migration by determining a destination namespace of a destination file system based at least in part on a namespace of a source file system. At least a portion of the destination namespace includes an organization that is altered as compared to a corresponding portion of the source namespace.

Abstract: Methods for asynchronously determining relational data integrity using cryptographic data structures are performed by systems and devices. Changes in current tables of relational databases are reflected in associated history tables. Cryptographic hybrid blockchain ledgers are updated with transaction records, for entry changes in current and history tables, including transaction information and hash values of corresponding entry changes. Hybrid blockchain ledgers also include root hash values of Merkle trees of transaction records in current blocks, and hash values of prior blocks. A current block receipt is asynchronously generated and provided as a single hash value from which the validity states of the tables and ledger are able to be verified. Cryptographic receipts of specific transactions reflected in table entry changes are generated and provide immutable evidence of specific transaction existence for users.

Abstract: Techniques to process metadata involve: in response to receiving a modification transaction for metadata on a computing device, acquiring information related to a busyness degree of the computing device; and according to at least a determination that the busyness degree is greater than a threshold degree, modifying the metadata in a metadata storage apparatus of the computing device directly without generating a log related to the modification transaction in a log storage apparatus of the computing device. Accordingly, such techniques can achieve good processing performance irrespective of a busy state or non-busy state of a computing device. In particular, when the computing device is in a busy state, a newly triggered modification transaction can still be timely executed, thereby improving IOPS performance of the computing device in a busy state.

Abstract: The method includes receiving historical data from a first data source; analyzing the historical data for a desired characteristic; determining a representative value for the desired characteristic of the historical data; determining a first data expectation for the historical data based on the representative value; transmitting the first data expectation to a first data recipient; receiving first incoming data from the first data source; analyzing the desired characteristic of the first incoming data; determining a first incoming data value for the desired characteristic for the first incoming data; comparing the first incoming data value and the representative value; determining a first difference between the first incoming data value and the representative value; and/or comparing the first difference to a difference threshold which indicates whether a difference between an incoming data value and the representative value is significant.

Abstract: Certain embodiments involve tracking incremental updates to graph data structures and thereby facilitating efficient data retrieval. For instance, a computing system services a first query for one or more segments of computing devices, online entities, or both. The computing system services the first query by searching of a set of nodes from a graph data structure. The computing system receives a second query after the graph data structure has been modified. The computing system identifies, from a change list for tracking changes to the graph data structure, a subset of the nodes impacted by the modification to the graph data structure. The computing system services the second query by searching the subset of impacted nodes in the graph data structure.

Abstract: A DBMS manages a high-performance accelerated database that is synchronized with a conventional client database. The accelerated database contains both “regular” accelerated tables, which each duplicate a table of the client database, and accelerator-only tables (AOTs) that are unique to the accelerated database and that may be used for analytical purposes. AOT rows are archived by moving the rows to a dedicated accelerator-only archive stored in the accelerated database. When a user query attempts to access accelerator-only data, the DBMS rewrites the query to adapt the requested operations to the accelerated database's partitioned archive/non-archive structure. The rewritten query specifies steps for accessing archived and non-archived accelerator-only data without forcing the DBMS front-end to generate a merged view of archived and non-archived accelerator-only data.

Abstract: A system for managing abort events of Hardware Transactional Memory (HTM) transactions to an in-memory database, comprising a processor adapted to control a plurality of abort events of a plurality of database transactions held concurrently to a shared in-memory database and a method for managing abort events comprising analyzing a metadata record associated with each potential abort event, where the metadata record comprises a row ID value and a row version value of a certain one of a plurality of rows of a database that is concurrently accessed by an aborting HTM transaction and another HTM transaction, comparing the row ID value and the row version value to a local ID value and a local version value of the aborting HTM transaction and determining a contention condition between the aborting HTM transaction and the other HTM transaction.