Abstract: A conversational agent facilitates conversational searches for users. The conversational agent is a reinforcement learning (RL) agent trained using a user model generated from existing session logs from a search engine. The user model is generated from the session logs by mapping entries from the session logs to user actions understandable by the RL agent and computing conditional probabilities of user actions occurring given previous user actions in the session logs. The RL agent is trained by conducting conversations with the user model in which the RL agent selects agent actions in response to user actions sampled using the conditional probabilities from the user model.

Abstract: A system and method is provided for generating a dynamic comprehensive domain review. A domain review engine obtains authoritative literature associated with a domain to extract insights using entity recognition and relationship extraction, and ranks the extracted results to generate a dynamic domain review.

Abstract: Embodiments disclosed herein provide a system and method for analyzing an identity hub. Particularly, a user can connect to the identity hub, load an initial set of data records, create and/or edit an identity hub configuration locally, analyze and/or validate the configuration via a set of analysis tools, including an entity analysis tool, a data analysis tool, a bucket analysis tool, and a linkage analysis tool, and remotely deploy the validated configuration to an identity hub instance. In some embodiments, through a graphical user interface, these analysis tools enable the user to analyze and modify the configuration of the identity hub in real time while the identity hub is operating to ensure data quality and enhance system performance.

Abstract: A system, method and computer program product compares data in original and modified versions of spreadsheet or database table documents, and generates a comparison document having indications where changes between the documents are present. The data compared includes formulas or stored procedures that are normally hidden when viewing a spreadsheet or database table document.

Abstract: A database system may determine that a database is unavailable to generate an identifier for an event or that events may not be written to the database. As a result, the database system may write the event to a low-latency, supplementary file system. The database system may determine that the database is available at a later time, and read the event from the supplementary file system, store the event in a memory component, and then delete the event from the supplementary file system. The database system may then access the database to generate an identifier for the event, write the event to the database, and then delete the event from the memory component.

Abstract: A method begins by a dispersed storage (DS) processing module storing a data portion in a dispersed storage network (DSN), where the data portion is associated with a set of data index keys, a version index key, and with a set of portion index keys. The method continues with the DS processing module traversing, based on the set of data index keys, a plurality of index structures to determine whether an object retrieval structure exists for the data portion. When the object retrieval structure exists, the method continues with the DS processing module updating the object retrieval structure by determining whether a version record exists that corresponds to the version index key and when the version record exists, creating, within the version record, a new data portion record for the data portion to include an identifier of the data portion and the set of portion index keys.

Abstract: Embodiments can provide a computer implemented method in a data processing system comprising a processor and a memory comprising instructions, which are executed by the processor to cause the processor to implement a system for providing classification job estimation for a data security platform comprising one or more data sources, the method comprising: for each of the one or more data sources: counting the number of databases; counting the number of tables in each database; selecting a random database; selecting a random table within the random database; retrieving a database data sample from the random table; measuring one or more latencies associated with issuing and retrieving the database data sample; measuring a processing time required to evaluate the database data sample against one or more policy rules; compiling one or more mean times for the latencies and processing times; and calculating a data source scan time using the one or more mean times and the number of tables in each database; and calcul

Abstract: A computer system can generate a materialized query table (MQT) for data from a base table that has a plurality of rows and columns that each contain stored data. The computer system can receive a query to data stored in a row from the base table. The system can identify a column in the row and determine that data from a cell in the row and the column is above a threshold memory size. The system can generate, in response to determining that the data being above the threshold memory size, an MQT that includes data for the row and that includes a reference pointer that points to a location shared with another table.

Abstract: A method and system to optimize future performance of a database management system is provided. When a request to prepare a structured language query statement is received, historical hardware statistics data of operating parameters of a database management system is analyzed for optimization of the structured language query statement. The computer determines whether a prediction module of the computer is enabled to create a prediction of future hardware statistics data of the operating parameters of a database management system for a scheduled execution time using a predetermined data mining technique that analyzes historical statistics data. A prediction is created of the future hardware statistics data for the scheduled execution time, and a structured language query execution plan is generated using the future hardware statistics data. The structured language query statement is executed according to the structured language query execution plan at the scheduled execution time.

Abstract: Mechanisms for disassembling and reassembling a tar archive are disclosed. A computing device accesses a tar archive comprising a file payload data segment and a plurality of non-payload data segments. The non-payload data segments in the tar archive are identified. The non-payload data segments are stored in a replay log structure. The file payload data segment of a file is identified in the tar archive, and file identification data identifying the file is stored in the replay log structure. The file payload data segment is not stored in the replay log structure.

Abstract: Systems and methods for securely replicating a database include receiving, at a server with access to a database comprising a plurality of database entries, a request to replicate the database to a computing device, wherein access to each database entry of the plurality of database entries is controlled based on a plurality of classification levels; determining, by the server, a classification level of the computing device; filtering, by the server, the plurality of database entries to generate a filtered subset of the plurality of database entries, wherein the filtered subset comprises database entries at or below the classification level of the computing device; sending, to the computing device, the filtered subset, wherein the computing device uses the filtered subset to create a replicated database.

Abstract: Embodiments are directed to a file system engine that provides a file system with parent objects associated with child objects. The file system engine provides a replication snapshot associated with an epoch of the file system such that each child object modified during the epoch and each associated parent object is associated with the replication snapshot. A root object of a portion of the file system included in the replication snapshot may be provided. A replication engine may traverse the portion of file system starting from the root object such that the parent objects that are not associated with the replication snapshot are omitted from the traversal. The replication engine may determine replication objects based on the traversal such that each replication object was modified during the epoch. Then the replication engine may execute a replication job that copies replication objects to a target file system.

Abstract: In one respect, there is provided a method. The method can include processing a first data chunk to generate a first intermediate result. A key map can be generated based on a determination that a quantity of the key-value pairs in the first intermediate result exceeds a threshold. The key map can be generated to include keys in the first intermediate result. A second data chunk can be processed to generate a second intermediate result. The second data chunk can be processed based on the key map. The processing of the second data chunk can include omitting a key-value pair in the second data chunk from being inserted into the second intermediate result based on a key associated with the key-value pair being absent from the key map. A preview of the processing of the dataset can be generated based on the first intermediate result and the second intermediate result.

Abstract: In one embodiment, a computer-implemented method comprises receiving, from a second computing device at a first computing device that is communicatively coupled to the second computing device, a request to store a first entity data object, the first entity data object including a first property key-value pair; using the first computing device, storing the first entity data object in one or more digital data repositories in response to the request; receiving, from the second computing device at the first computing device, a delete command that specifies the first property key-value pair to delete by; in response to the delete command that specifies the first property key-value pair to delete by, deleting the first entity data object in the one or more digital data repositories.

Abstract: Exemplary embodiments of the present disclosure provide for identifying similar trademarks from one or more repositories based on training a goods and/or services similarity engine to identify similarities between pairs of descriptions of goods and/or services in a corpus of training data that includes the descriptions of goods and/or services for registered trademarks and trademark classes associated with the descriptions of goods and/or services. A goods and/or services similarity value indicative of similarities between a reference description of goods and/or services and descriptions of goods and/or services associated with registered trademarks can be generated by a goods and/or services similarity engine and a presentation of at least a subset of the set of trademarks can be generated that includes graphics emphasizing the registered trademarks in the subset based, at least in part, on the plurality of goods and/or services similarity values.

Abstract: Examples of an intelligent data quality application are defined. In an example, the system receives a data quality requirement from a user. The system obtains target data from a plurality of data sources. The system implements an artificial intelligence component sort the target data into a data cascade. The data cascade may include a plurality of attributes associated with the data quality requirement. The system may evaluate the data cascade to identify a data pattern model for each of the attributes. The system may implement a first cognitive learning operation to determine a mapping context from the data cascade and a conversion rule from the data pattern model. The system may establish a data harmonization model corresponding to the data quality requirement by performing a second cognitive learning operation. The system may generate a data cleansing result corresponding to the data quality requirement.

Abstract: A system receives an association of first item with first system user, generates first hash value by applying first hash function associated with first system user to first item identifier associated with first item, and sets a bit corresponding to first hash value in array. The system receives an association of second item with second system user, generates second hash value by applying second hash function associated with second user to second item identifier associated with second item, and sets a bit corresponding to second hash value in array. The system receives a request to determine whether third item is associated with first system user, generates third hash value by applying first hash function to third item identifier associated with third item, and outputs message that third item is not associated with first user if a bit corresponding to third hash value is not set in array.

Abstract: In one respect, there is provided a distributed database system. The distributed database system can include a plurality of nodes and a plurality of optimizers. A first optimizer of the plurality of optimizers can be configured to: receive, from a client, a command; generate, based at least in part on global metadata cached by the first optimizer, an execution plan for fulfilling the command that includes one or more tasks to be performed by at least a first node of the plurality of nodes; determine that at least one task of the one or more tasks are not successfully performed by the first node; and in response to determining that at least one task of the one or more tasks are not successfully performed by the first node, updating the cached global metadata at the first optimizer.

Abstract: A method is used in managing recovery of file systems. A determination is made during recovery of a file system as to whether information required for recovering the file system is missing. Based on the determination, storage for a slice is provisioned. The slice is updated with the information required for recovering the file system. Recovery of the file system is performed.

Abstract: A system for providing a search service application is disclosed and includes an application builder component that provides a search model for a first object of a plurality of objects. The search model is based at least on an end-user input field corresponding to a first attribute of the first object and a search result output field corresponding to a second attribute of the first object. The search model is also associated with a backend data store that supports a storage structure that stores information relating to the first object. The system also includes a deployment engine that automatically configures a search engine system associated with the backend data store to generate new search indexes based on the search model, and to place a portion of indexed data into a first partition and to place another portion of indexed data into at least another partition based on the search model.