Abstract: Techniques for improving access to and interactions with bots are described. In an example, a first bot, hosted on a computing system, may identify an action to be performed for a user associated with a computing device. The action may be identified based on a user interaction with the first bot, where the user interaction may be provided from the computing device. The first bot may select a second bot based on the action. The second bot may be hosted on a same or a different computing system. The first bot may determine, based on a previous user input to the first bot, a parameter value for an execution of the action and may send the parameter value to the second bot. In response, the first bot may receive a result of an execution of the action and may provide information about the result to the computing device.

Abstract: A computing system may include a database disposed within a remote network management platform that manages a managed network, and server device(s) associated with the platform and configured to: transmit, to a third-party computing system, a request for general information identifying computing resources of the third-party computing system assigned to the managed network; receive, from the third-party computing system, a response indicating resource names and types of the resources that were identified; based on the response, determine that a first resource is of a first type, and responsively store, in the database, a first representation that has just data fields containing the general information from the response that identifies the first resource; and based on the response, determine that a second resource is of a second type, and responsively store, in the database, a second representation that has data fields arranged to contain specific information about the second resource.

Abstract: Non-limiting examples describe enhanced searching and filtering of message content by an application/service. Processing operations described herein are applicable to any type of message content including but not limited to bundled content of an email service. A search input may be received through a user interface of an email service. The search input may be for searching emails associated with a mailbox the email service. Email results may be retrieved based on the received search input. The retrieved email results may be categorized into one or more categories. A smart filter may be generated for filtering the retrieved email results. An exemplary smart filter may comprise at least one filter field that corresponds to category specific content extracted from emails of a category of the one or more categories. The email results and the smart filter may be displayed through the user interface of the email service.

Abstract: Method and systems for parallel scoring an ensemble model are provided. Aspects include loading data into a first distributed data structure having a plurality of partitions, each partition having loaded data in the form of a set of pairs of data formed of a record to be scored and a partial score for that record. A component model in the ensemble model is selected and processing of the records carried out in parallel across the partitions including updating the partial score for each record. In response to a partial score for a record not meeting an accuracy threshold, the method retains the record in the first distributed data structure to be scored by a subsequent component model. In response to the partial score for a record meeting the accuracy threshold, the method moves the record and updated partial score to an output result data structure to provide a final score.

Abstract: Disclosed herein are system, method, and computer program product embodiments for efficiently providing transaction-consistent snapshots of data stored in or associated with a database stored within a database management system. An embodiment operates by receiving, at a source database, an update request to update a table at the source database and transmitting a message to a cache node to invalidate a copy of a table time stamp associated with the table, where the copy of the table time stamp is stored at the cache node. The embodiment continues by updating the table at the source database based on the update request.

Abstract: Techniques are described herein for cloning a database. According to some embodiments, a database server receives a request to clone a source database. In response to receiving the request, the database server retrieves a set of one or more storage credentials for a set of one or more respective storage systems on which a set of files of the source database are stored. The set of storage credentials grant permission to the database server to create snapshot copies on the set of storage systems. The database server generates, for a target database using the set of storage credentials, a snapshot copy of each respective file in the set of files of the source database. The snapshot copy of the respective file points to the same set of one or more data blocks as the respective file until at least one of the data blocks is modified.

Abstract: A method, system, and computer program product are disclosed for generating search results. In an embodiment, a method comprises receiving a first search query from a user; determining a cognitive state of the user; receiving a second search query from the user; identifying results for the second query; and ranking the search results based, at least in part, on the cognitive state of the user when the user makes the first query. In an embodiment, the invention provides a system for generating search results, wherein a user makes a first search query and a cognitive state of the user is determined. In an embodiment, the system comprises one or more processing units configured for receiving a second search query from the user; identifying results for the second query; and ranking the search results based, at least in part, on the cognitive state of the user when the user makes the first query.

Abstract: The embodiments described herein relate to managing compressed data to optimize file compression. A first compression is performed on a first set of data to create first compressed data. The first compressed data is stored in one or more blocks of a first compression group. A size of free space of a last block of the first compression group is discovered and calculated. A second compression is performed on a second set of data to create second compressed data. At least a portion of the second compressed data is supplied to the first compression group for padding into the last block in response to determining that the size of the free space is sufficient. An unpadded portion of the second compressed data is stored in one or more blocks of a second compression group.

Abstract: A method generating a platform-agnostic abstract syntax tree (AST) comprises receiving data in a predefined format, through an input unit; subsequently parsing the data to extract model information corresponding to the predefined format of the data; and transforming, by a processing server, the model information to an abstract syntax tree (AST) structure. The above steps aid in generating, by the processing server, a platform-agnostic AST by combining predefined metadata and the abstract syntax tree (AST) structure.

Abstract: The embodiments described herein relate to managing compressed data to optimize file compression. A compression is performed on a first set of data to create a first set of compressed data partitions in a compression group. A partition table is constructed, and partition entries for the first data block are added to the table in conjunction with the first set. A current size of the compression group is assessed. In response to a compression ratio being greater than a target compression ratio and internal fragmentation of the compression group being smaller than a threshold, the compression group is dynamically completed. The dynamic completion decides a size for the compression group. The partition table is added to the compression group by assigning space within the first compression group for the table. The compression group is written to persistent storage.

Abstract: A method, article of manufacture, and apparatus for deduplicating data on a distributed file system is discussed. Metadata requests are made to an object store to determine whether the store already contains a data object. If the object store does contain the data object, a commit request is sent to a metadata server. If the object store does not contain the data object, the data object is transmitted to the object store.

Abstract: Disclosed is a method of efficiently inviting a subscription to contact information, the method including receiving a subscription invitation request of particular contact information of a first client from the first client; and determining whether a condition for allowing the subscription to the particular contact information is included in the subscription invitation request, and transmitting a subscription request containing address information by which the condition and the particular contact information can be received to a second client when the condition is included. Accordingly, it is possible to provide a communication service at a high speed in a communication system supporting various types of communication services without a waste of resources, power, or memories. Also, it is possible to provide a data transmission/reception method capable of easily and quickly providing a CAB service according to a selection by user's intention.

Abstract: Embodiments of the present disclosure provide a computer program product, a system and a method for providing access to storage resources by receiving a user selection of one or more of a plurality of source storage resources; establishing corresponding backup storage resources for the selected one or more source storage resources.

Abstract: Users are most likely to search for documents “around” them, such as documents which are created, read, or modified by other users they work closely or collaborate with, documents on sites the user frequents, and/or documents trending around them, in addition to documents they've created or interacted with themselves. Therefore, embodiments are directed to relevance ranking of query results based on external context. A search service may receive a query and an external context list, determine a relevance value for each entry in the external context list, and perform the query, where a search index comprising items may be returned in response to performance of the query. The search service may then match entries in the external context list against associated properties of the items, compute a score for the items based on the matching, and rank results of the query based on the score computed for the items.

Abstract: Technologies are described for facilitating database system recovery in a distributed database environment having a master node and at least one slave node. The master node maintains an in-memory reference that includes transaction identifiers and their corresponding commit identifiers. When a slave node requests that a commit identifier be assigned to a transaction, the transaction and commit identifiers for the transaction are added to the in-memory reference. The commit identifier is sent by the master node to the slave node. The slave node writes a log entry to a commit log that includes the transaction identifier and the assigned commit identifier. If the database system is interrupted before the slave node writes the commit log entry, the slave node can request the commit identifier for the transaction from the master node, which retrieves the identifier from the in-memory reference.

Abstract: The present invention is directed toward a system for database querying using natural language generation, which comprises identifying a first set of entities corresponding to an indexed data set in response to a user query, generating a ranked list of query intents using the first set of entities, wherein each item of the list of query intents represents a second set of entities associated with the user query and iterating over the ranked list of query intents to identify a top ranked intent associated to one of a set of predefined query plans. The predefined query plan associated with the top rank intent is executed using the set of entities corresponding to the top ranked intent, the predefined query plan comprising one or more search actions against the indexed data set. A first set of results is then received and a description is generated and transmitted.

Abstract: A system for reporting using archived data includes an active memory, an archive memory, an interface, and a processor. The interface is to receive an indication to run a report. The processor is to run the report. The report accesses active data in the active memory and archive data in the archive memory. The archive data comprises former active data that has been archived. The archive data is accessed using a relation of an active object in the active memory with an archived object in the archive memory.

Abstract: A system for updating archived data includes an active memory, an archive memory, an interface, and a processor. The interface is to receive an indication to update data structure. The processor is to update archive data structure in the archive memory. The archive data structure comprises a former active data structure that has been archived.

Abstract: A system to reduce a required memory area (storage capacity) and save time and effort for updating target attributes in aggregation processing is disclosed. The system for aggregating data includes an index storing unit for storing DtoK indices arranged in predetermined order, each of the indices specifying a list of attributes included in a target data item from identification information of the target data item, and a word list that is a list of attributes included in a plurality of the target data items, and an aggregation processing unit for finding, for each attribute, target data items including the attribute and executing aggregation processing for aggregating attributes whose relation with the target data items meets a predetermined standard. A link is created for each attribute in the word list for sequentially following an element in the index for each target data item, and target data items are found based thereon.

Abstract: A KVS tree and operations thereon are described herein. A key-value set (kvset) is received to store in a key-value data structure on at least one machine readable medium. The kvset includes a mapping of unique keys to values with the keys and the values of the kvset being immutable. The key-value data structure is organized as a tree with nodes of the tree including a temporally ordered sequence of kvsets. The kvset, once received, is written to a sequence of kvsets of a root-node of the tree.