Abstract: Systems and methods are provided for synchronizing messages. The systems and methods include operations for: identifying a difference between a current state of a messaging application and a shared synchronization database, wherein the shared synchronization database is updated via a third-party application in response to the third-party application receiving, from a server, a notification related to the messaging application, the messaging application and the third-party application being implemented on a client device; retrieving information from the shared synchronization database to update the current state of the messaging application based on the identified difference; and transmitting, to the server by the messaging application, a request for content based on the update to the current state of the messaging application.

Abstract: A computing system generates and a plurality of clusters by clustering the session representations based on similarity between session representations, the plurality of clusters comprising an optimal number of clusters based on key performance indicators corresponding to each cluster of the plurality of clusters. The computing system determines a medoid of each of the plurality of clusters, and then for each session representation generated for each of a second plurality of sessions, the computing system computes a distance between the session representation and each medoid to determine a nearest medoid and assigns the session representation to a cluster associated with the nearest medoid.

Abstract: A computing system generates, for each of a plurality of sessions, a session representation indicating the order through which a user navigated through a plurality of webpages during the session, and generates for each pair of session representations, a score indicating how similar the session representations in each pair are to each other. The computing system further generates a plurality of clusters by clustering the session representations based on the score for each pair of session representations, determines an optimal number of clusters based on key performance indicators corresponding to each cluster of the plurality of clusters, and generates a natural language description for each cluster of the optimal number of clusters based on the key performance indicators associated with each cluster.

Abstract: Systems and methods include detection of changes to data of a plurality of source objects of a source system, replicating the data changes to corresponding ones of the plurality of target objects, and, during the detection of changes to data and the replication of the data changes: detecting a first change to a first source object, identifying a first maintenance event based on the detected first change; determining a first one or more solutions to resolve the first maintenance event; presenting the first maintenance event and the first one or more solutions to resolve the first maintenance event to a user; receiving an indication from the user of a first solution of the first one or more solutions to resolve the first maintenance event; and, in response to the indication, executing the first solution.

Abstract: Systems and methods for providing auto-completion options to input characters are presented. In response to receiving input characters, a plurality of items of content (that are non-textual items of content) of a corpus of content are identified. These items of content are clustered into n clusters of content according to similarities among the items of content. From the items of content of each cluster, a descriptive title is determined for the cluster. This descriptive title is an auto-completion option for the cluster. The descriptive titles/auto-completion options are provided in response to receiving the input characters.

Abstract: A computer-implemented method of integrating decoupled front-end and back-end processes is disclosed. The method comprises receiving a front-end configuration including validation specifications and a back-end configuration including data validation rules; receiving a data item via forms-based interface associated with the front-end configuration, the data item having been validated based on the validation specifications; mapping the data item to a back-end data object; detecting a conflict between the validation specifications and the validation rules; altering a back-end validation process associated with the back-end data object; causing storing the data item in a database system in association with the back-end data object.

Abstract: Methods, systems, and computer-readable media for versioned metadata management for a time-series database are disclosed. A metadata service of a distributed time-series database stores, to one or more metadata storage resources, first metadata descriptive of a table. The first metadata is associated with a version number in a logical sequence for the table. The metadata service stores, in a log, data indicative of one or more metadata updates for the table. The metadata update(s) are associated with an additional version number higher than the version number in the logical sequence. Responsive to a read request, the metadata service determines a most recent version number that has been applied from the log to the metadata storage resource(s). Responsive to the read request and based (at least in part) on the most recent version number, the metadata service returns either the first metadata or second metadata comprising the update(s).

Abstract: A method and system that proactively generate alerts for updating a scraping script to avoid scraping script errors. A predetermined number of webpages targeted by the scraping script are randomly sampled. The scraping script is appended to each webpage in the sample. A structured list of text fragments across the webpages with the appended script is generated. At predetermined time intervals, a fresh set of webpages is sampled, the scraping script is appended to the webpages, and a new structured list is generated. If the new structured list and the previous structured list do not match, the webpages may have been changed and the scraping script may have to be updated. An alert is generated indicating that such update is required and may include a location of the mismatch. Therefore, scraping script errors are proactively detected and can be rectified before an actual error occurs and propagates.

Abstract: Disclosed herein are systems and methods for query processing with restrictions in a database clean room. In an embodiment, a system receives a query directed to a combination of a first source dataset from a first database account of a distributed database and a second source dataset from a second database account of the distributed database. The system generates an approved statements table that contains database statement language that can be executed against the combination of the first and second source datasets. Based on determining that the approved statements table includes the query, the system executes the query to produce results data, and stores the results data in the first database account.

Abstract: A big data analysis system may include a big data repository communicatively coupled to a data accumulation server and a predictive graph processing system. The data accumulation server may be configured to receive information from a plurality of data sources, the information corresponding to user interaction with one or more computing devices associated with an organization via a networked computing system, store the information received from the plurality of sources in the big data repository; and monitor the plurality of data sources to update the data stored in the big data repository. The predictive graph processing system is configured to receive information stored in the big data repository, transform the information received from the big data repository into a predictive graph data set based on a predictive model, and store the predictive graph data set to a visualization data repository.

Abstract: Described are systems, methods, and techniques for collecting, analyzing, processing, and storing time series data and for evaluating and determining whether and how to include late or delayed data points for inclusion when publishing or storing the time series data. Maximum delay values can identify a duration for waiting for late or delayed data, such as prior to publication. In some examples, maximum delay values can be dynamically adjustable based on a statistical evaluation process. For late or delayed data points that are received after the maximum delay elapses, some data points can be included in the stored time series data, such as if they are received in the same order that they are generated.

Abstract: The various embodiments described herein include methods, devices, and systems for reading and writing data from a database table. In one aspect, a method includes: (1) initiating a read transaction to read from a first non-key column of a row in the database table, the database table having a plurality of rows, each row comprising a primary key and a plurality of non-key columns, the initiating including: (a) determining that a write transaction holds a lock on a second non-key column of the row in the database table, and (b) determining that no lock is held on the first non-key column; and (2) in response, concurrently reading data from the first non-key column and writing a new column value to the second non-key column; where each non-key column includes a last-write timestamp that indicates when the last write occurred for the respective non-key column.

Abstract: A data store maintains a collection of data using a log-based storage structure. In response to a request to delete an item from the collection, the database management system adds a tombstone entry to the log-based storage structure, with additional metadata associated with the tombstone. Access to the tombstone metadata is provided to a client of the data store. The tombstone is deleted from the log-based storage structure after expiry of a time-to-live period.

Abstract: A computer-implemented method for efficiently estimating the number of unique elements in a collection of elements comprises generating, via hash logic, hash values for each element of the collection of elements. The method further comprises specifying, in a sketch-frequency table, a set of discrete statistical values associated with the hash values and, for each discrete statistical value of the set of discrete statistical values, information indicative of a frequency at which binary representations of the hash values are associated with the discrete statistical value. The cardinality of the collection of elements is estimated based on the sketch-frequency table.

Abstract: A centralized database management system performs data synchronization with lower bandwidth consumption and higher efficiency using a resizable invertible bloom filter. The system may include a resizable invertible bloom filter module that constructs and maintains invertible bloom filters that are resizable based on a number of differences between different snapshots. The resizable invertible bloom filter module may maintain a list of possible sizes for a resizable invertible bloom filter. The resizable invertible bloom filter module may determine and maintain a list of applicable partition sizes, each partition size being a product of a divisor and a resizing factor. If the number of differences exceeds the number of expected differences and results in failure in decoding, the system may retry a larger size in a set of predetermined sizes. The system may continue to try larger sizes until a minimal size required for successful decoding is found.

Abstract: Database synchronization by initiating a transaction to synchronize data from a source database to a target database. The source database issues a trigger that provides a sequence identification (ID) and calculates a thread number that is employed for syncing the rows from the source database to the target database based on a primary key hash. The sequence identification (ID) and the thread number from the source database is inserted into a synchronization (SYNC) table. Data synchronization may also include picking the rows that are allotted their thread number from the SYNC table using polling threads. The rows from the SYNC table may be replicated into target database using a sequence provided by the sequence identification and thread number.

Abstract: First and second database accounts respectively share first and second source datasets with one another in a data clean room. The first database account stores a first approved-statements table that contains database statements that are permitted by the first database account to be executed against a combination of the shared first source dataset and the shared second source dataset. The second database account stores a second approved-statements table that contains database statements that are permitted by the second database account to be executed against the combination of the shared first source dataset and the shared second source dataset. One or more queries received from the first database account that are included in the second approved-statements table are processed, as are one or more queries received from the second database account that are included in the first approved-statements table.

Abstract: Systems, devices, and methods are provided for efficient query execution on distributed data sets, such as in the context of data lakes. In at least one embodiment, indexing information is used to identify candidate and non-candidate portions of a data set. Non-candidate portions may be irrelevant to the query. Indexing information can be encoded using Bloom filters.

Abstract: Techniques are provided for inofile management and access control list file handle parity. For example, operations targeting a first storage object of a first node are replicated to a second storage object of a second node. A size of an inofile maintained by the second node is increased if an inode number to be allocated by the replication operation is greater than a current size of the inofile. Access control list file handle parity is achieved by maintaining parity between inode number and generation number pairings of the first node and the second node.

Abstract: A method, an apparatus, a device and a medium for performing a review based on a blockchain are provided. When performed by a reviewing party, the method includes: determining a review conclusion and anonymous identity data of the reviewing party, in response to a review request of a to-be-reviewed party acquired from a review organization party; and generating a chaining transaction request including the review conclusion and the anonymous identity data, to write the review conclusion and the anonymous identity data into a blockchain.