Abstract: Embodiments are directed to a computer implemented method of improving queries. The method includes performing a query on a document set, wherein documents that satisfy the query comprise a first subset of the document set and documents that do not satisfy the query comprise a complement subset. Thereafter, calculating a correlation for all terms in the complement subset, with respect to the complement subset. Thereafter determining a set of top correlated terms. A set of bottom correlated terms is determined. The set of top correlated terms and bottom correlated terms are presented to generate an improved query.

Abstract: Embodiments of the present disclosure relate to a database system for dynamically and automatically accessing and storing data items from multiple data sources. The system may, for example, determine data sources to access, and ways of accessing data items from those data sources, based on an indication of an analysis level and/or other analysis criteria. Further, the system may selectively and efficiently integrate data items from the multiple data sources. Selective integration of data items may be based, for example, on the indication of the analysis level and/or other analysis criteria. The system may further generate outputs of the selective integration of data items. These outputs may, for example, include specialized reports and/or user interfaces. The outputs of the system, in some implementations, may be interactive and dynamically updated in response to user inputs, for example.

Abstract: Disclosed is a system, method, and computer program product for implementing a log analytics method and system that can configure, collect, and analyze log records in an efficient manner. The log analytics system, method, and computer program product provide target-based configuration of log monitoring metadata. Variable pathnames (e.g., having variables instead of absolute pathnames) may be specified to identify a directory that contains log files to monitor.

Abstract: A method, system and computer program product for index maintenance in a computer system comprising a plurality of nodes, a database, and an index to the database. In one embodiment, the method comprises, for a defined period of time, building a snapshot of selected change requests received by the nodes to change the database. After this defined period of time, a selection is made, based on specified criteria, whether to rebuild a new index to the database, or to add entries to a current index. When the selection is to rebuild a new index, the new index is rebuilt based on data in the database and in the change requests in the snapshot. When the selection is to add entries to a current index, entries are added to the current index based on data in the database and in the change requests in the snapshot.

Abstract: Provided are a computer program product, system, and method for archiving data sets in a volume in a primary storage in a volume image copy of the volume in a secondary storage. A volume image in the secondary storage is created comprising a copy of the volume in the primary storage. For each of a plurality of data sets in the volume, data set level archive operations are performed comprising, determining from metadata for the data set whether an archival policy criteria is satisfied, requesting an exclusive lock to the data set, and in response to obtaining the exclusive lock and determining that the archival policy is satisfied, updating a directory for the data set to indicate that the data set is archived in the volume image.

Abstract: A method for propagating a structure query language (SQL) association can include determining, based at least on a syntax of a SQL create view statement, that a SQL association requires propagation to a SQL view associated with the SQL create view statement. The SQL association can combine data from at least a first data model and a second data model at a database. The SQL view can comprise at least a portion of the combined data. An association information data structure can be generated for storing information corresponding to a definition of the SQL association. The SQL create view statement can be executed based on the association information data structure. Related systems and articles of manufacture, including computer program products, are also disclose.

Abstract: A method and system of aggregating vehicle data to support vehicle investigations, according to one embodiment. In one embodiment, the method and system provides a vehicle search system. In one embodiment, the vehicle search system receives vehicle data. In one embodiment, the vehicle search system receives search data associated with a target vehicle. In one embodiment, the vehicle search system matches the vehicle data with the search data. In one embodiment, if the vehicle search system matches the vehicle data with the search data, alert data is provided.

Abstract: Embodiments are directed to a computer implemented method of improving queries. The method includes performing a query on a document set, wherein documents that satisfy the query comprise a first subset of the document set and documents that do not satisfy the query comprise a complement subset. Thereafter, calculating a correlation for all terms in the complement subset, with respect to the complement subset. Thereafter determining a set of top correlated terms. A set of bottom correlated terms is determined. The set of top correlated terms and bottom correlated terms are presented to generate an improved query.

Abstract: The present disclosure involves systems, software, and computer implemented methods for calculating hashes of archive files and their file entries. In one example, a method may include receiving an archive file which includes at least one compressed file, storing the archive file by sending a first copy of the archive file stream to a first processing thread which stores the archive file in a local file system, and applying a hash function to the archive file and the at least one compressed file to create hash values corresponding to the archive file and the at least one compressed file by sending a second copy of the archive file stream to a second processing thread, which applies the hash function to the archive file and the at least one compressed file to create the hash values and is executed in parallel to the first processing thread.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving user-specific content, the user-specific content being associated with a user of one or more computer-implemented services, processing the user-specific content using one or more parsers to identify one or more entities and one or more relationships between entities, a parser being specific to a schema, and the one or more entities and the one or more relationships between entities being identified based on the schema, providing one or more user-specific knowledge graphs, a user-specific knowledge graph being specific to the user and including nodes and edges between nodes to define relationships between entities based on the schema, and storing the one or more user-specific knowledge graphs.

Abstract: A query builder provided according to an aspect of the present invention facilitates users to conveniently generate database queries directed to database servers storing data elements organized according to attributes. In an embodiment, configuration data indicating a comparison predicate to be used for each combination of an attribute and a conditional operation is maintained. A user may then provide as inputs a first attribute, a first conditional operation and a first value. In response, the query builder examines the configuration data to determine a first comparison predicate specified for the combination of the first attribute and the first conditional operation. The query builder incorporates the first value in the first comparison predicate to construct a second comparison predicate and then forms a first database query with the second comparison predicate.

Abstract: Solutions are provided that use shared scan phases and scan output for various file-level incremental data analysis systems. In one embodiment, a shared scan phase is initiated for a plurality of files in a file system. During the shared scan phase, one or more rules are applied to the files in the file system to identify files on which to perform one or more operations. Shared scan output is created that includes information describing the identified files and operations to be performed on the identified files. Embodiments of the present invention can reduce the amount of time and computing resources that would otherwise be consumed by performing separate walkthroughs of a file system during separate scan phases.

Abstract: A method for highly efficient data sharding includes: receiving a dataset containing event data; identifying a classifier field of the dataset; identifying an event field of the dataset; generating a data structure for the dataset using the classifier field and the event field; and storing the dataset by partitioning the dataset into shards using the classifier field as a shard key and ordering data within each shard by the classifier field.

Abstract: A computer implemented method and a subpopulation size estimation and uncertainty quantification system (SE system) for estimating size of a target subpopulation size and quantifying size estimation uncertainty are provided. The SE system constructs an entity database including unique entities mapped to contacts retrieved from a contact database. The SE system receives a query defining target attributes of entities of the target subpopulation from a user device. The SE system estimates size of the target subpopulation delimited by the query by determining a first estimate of the size of the target subpopulation matching the target attributes by performing a mark and recapture estimation, and by determining a second estimate of the size of the target subpopulation matching the target attributes by performing a catch per unit effort estimation.

Abstract: Systems and methods for performing a recovery operation for a host. A user interface is provided than enables user interface interactions that are common to or independent of the host and user interface interactions that are specific to a client backup module selected for the recovery operation. The user interface retrieves a plug-in to enable the user interface interactions that are specific to the client backup module.

Abstract: Technology is provided for data set scoring. In one example, a method includes analyzing first and second characteristics of a data set. The first and second characteristics represent a quality of data values in the data set. At least the first characteristic is independent of the data values in the data set. The method further includes assigning a score to the data set based on the first and second characteristics. The data set may be ranked against a plurality of other data sets based on the score. The score of the data set may be provided together with a scoring scale to enable a determination of the quality of the data values based on the score.

Abstract: A system and method of caching and parameterizing intermediate representation code includes receiving, by a database, a query, parsing, by the database, the query to obtain a plan tree comprising a plurality of plan nodes arranged in hierarchical order descending from a top plan node, generating, by the database, node intermediate representations (IRs) for the plan nodes, executing, by the database, a first query using the node IRs, and reusing, by the database, the node IRs to execute subsequent queries.

Abstract: In one embodiment, a relational database is structured so that elements and alternatives directly reference parameter values stored in a unitized data store. No intermediary tables are required between the elements, the alternatives, and the parameter values. Further, a level tracking mechanism is employed among alternatives that allows for efficient bulk-data retrieval, for example, via a single database query. In one type of operation, an element of a system model is accessed. A selected scenario is accessed that references a plurality of alternatives that exist among a larger plurality of alternatives. Parameter values are retrieved from the unitized data store based on a direct reference from the element and a referenced alternative of the selected scenario. The unitized data store includes values for the larger plurality of alternatives. The retrieved parameter values are used in executing the system model.

Abstract: A population formation method is disclosed. Keywords are extracted from public information of providers included as elements in a first provider group. Each element is calculated based on a predetermined attribute value. A first attribute is for the providers of the public information. The attribute value is changed with time. Each of rules set for duplicate keywords is to determine one of the attributes by using one of the duplicate keywords. Provider groups are formed for new public information based on the duplicate keywords and the rules. A provider group having a similar relationship with a first provider group is specified by a distribution of the attribute value of a different attribute from the first attribute. A new provider group corresponding to the first provider group is formed by the providers, for whom the attribute value of the first attribute corresponds to the predetermined attribute value.

Abstract: A system and method for organizing and retrieving conditioned data is disclosed. The data retrieval application includes a criteria determination engine, an optimization engine and a retrieval engine. The criteria determination engine determines criteria set for a list of data elements. The optimization engine organizes the list of data elements into a directed acyclic graph embodying a skip list data structure and optimizes the constructed directed acyclic graph. The retrieval engine receives a query, determines the features of the query, queries the directed acyclic graph using the features and retrieves a node representing a user interface data based on the criteria set matching the features.