Abstract: A method for a multi-cluster warehouse includes allocating a plurality of compute clusters as part of a virtual warehouse. The compute clusters are used to access and perform queries against one or more databases in one or more cloud storage resources. The method includes providing queries for the virtual warehouse to each of the plurality of compute clusters. Each of the plurality of compute clusters of the virtual warehouse receives a plurality of queries so that the computing load is spread across the different clusters. The method also includes dynamically adding compute clusters to and removing compute clusters from the virtual warehouse as needed based on a workload of the plurality of compute clusters.

Abstract: A method for a multi-cluster warehouse includes allocating processing units as part of a data warehouse. The processing units access data within one or more databases in cloud storage resources. The method also includes providing one or more queries to each processing unit within the data warehouse. In response to the queries, each processing unit performs database operations on a particular portion of a database table. The method also includes monitoring a workload of the processing units to determine that a processing capacity of the processing units has reached a threshold processing capacity. The method also includes dynamically adding additional processing units to and removing processing units from the data warehouse as needed based on a workload of the processing units.

Abstract: According to some embodiments, described herein is a system and method for classifying and grouping users of a task database system based on their activities in completing tasks defined in the task database system. A cloud server communicatively coupled to the task database system receives task data from the task database system, receives a request for ranking users under a particular level in a user hierarchy, gathers user activity data from an activity data server, uses a predetermined algorithm calculate a raw score for each user based on the user's activity, normalizes the raw score, and generates a ranking of the users based on their normalized scores. The ranking can be used as an indicator for determining which users need additional training in communicating with outside parties in completing assigned tasks.

Abstract: A method for a multi-cluster warehouse includes allocating processing units as part of a data warehouse. The processing units access data within one or more databases in cloud storage resources. The method also includes providing one or more queries to each processing unit within the data warehouse. In response to the queries, each processing unit performs database operations on a particular portion of a database table. The method also includes monitoring a workload of the processing units to determine that a processing capacity of the processing units has reached a threshold processing capacity. The method also includes dynamically adding additional processing units to and removing processing units from the data warehouse as needed based on a workload of the processing units.

Abstract: A method for a multi-cluster warehouse includes allocating processing units as part of a data warehouse. The processing units access data within one or more databases in cloud storage resources. The method also includes providing one or more queries to each processing unit within the data warehouse. In response to the queries, each processing unit performs database operations on a particular portion of a database table. The method also includes monitoring a workload of the processing units to determine that a processing capacity of the processing units has reached a threshold processing capacity. The method also includes dynamically adding additional processing units to and removing processing units from the data warehouse as needed based on a workload of the processing units.

Abstract: Pre-computed query results stored at a database server are re-computed by a computation machine. The pre-computed query results are composed of a plurality of shares. Each share includes a certain number of pre-computed query results. The computation resources of the computation machine needed to re-compute a pre-computed query result of a first share depend on whether or not other pre-computed query results of the first share are re-computed during a given time interval forming a current re-computation cycle. The computation machine receives a request to re-compute pre-computed query results of at least a first share, determines a number of pre-computed query results in the first share to be re-computed in the current re-computation cycle based on a Reinforcement Learning algorithm, and re-computes the determined number of pre-computed query results in the first share.

Abstract: A computer-implemented method may comprise receiving proposals to mutate a data stored in a distributed and replicated file system coupled to a network, the distributed and replicated data system comprising a plurality of nodes, each comprising a server. A metadata service maintains and updates a replica of a namespace of the distributed and replicated file system and coordinates updates to the data by generating an ordered set of agreements corresponding to the received proposals, the ordered set of agreements specifying an order in which the nodes are to mutate data stored in data nodes and cause corresponding changes to the state of the namespace. For each agreement in the generated ordered set of agreements, a corresponding writers list may be provided that comprises an ordered list of nodes to execute the agreement and make corresponding changes to the namespace.

Abstract: The exemplary embodiments disclose a system and method, a computer program product, and a computer system for naming a digital file. The exemplary embodiments may include detecting a user saving an unnamed digital file to a digital folder, extracting one or more first features from data collected from one or more named digital files within the digital folder, generating one or more models correlating the extracted one or more first features with one or more names of the one or more named digital files, extracting one or more second features from the unnamed digital file, and determining a name for the unnamed digital file based on applying the one or more models to the extracted one or more second features.

Abstract: A query processing system applies transforms to convert a collection of predicate statements to two parts, a matrix and a set of reduced predicate statements, and evaluates the matrix and reduced predicate statements when querying data. The query processing system applies the transforms to extract conjunctive predicates or disjunctive predicates from the predicate statements to provide the set of reduced predicate statements and generates the matrix using the extracted conjunctive predicates or disjunctive predicates. When data is received for querying, the query processing system evaluates the matrix and reduced predicate statements for the data to provide search results. The query processing system may first identify candidate predicate statements that may be satisfied for the data from the matrix and then evaluates the reduced predicate statements for those candidate predicate statements.

Abstract: This disclosure provides various techniques that may allow for accessing values stored in a data structure that stores multiple values corresponding to database transactions using a skip list. A key may be used to traverse the skip list to access data associated with the key. The skip list maintains on ordering of multiple keys, each associated with a particular record in the data structure, using indirect links between data records in the data structure that reference buckets included in hash table. Each bucket includes pointers to one or more records in the skip list.

Abstract: A computing system may include a server, and a client computing device in communication with the server and operating a local mobile OS. One of the client computing device and the server may be configured to compare a notification message with a database of flagged terms to determine whether the notification message includes a flagged term. If the notification message includes the flagged term and the local mobile OS is in a locked state, the notification message is revised by replacing the flagged term with a placeholder term, and the revised notification message is displayed on a display.

Abstract: A first client device associated with a first account of a content management system can receive a first or latest version of a synchronized content item. The first client device can determine differences or the “diff” between the first version and a second or next-to-latest version of the content item and upload the first version and the diff to the content management system. Upon receiving the first version and the diff, the content management system can store the first version and the diff and download them to the second client device. The second client device can generate a notification when the download finishes and present the notification with an interface element for requesting presentation of the diff. When the second client device detects a selection of the interface element, the second client device can present the diff.

Abstract: A computer-implemented method is disclosed for saving content. The method can include receiving, by one or more computing devices from a user at a first time, a first user input directed to a portion of a web page; receiving, by the one or more computing devices at a second time after the first time, a second user input describing a search query, and providing for display, by the one or more computing devices, data describing the portion of the web page in response to receiving the second user input.

Abstract: An apparatus stores received data blocks as deduplicated data blocks. The apparatus is configured to: maintain a plurality of containers, where a reference to a container is unique within the apparatus and each container includes one or more data segments and segment metadata for each data segment, the segment metadata including a segment identifier and a segment reference, where the segment identifier is unique within the container and the segment reference is unique within the apparatus; and maintain a plurality of deduplicated data blocks storing received data blocks, where each deduplicated data block includes a plurality of identified container references, where a container reference identifier is unique within the deduplicated data block, and an ordered list of one or more segment indicators.

Abstract: Embodiments relate to a system, program product, and method for use with an intelligent computer platform and cognitive processing and associated distribution. The embodiments support a mechanism for dynamically sharing critical and non-critical information responsive to a classification model, such that only relevant information or part of the information is shared. As the classification model is subject to modification, the dynamic sharing mechanism is dynamically updated to reflect such modification. Similarly, as an associated document or file is subject to modification, dynamic processing of the document or file takes place responsive to the classification model. The dynamic classification and document processing employ NLP and ML models to support the associated functionality.

Abstract: In some examples, a computer system may receive a data object including object data. For example, the system may be one of three or more systems and each system may be located at a different respective geographic location. The system may determine a value representative of the object data content. The system may further determine a plurality of chunks by dividing the object data into a plurality of data chunks based on a total number of the systems and determining a parity chunk for the plurality of data chunks. The system may determine a respective role value corresponding to each of the systems, and may send individual ones of the chunks to respective ones of the systems based on the role value and the value representative of the object data content. In some examples, each system may perform data deduplication independently of the other systems based on received chunks.

Abstract: A method for linking a first knowledge graph (KG) and a second KG in the presence of a third KG is provided. Content of nodes of the first KG is compared to nodes of the second KG. If a first KG node has a content relationship to a related second KG node, an edge identified by a tuple identifying the first KG and the first KG node and a tuple identifying the second KG and the second KG node is stored in a meta-layer KG. The method comprises comparing content of the nodes from the third KG with the content of nodes from the first and second KG, and in case relationships are identified, more complex tuples establishing this relationship in the meta-layer are stored. Finally, the method also comprises storing at least all nodes and edges of the meta-layer knowledge graph.

Abstract: A computer system is coupled to a local storage system and a remote storage system, and comprises a data mover, and a recall size analysis unit. The recall size analysis unit uses a combination of type of the data and size of the data as a retrieval key of an access characteristics to analyze the logs of the same access characteristics and to determine a recall size for each of the access characteristics. The data mover obtains a target data corresponding to the recall size of the access characteristics of the target data from the remote storage system in a case of receiving a read request for the target data that is not stored in the local storage system.

Abstract: Techniques are disclosed relating to efficiently processing of concurrent database transactions. In one embodiment, a database system receives a first key-value pair for a database transaction and stores the key-value pair in a data structure for active database transactions. The storing may include indexing into a hash table of the data structure with a key of the key-value pair to identify a hash bucket of the hash table corresponding to the key, acquiring a latch associated with the identified hash bucket, and, based on a state of the acquired latch, appending, to the hash bucket, a record specifying the key-value pair. The database system may cause the key-value pair from the data structure to be committed to persistent storage in response to the database transaction being committed.

Abstract: In one embodiment, a method includes receiving, at a job control manager, a command specifying execution of a batch application. The method also includes receiving, at the job control manager, a commit count associated with the batch application, and initiating the batch application, with the batch application processing a group of records. The method also includes locking a first record of the group of records in response to the first record being processed by the batch application with the proviso that the batch application does not cause the first record to be unlocked unless the batch application has finished processing a last record in the group of records. Moreover, the method includes committing, in response to the batch application having completed processing of an nth record of the group of records, all records of the group of records that are locked resulting from execution of the batch application.