Abstract: A search interface is displayed in a table format that includes a plurality of columns, each column including data items of an event attribute, the data items being of a set of events, each column being selectable by a user, and a plurality of rows forming cells with the one or more columns, each cell comprising one or more of the data items of the event attribute of a corresponding column. Based on the user selecting one or more of the columns, a list of options is displayed corresponding to the selected one or more columns, and one or more commands are added to a search query that corresponds to the set of events. The one or more commands are based on at least an option that is selected from the list of options and the event attribute of each of the selected one or more columns.

Abstract: Embodiments of the present invention provide automated systems and methods for selectively finding and deleting dormant data (out of data, inactive data) in a configuration management database (CMDB), or in a database which has similar characteristics. The method includes using a directed graph where each node of the directed graph represents a configuration item, and traversing the directed graph in order to determine inactive or dormant data, and all of the objects which depend on that data. Configuration items are deleted only when all of the other configuration items from which it depends contain dormant data.

Abstract: A computer-navigable trie structure used in order to represent predicates for matching foreign keys to primary rows in a primary table. The predicates may be wide ranging, and each may be represented by a corresponding descendant path of the trie structure, and defines which foreign keys are to be mapped to the particular row. The trie structure is built by incrementally augmenting the trie structure as each predicate is analyzed. During later use of the trie structure, each foreign key that is a candidate for mapping to one or more parent rows are evaluated. The foreign key is used to navigate through a set of one or more descendant paths of the computer-navigable trie structure. Matching parent rows may then be identified based on the identity of the navigated descendant paths. The foreign key may then be mapped to each of the one or more matching parent rows.

Abstract: A method includes assigning an access permission of a first user to a query object that represents a first query, the access permission granting the first user access rights to one or more data sources of the first query, the access permission being assigned as a runtime permission of the first query, granting a request from a second user to execute a second query, the first query being a subquery of the second query, and allowing the second user to execute the first query on the one or more data sources of the first query using the runtime permission assigned to the first query in executing the second query using the first query as the subquery.

Abstract: Methods, systems, and software are disclosed herein for facilitating personas in communication exchange environments. Aspects of the disclosure include search requests to search for relevant personas. In response to each of the search requests, different contact sources are searched for any relevant contacts. Any relevant personas can then be returned having contact information assembled from the relevant contacts.

Abstract: Low-latency autonomous-analysis includes obtaining data expressing a usage intent with respect to a low-latency database analysis system that intent omits data corresponding to user input expressly requesting low-latency autonomous-analysis, obtaining requested results data based on the data expressing the usage intent, outputting requested visualization data representing at least a portion of the requested results data for presentation to a user, and, in response to outputting the requested visualization data, obtaining low-latency autonomous-analysis data by performing low-latency autonomous-analysis based on the data expressing the usage intent by identifying an autonomous-analysis predicate based on the requested visualization data, obtaining a defined autonomous-analysis latency constraint, obtaining the low-latency autonomous-analysis data based on the autonomous-analysis predicate in accordance with the defined autonomous-analysis latency constraint, such that the low-latency autonomous-analysis data d

Abstract: Techniques are describe herein for associating storage management properties with a group of files of a database referred to herein as a “file group”. In this system, storage management properties are defined at the database-level. Thus, multiple databases can be stored across a single disk group, gaining the benefits of having multiple block access devices working in parallel, but each respective database may be associated with a respective file group in a one-to-one relationship, so that each database can have different storage management properties.

Abstract: A method and system for managing queries in business intelligence platforms. It is determined that at least one requirement to complete a first query exceeds a threshold and in response, a redacted report failing to exceed the threshold is generated. The first query requests data from at least one business intelligence content from a first geographical region. In response to detecting a rejection, by a user, of the redacted report after the user had been prompted, to accept or reject the redacted report: (i) the first query is converted to a second query configured to be used by an Extract, Transform, and Load (ETL) program from a second geographical region; and (ii) a report responsive to the first query is generated.

Abstract: A system and method for preventing inefficient recalls in a hierarchical storage management (HSM) system are presented. Difference data may be received for updating a target file stored in a first storage system having at least an upper storage layer and a lower tape layer. The difference data may be stored in a stub file located on the upper storage layer and corresponding to the target file in the first storage system located on the lower tape layer. A recall operation may be executed that copies the target file from the lower tape layer to the upper storage layer. The difference data stored in the stub file may be copied to the target file copied onto the upper storage layer from the lower tape layer according to one or more predetermined events.

Abstract: Systems and methods are disclosed for implementing a data stream correlation user interface. The data stream correlation user interface provides workflows for selecting individual data sources from a matrix of data sources, identifying individual data fields of the data sources, establishing criteria for determining correlations between them, and reviewing and enabling user verification of correlated data sources. Correlations may be established based on the values of data fields in individual records of the data sources, and may be determined based on correspondences or associations between the values, lookup tables, formulas, user-specified criteria, or other relationships.

Abstract: An exemplary system, method and computer-accessible medium for modifying a design of an integrated circuit(s) (ICs), which can include, for example, modifying a logic gate(s) in the design for a protected input pattern(s), and providing a restoration unit(s) into the design, where the restoration unit(s) can be configured to (i) produce an error-free output(s) when a correct secret key can be applied to the restoration unit(s), and (ii) produce an erroneous output(s) when an incorrect key can be applied to the restoration unit(s); and ensure that the modified design along with the restoration unit produces at least one erroneous output with respect to the original design for only a pre-determined constant number of incorrect keys based on at least one input pattern.

Abstract: Methods, apparatus, systems and articles of manufacture are disclosed to improve spatial-temporal data management. An example apparatus includes a hypervoxel data structure generator to generate a root hexatree data structure having sixteen hypernodes, an octree manager to improve a spatiotemporal data access efficiency by generating a first degree of symmetry in the root hexatree, the octree manager to assign a first portion of the hypernodes to a positive temporal subspace and to assign a second portion of the hypernodes to a negative temporal subspace, and a quadtree manager to improve the spatiotemporal data access efficiency by generating a second degree of symmetry in the root hexatree, the quadtree manager to assign respective hypernodes of the positive temporal subspace and the negative temporal subspace to respective positive and negative spatial subspaces.

Abstract: Techniques are disclosure for a data enrichment system that enables declarative external data source importation and exportation. A user can specify via a user interface input for identifying different data sources from which to obtain input data. The data enrichment system is configured to import and export various types of sources storing resources such as URL-based resources and HDFS-based resources for high-speed bi-directional metadata and data interchange. Connection metadata (e.g., credentials, access paths, etc.) can be managed by the data enrichment system in a declarative format for managing and visualizing the connection metadata.

Abstract: An aspect includes aggregating a plurality of disparate datasets into a document store with semi-structured attributes, with each document in the document store specifying a geospatial location and a value of an environmental parameter at the geospatial location. The document store includes a plurality of documents specifying a plurality of different geo spatial locations and different environmental parameters, and the environmental parameters include a climatological parameter. Niche model layers are generated for the different environmental parameters at the geospatial locations. The niche models include a model layer for each of the different environmental parameters. A future geospatial location of a species is predicted based on environmental attributes of the species and contents of the niche model layers. The predicted future geospatial location of the species overlaid on a geographic map is output to a requestor.

Abstract: A search interface is displayed in a table format that includes one or more columns, each column including data items of an event attribute, the data items being of a set of events, and a plurality of rows forming cells with the one or more columns, each cell displaying a textual representation of at least one of the data items of the event attribute of a corresponding column. Based on a user selecting a portion of the textual representation in a corresponding cell, a list of options is displayed that corresponds to the selected portion of the textual representation. Furthermore, one or more commands are added to a search query that corresponds to the set of events, the one or more commands being based on at least an option that is selected from the list of options and the selected portion of the textual representation in the corresponding cell.

Abstract: A non-transitory computer-readable storage medium storing a program that causes a computer to execute a process, the process including searching data based on search conditions in response to receiving a search condition which designates an output data type, wherein the data is stored in a database, counting, for each of the searched data, a number of times each of the output data type is designated, storing type-converted data of at least one data in a storage device in association with the at least one data, generating, upon receiving, from a terminal device, a search condition which designates the specified output data type and by which the at least one data is searched, a search result by using the type-converted data stored in the storage device, and transmitting the search result to the terminal device.

Abstract: According to one aspect of the present disclosure, a method and technique for verifying data structure consistency across computing environments includes computing a first signature for a data structure of an application subject to checkpointing corresponding to a first computing environment residing on a server computer. A second signature for the data structure of the application corresponding to a second computing environment residing on a client computer is computed. The first and second signatures are compared to determine whether a change to the data structure exists. Responsive to a lack of change to the data structure based on the comparison, a mobility operation is enabled for the application between the server computer and the client computer.

Abstract: Methods, systems, and apparatus include computer programs encoded on a computer-readable storage medium, including a method for providing content. Search results responsive to a query are identified including a first search result in a top set of search results, the first search result associated with a first entity. A first eligible content item is identified for presentation along with the search results, the first eligible content item associated with the first entity. A combined content item is identified that is a combination of the first search result and first eligible content item and is to be presented as a search result responsive to the query. The combined content item is augmented including: identifying entities related to the first entity, identifying content items that are associated with the related entities, selecting at least one identified content item, and using content from the selected content items to augment the combined content item.

Abstract: According to some embodiments, system and methods for building a model are provided, comprising a display; a memory storing processor-executable process steps; and a processor to execute the processor-executable process steps to cause the system to: present a user interface on a display, the user interface including one or more user-entry fields to build a model, user-entry fields is associated with a selection of big data or small data for use with the model; receive at least one data source in a user-entry field associated with the model; determine if data in the data source includes big data or small data; and in response to the determination of big data or small data in the data source, execute the model with data from the data source in a big data or small data execution environment. Numerous other aspects are provided.

Abstract: The present disclosure describes techniques for entity classification and data enrichment of data sets. A data enrichment system is disclosed that can extract, repair, and enrich datasets, resulting in more precise entity resolution and classification for purposes of subsequent indexing and clustering. Disclosed techniques may include performing entity recognition to identify segments of interest that relate to an entity. Related data may be analyzed for classification, which can be used to transform the data for enrichment to its users.