Abstract: An indication of one or more changes to file system data since a last backup snapshot is received. One or more changes to the file system data between a requested backup version and the last backup snapshot are determined based in part on differences between a first tree data structure corresponding to the requested backup version and a second tree data structure corresponding to the last backup snapshot. The differences correspond to the one or more changes to the file system data between the requested backup version and the last backup snapshot. One or more data blocks corresponding to the one or more changes to the file system data since the last backup snapshot and one or more data blocks corresponding to the one or more changes to file system data between the requested backup version and the last backup snapshot are provided to a primary system.

Abstract: A system and method for partitioning data based on authorization rules. The method includes initiating a plurality of data nodes, each data node including a dataset generated based on a shared data model, wherein each of the plurality of data nodes corresponds to at least one authorization rule, wherein each authorization rule authorizes at least one user identifier to access a respective data node of the plurality of data nodes; and configuring an extract, transform, and load (ETL) application service to extract data from a data source and to load data from the data source to the dataset stored on a first data node of the plurality of data nodes when the at least one first authorization rule authorizes a requesting user to access the first data node.

Abstract: A plurality of database access requests are received at a database system within a designated database access scope. The plurality of database access requests may include a first request to read from a first database table and a second request to write to a second database table. The second request may occur during or after the receipt of the first request. A database access dependency rule linking the first database table and the second database table may be created. The database access dependency rule may impose a protected database access framework when executing a subsequent write request to the second database table when the first database table is updated. The protected database access framework may store one or more values associated with the subsequent write request in a staging table that are capable of being used to undo the subsequent write request.

Abstract: The exemplary embodiments disclose a system and method, a computer program product, and a computer system. The exemplary embodiments may include receiving a data analysis request, using a knowledge graph for determining a source dataset based on the received data analysis request, wherein the knowledge graph represents an extract, transform and load (ETL) based ontology, wherein the knowledge graph comprises nodes representing entities and edges representing relationships between the entities, and wherein the entities are instances of concepts of the ETL based ontology, building an ETL workflow for processing the source dataset in accordance with a data lineage associated with the source dataset in the knowledge graph, and executing the ETL workflow.

Abstract: Embodiments of the present disclosure relate to a method, apparatus, device, and medium for storing and querying data. The method for storing data includes: generating, for to-be-stored data, a primary index for indexing the data. The method further includes: writing the primary index arid the data into a data row in a data table. The method further includes: generating a secondary index for indexing the primary index based on a query rule of the data table and the data. In addition, the method further includes: writing the secondary index and the primary index into an index row in the data table.

Abstract: Methods and systems for improving data store performance are provided. In one aspect, a method includes creating a target data definition for a target fact table; determining a source data definition of a source table; receiving at least one source record of the source table; mapping, in response to determining the source attributes of the at least one source record include at least one source attribute that corresponds to the at least one target attribute, the at least one source attribute to the at least one target attribute of the target record; and processing, in response to determining the source attributes of the at least one source record include at least one unmapped source attribute that does not correspond to the at least one target attribute, the at least one unmapped source attribute into an unmapped attributes store of the aggregate attribute.

Abstract: Systems and methods for cross-region active-active data replication are described. A system includes a cross-region replication service (CRS), a cross-region synchronization service (CSS), and a conflict-free replication data type (CRDT) module executed by a cache service instance.

Abstract: A method and system are provided for query expansion. The method may include: providing a graph of question and answer word nodes generated from a set of training data for a given domain in the form of training question and answer texts, wherein the answer word nodes are disjoint words that do not occur in both a training question and an associated training answer and wherein edges are provided between a disjoint pair of a training question word and an associated training disjoint answer word, and applying spreading activation through the graph to result in a top n most highly activated nodes that are used as candidate words for expansion of a user query input.

Abstract: Techniques and solutions are described for implementing virtual table schemas. A virtual table schema includes a logical pointer that is used to target a table that includes data and is defined according to the virtual table schema. Values assigned to the logical pointer can be used to target tables at different locations, such as in a federated database system or in a cache of a database management system of a central computing system. When data associated with the virtual table is requested, or prior to receiving the request, the data can be stored in a table in the cache. The logical pointer can be updated to reference the cache. If the cache is full, the table can be removed from the cache, and the logical pointer can be updated to reference a table at the federated database system.

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: A computer-implemented method, apparatus, and computer program product for evaluating a page in a website are provided. The method includes obtaining a link structure of the website. The method also includes identifying a page set, the page set being a set of pages linked to a specific page in the website. The method further includes calculating a degree of dispersion of the page set in the link structure. The method also includes evaluating the specific page using the degree of dispersion to generate a score for the specific page.

Abstract: A method and system for persisting data are provided. Batch data is periodically extracted via a computer system from at least one primary data source. Batch data is transformed via the computer system. The batch data is loaded, via the computer system, into a database. Real-time data is continuously received from at least one secondary data source. The received real-time data is indexed in an index. Business intelligence reports are generated from both the real-time data in the index and the batch data in the database.

Abstract: In one embodiment, the present disclosure includes a method for determining a location of a user. In one embodiment, the method includes receiving operation data including character fields and a first identifier. A query that includes the first identifier is sent to a data store. In response to the query, operation types and corresponding count values are received. Character fields from the operation data are converted into tokens. For each of the tokens, a likelihood value and a second identifier specifying a respective machine learning parameter is retrieved. A machine-learning algorithm is configured based on the count values, and the likelihood values and specified parameters are processed by the configured machine-learning algorithm to determine whether the operation data corresponds to the geographic location of a user.

Abstract: Some embodiments provide a novel method for collecting and reporting attributes of data flows associated with machines executing on a plurality of host computers to an analysis appliance. The analysis appliance, in some embodiments, receives definitions of keys and provides them to the host computers. In some embodiments, existing keys are modified based on the analysis. Additionally, or alternatively, new keys are provided based on the analysis. In some embodiments, the analysis appliance receives the flow group records (e.g., sets of attributes) based on the keys and the configuration data from each host computer.

Abstract: Techniques for augmenting relational databases with graph database capabilities are described. A graph database query requesting data from a graph database is received. The graph database includes a plurality of vertices and a plurality of edges. The graph database query is translated into a relational database query using one or more computer processors. The relational database query references a vertex table and an edge table in a relational database. Result data corresponding with the graph database query is retrieved from the relational database by executing the relational database query against the relational database.

Abstract: Data processing and storage is an important part of a number of applications. Conventional data processing and storage systems utilize either a full array structure or a full linked list structure for storing data wherein the array consumes large amount of memory and linked list provides slow processing. Thus, conventional systems and methods are not capable of providing simultaneous optimization of memory consumption and time efficiency. The present disclosure provides an efficient way of storing data by creating an integrated array and linked list based structure. The data is stored in the integrated array and linked list based structure by using a delta based mechanism. The delta based mechanism helps in determining the location in the integrated array and linked list based structure where the data should be stored. The present disclosure incorporates the advantages of both array and linked list structure resulting in reduced memory consumption and latency.

Abstract: A system for searching and ranking modifiable videos in a multimedia messaging application (MMA) is provided. In one example embodiment, the system includes a database configured to store modifiable videos, the modifiable videos being associated with text messages and rankings, a processor, and a memory storing processor-executable codes, wherein the processor is configured to implement the following operations upon executing the processor-executable codes: receiving, via the MMA, an input of a user; selecting, based on the input, a list of relevant modifiable videos from the database; rendering, via the MMA, the list of relevant modifiable videos for viewing by the user; determining that the user has shared, via the MMA, a modifiable video from the list; storing an information concerning the list and the shared modifiable video into a statistical log; and updating, based on the information in the statistical log, the rankings of the modifiable videos in the database.

Abstract: Management of a storage system is enabled. In an example, a partition index associated with the partition is obtained, the partition index comprising a group of nodes, a node in the group of nodes indicating metadata of an object in the group of objects. A valid node in the partition index is identified, the valid node indicating valid metadata of an object associated with the valid node in the storage system. A local index for the partition index is generated based on the valid node. In response to receiving an access request for a target object in the group of objects, the target object in the storage system is accessed based on the local index. With the foregoing example implementations, metadata in the storage system may be accessed more efficiently, and the overall response speed of the storage system may be increased.

Abstract: Automatically generating a rule set implementation is disclosed. A set of rules is accessed. For each non-const rule in the set of rules, one or more implication directed acyclic graphs (DAGs) are constructed. The non-const rule directly causes at least one external output or at least one external action. The one or more implication DAGs specify rule conditions, including one or more observable rule conditions. Implication DAGs that are constructed for the set of rules are compiled to obtain a compiled result that is configured to evaluate rule conditions associated with the set of rules and determine one or more actions when at least one of the rule conditions evaluates to true. The compiled result is output.

Abstract: A result format modifying method, system, and non-transitory computer readable medium, include extracting, from a database including a plurality of display format types of a search result of a search conducted by a user, the plurality of display format types of the search result conducted by the user, and deciding a display format of the plurality of display format types to output to the user based on a time interval between a current time and the start time of the user's next activity as determined by the determining, where the display format of the search result to the user corresponds to a delivery that is digestible by the user within a specific length of a time interval out of a first time interval and a second time interval, the first time interval being longer than the second time interval.