Abstract: A data intake and query system processes and stores events, which are associated with token identifiers for tokens corresponding to data sources for the messages that the events are generated from. Thus, the data intake and query system can receive a request to provide analyses and visualizations regarding stored events associated with a particular component associated with a plurality of events, such as a data source for the messages from which the plurality of events are generated from. These requests and the resulting visualizations can be customized based on selected tokens and selected components.

Abstract: The present disclosure relates to performing similarity metric analysis and data enrichment using knowledge sources. A data enrichment service can compare an input data set to reference data sets stored in a knowledge source to identify similarly related data. A similarity metric can be calculated corresponding to the semantic similarity of two or more datasets. The similarity metric can be used to identify datasets based on their metadata attributes and data values enabling easier indexing and high performance retrieval of data values. A input data set can labeled with a category based on the data set having the best match with the input data set. The similarity of an input data set with a data set provided by a knowledge source can be used to query a knowledge source to obtain additional information about the data set. The additional information can be used to provide recommendations to the user.

Abstract: The present disclosure provides techniques for deduplicating files. The techniques include creating a data structure that organizes metadata about chunks of files, the organization of the metadata preserving order and locality of the chunks within files. The organization of the metadata within storage blocks of storage devices matches the order of chunks within files. Upon a read or write operation to a metadata, the preservation of locality of metadata results in the likely fetching, from storage into a memory cache, metadata of subsequent and contiguous chunks. The preserved locality results in faster subsequent read and write operations of metadata, because the read and write operations are likely to be executed from memory rather than from storage.

Abstract: A method, a system, and a computer program product for executing a query in a database system. A query plan for execution of a query is generated. The query requires access to at least one table stored in a database system. One or more occurrences of one or more duplicate predicates is detected in the query plan. In response to detecting a first occurrence of the duplicate predicates, one or more intermediate query execution results responsive to the duplicate predicates are generated. The generated intermediate query execution results are cached. Query execution results incorporating cached intermediate query execution results being responsive to each occurrence of the duplicate predicates subsequent to the first occurrence of the duplicate predicates in the query plan are generated.

Abstract: A public center is disclosed. The public center includes at least one content source configured to provide a plurality of input contents and at least one content converter device for generating a plurality of output contents from the plurality of input contents based on user requests from a plurality of users. The content converter device includes an input module configured to receive a user request from a user of the plurality of users and an input content of the plurality of input contents based on the user request. The content converter device further includes a processing module configured to generate an output content from the input content based on input content characteristics. The public center includes a plurality of content access devices configured to provide the plurality of output contents received from the at least one content converter device to the plurality of users.

Abstract: A method of retrieving an image file from a first database, where the image file includes a link to an associated report stored in a second database. The method includes: de-identifying the report; applying a search query to the second database; returning the report in response to the applied query; applying the link to the first database; and returning the image file in response to the applied link.

Abstract: Methods, devices and systems for computing interactive customized content in response to a scan, or multiple scans, of a machine-readable label are provided. Illustrative methods may include receiving, from a user or group of users, a scan of a machine-readable optical label captured using a camera of a mobile device. Methods may include determining, based on the scan or scans, one, or more than one, redirect Uniform Resource Locator(s) (URL(s)). Methods may include generating, based on a user profile or group of user profiles and a redirect service that is accessed using the redirect URL, customized content associated with the scan. Methods may include redirecting the user or users to one or more target landing page URL(s), and providing to the user or users, through a browser on the mobile device or mobile devices, one or more than one target landing page(s) that includes the customized content.

Abstract: A computer system processes a query to retrieve credible search results. One or more data sources are searched to retrieve search results pertaining to the query. Analytics are performed on the search results to produce a score for the search results, wherein the score indicates credible information within the search results and the analytics include one or more from a group of natural language processing and emotion analytics. In response to the score indicating a lack of credible information within the search results, the search results are analyzed to determine a consensus within the search results, wherein the consensus indicates credible information within the search results. The credible information of the search results is presented. Embodiments of the present invention further include a method and program product for processing a query to retrieve credible search results in substantially the same manner described above.

Abstract: A method, computer program product, and a system where a processor(s) obtains a video from a user, via a client, and segments the video into temporal shots that comprise a timeline of the video. The processor(s) cognitively analyze the video, by applying an image recognition algorithm to identify image entities in each temporal shot of the video and by applying a data structure comprising a user profile of the user to the temporal shots, to identity personal entities in each temporal shot of the video. The program code generates a search index for the video, utilizing the user entities (image entities and personal entities), where each entry of the search index is a given user entity and a linkage to a given temporal shot and the linkage indicates a location of the given user entity in the timeline of the video.

Abstract: Some aspects provide: analyzing data exchange database records of a first entity; determining a sector with which the first entity is associated by at least one of the analyzing and first entity input identifying the sector; analyzing data exchange database records of second entity(ies) different from the first entity, to determine sector associated second entity(ies) data exchanges; analyzing the sector associated second entity(ies) data exchange records to determine data baseline(s); analyzing the first entity data exchange records to determine first entity data baseline(s), at least one of which corresponding in type to a respective one of the data baseline(s); comparing one of the data baseline(s) to a corresponding one of the first entity data baseline(s); identifying the relevant information based on the comparing; and notifying, via a communication module of the computing device, over a network, an electronic device associated with the first entity of the relevant information.

Abstract: A file discovery method, comprising receiving file discovery data comprising, for each of a plurality of files, discovery information and signature data, the discovery information for a first file of the plurality of files being indicative of at least one directory to be scanned for another of the plurality of files relative to a first directory, scanning, in a first scanning operation, a file system for the first file, and scanning, in a second scanning operation subsequent to the first scanning operation, the at least one directory for a second file matching signature data comprised by the file discovery data using a path to the first file as the first directory.

Abstract: The present inventors devised techniques and technologies that streamline the protection of data stored on shared file storage e.g., on file servers, network-attached storage (NAS), share drives, network shares, etc., in a data storage management system. Some embodiments feature a proxy-less backup configuration in which backup services hosts are assigned to perform a secondary copy job, at job runtime, based on host attributes relative to the data source. Some embodiments are configured to, at job runtime, automatically resolve data paths to the source data, and automatically mount the data paths, rather than requiring data paths to be expressly pre-administered on all possible candidate backup machines. Some embodiments automatically protect data from shared file storage that was not expressly given a backup plan (“undefined” data) by applying default preferences for protecting undefined data.

Abstract: Methods and systems are disclosed improving run-time performance of a database. A non-production database is accessed, at a computer system, during a design phase of the non-production database. Code of the non-production database is tested against a production database. Data statistics are generated, at the computer system, based on performance metrics of how the non-production database would perform as the production database. The data statistics and at least one suggestion to implement into code of the non-production database to improve performance of the non-production database are displayed at the computer system.

Abstract: Each of a plurality of resource files can be instrumented. Thereafter, usage data of the received files is received from a plurality of clients each executing a different instance of a web application. The usage data comprises is collected by the instances of the web application when being used by a respective one of a plurality of users. A dependencies list is then generated for the resource files based on the received usage data. In addition, a priorities list is generated for the resource files using the received usage data which indicates how frequently the resource files are being used. Further, groups of resource files are generated based on co-occurrence levels of the resource files in the dependencies list and the priorities list. Later, at least a portion of the groups of resource files are transmitted to the client for caching in a local cache pool. Related apparatus, systems, techniques and articles are also described.

Abstract: The present disclosure relates to restricting generation and delivery of insights to data source providers. Electronic activities and record objects may be accessed. Each record object may correspond to a record object type and have one or more object field-value pairs. Node profiles may be maintained. Updates to a node graph or corresponding to a record object may be detected. A number of data source providers having respective electronic activities or record objects from which the update to the node graph or corresponding to the record object can be determined. Provisioning of a content item to a second data source provider may be restricted.

Abstract: Disclosed is a computer program stored in a computer readable storage medium according to an exemplary embodiment of the present disclosure. The computer program executes operations for enhancing search performance of data when the computer program is executed by one or more processors and the operations may include: setting a traverse time stamp of an index search for searching a target index key; searching the index tree along a link connected from a root node of the index tree to a leaf node; writing in a time stamp table at least one index time stamp of the root node and the leaf node passed in the index search; determining whether a path of the index search needs to be changed; and determining a start node of re-search at least partially based on the time stamp table.

Abstract: A method of increasing the efficiency of the Aviation Environmental Design Tool (AEDT) by using a computer algorithm to generate an input file with far fewer flight tracks than would normally be required to obtain the same AEDT results using the same data pool.

Abstract: Software for a website hosting short-text services creates an index of buckets for locality sensitive hashing (LSH). The software stores the index in an in-memory database of key-value pairs. The software creates, on a mobile device, a cache backed by the in-memory database. The software then uses a short text to create a query embedding. The software map the query embedding to corresponding buckets in the index and determines which of the corresponding buckets are nearest neighbors to the query embedding using a similarity measure. The software displays location types associated with each of the buckets that are nearest neighbors in a view in a graphical user interface(GUI) on the mobile device and receives a user selection as to one of the location types. Then the software displays the entities for the selected location type in a GUI view on the mobile device.

Abstract: In one aspect, there is provided a method. The method may include accessing a multi-version concurrency control block providing row state for a block of rows in a table of a database, the multi-version concurrency control block including a header portion and a data portion, the header portion including a type indicator indicating whether all of the rows of the block are visible to a plurality of threads at a database management system or invisible to the plurality of threads at the database management system. Related systems, methods, and articles of manufacture are also disclosed.

Abstract: A method, system and computer program product is disclosed for fuzzy searching. The method, which may be performed by one or more processors, may comprise providing a first prefix tree data structure representing a first data set comprising a first plurality of strings, and providing a second prefix tree data structure representing a second data set comprising a second plurality of strings. The first and second prefix tree data structures may each comprise nodes representing each character and edges connecting prefix nodes to one or more suffix nodes to represent each subsequent character in the string. A search may be performed to identify all matches between the first and second plurality of strings and also approximate matches between the first and second plurality of strings within a maximum distance k, wherein the search comprises traversing the first prefix tree data structure using a depth-first search algorithm to identify matches and approximate matches in the second prefix tree data structure.