Abstract: A method, computer program product and system for building a data model. In response to receiving a plurality of data field(s) as input, a database associated with each of the data fields(s) received is identified. A schema underlying the associated database is ascertained. One or more element(s) for each of the plurality of data fields(s) is identified based on applying the ascertained schema of the associated database(s). A data model is generated utilizing the identified one or more element(s) corresponding to each of the plurality of data field(s) associated to each of the database(s).

Abstract: In an exemplary embodiment of this disclosure, a method for loading data from a backup image of a database includes selecting a subset statement defining a subset of the data in the database. Tables of the database are identified based on metadata of the database. A target database is written having the structure but not the data of the identified tables. One or more table statements are constructed, by a computer processor, defining a subset of each identified table based on the subset statement. Selected data is unloaded from a backup image into the target database using respective table statements as filters.

Abstract: Methods, systems, and computer program products for optimization of query processing in a data federation system using priority queuing techniques are provided. Priority queuing techniques may include generating a query vector corresponding to a query, comparing the query vector to historical query vectors to determine similarity, determining an expected processing time for the query based on the determined similarity, and inserting the query into a priority ordered queue at a particular position based on the expected processing time.

Abstract: Embodiments of the present invention allow multiple checkpoints to be taken so that multiple versions of the filesystem, including a working version and at least two checkpoint versions, can be maintained over time. Specifically, at least three “superblock” root structures are used to manage multiple instantiations of the filesystem. The superblocks are preferably stored in fixed locations within the storage system for easy access, although they may alternatively be stored in other ways. The number of superblocks may be fixed or variable.

Abstract: The present disclosure is directed towards a citation formatting system and a method for operating an online research service for providing legal citations. The exemplary system provides the citation formatting function in a client-server architecture, receiving citations from a user's client access device over a computer network and communicating citation format suggestions back to the client access device for possible insertion into a document on the access device.

Abstract: In one exemplary embodiment, a computer-implemented method includes obtaining a data set from a data source. The data set is prepared for an analysis operation according to a problem type. A result is generated from an interactive geometric node based a geometric property of the data set. A specified condition is determined with the result from the interactive geometric node based on a query to the interactive geometric node. A system's geometric configuration is determined. A geometric control criterion is determined.

Abstract: An index shared between a plurality of tables is used to access a data sharing space (DSS) storing a set of rows from a base table having a plurality of rows with stored data. First data values of the index are identified in response to a query for a table. A subset of rows is then retrieved from the DSS using the index elements corresponding to the first data values. Second data values and some of the first data values are then identified in response to a second query for a table. A second subset of rows are then retrieved from the DSS using the index elements corresponding to the second data values and some of the first data values and the query is then applied to the subset of rows.

Abstract: Method to order query results, by processing a received query at least in part using a composite key index, wherein the composite key index comprises at least two key columns, wherein the at least two key columns comprise at least one pre-ordering column and an ordering column, wherein the query specifies ordering criteria to order a result set based on values of the ordering column, wherein the processing comprises receiving, from the composite key index, an ordering column value for each unique pre-ordering column value in the composite key index, identifying a first ordering column value as being ordered first according to the ordering criteria, and returning the first ordering column value as being responsive to the query.

Abstract: System, method, and computer program product to order query results, by processing a received query at least in part using a composite key index, wherein the composite key index comprises at least two key columns, wherein the at least two key columns comprise at least one pre-ordering column and an ordering column, wherein the query specifies ordering criteria to order a result set based on values of the ordering column, wherein the processing comprises receiving, from the composite key index, an ordering column value for each unique pre-ordering column value in the composite key index, identifying a first ordering column value as being ordered first according to the ordering criteria, and returning the first ordering column value as being responsive to the query.

Abstract: Techniques for processing queries are provided. In one approach, an execution plan for a query includes multiple sub-plans, one or more of which are selected at runtime while one or more other sub-plans are not executed during execution of the execution plan. In another approach, data about misestimate is generated and stored persistently for subsequent queries. In another approach, statistics for a database object are generated automatically and efficiently while the database object is created or data items are added thereto. In another approach, a hybrid histogram is created that includes a feature of frequency histograms and a feature of height-balanced histograms. In another approach, computer jobs are executed in such a way to avoid deadlock. In another approach, changes to a database object trigger a hard parse of a query even though an execution plan already exists for the query.

Abstract: A technique for cloud infrastructure backup in a virtualized environment utilizing shared storage includes obtaining a workload input/output (I/O) profile to the shared storage over a time period. An attempt to locate one or more time windows in the workload I/O profile for which a cloud infrastructure backup can be staged is initiated. In response to determining the cloud infrastructure backup can be staged during at least one of the time windows, staging of the cloud infrastructure backup is scheduled during a selected one of the time windows. In response to determining the cloud infrastructure backup cannot be staged during at least one of the time windows, an interference tolerance approach is employed for accessing the shared storage for active workloads and the cloud infrastructure backup during the staging of the cloud infrastructure backup.

Abstract: An embodiment of the invention comprises a method associated with a Web API ecosystem and API users includes identifying specified events over a period of time that respectively affect the ecosystem. Events can comprise an interaction between the ecosystem and a Web API user or a specified Web API. The embodiment further includes constructing a data structure that contains a data element representing each identified event. An interface is used to translate respective data elements between the data structure and a data store, wherein the data store represents translated data elements in a form different from that used to represent the data elements in the data structure.

Abstract: A method and system for generating summary details is provided. The method includes retrieving event data of associated with a user. Attributes are extracted from the event data and the event data is segmented into logical groups of related activities performed by the user. Key information and associated attributes of each logical group are identified and in response the user is evaluated. The logical groups of related activities are ranked and presented to the user. In response, an engagement summary associated with the user and the logical groups is generated.

Abstract: Event correlation may include identifying a feature set for each log file of a plurality of log files, and extracting the feature set for each event of a plurality of events in each log file of the plurality of log files. Event correlation may further include determining a plurality of trace event pairs linkage strength values for an event from a first log file of the plurality of log files and a plurality of events from a second log file of the plurality of log files. The trace event pairs linkage strength values may represent an overlap of the feature set for the event from the first log file and the feature set for each of the plurality of events from the second log file.

Abstract: A technique for cloud infrastructure backup in a virtualized environment utilizing shared storage includes obtaining a workload input/output (I/O) profile to the shared storage over a time period. An attempt to locate one or more time windows in the workload I/O profile for which a cloud infrastructure backup can be staged is initiated. In response to determining the cloud infrastructure backup can be staged during at least one of the time windows, staging of the cloud infrastructure backup is scheduled during a selected one of the time windows. In response to determining the cloud infrastructure backup cannot be staged during at least one of the time windows, an interference tolerance approach is employed for accessing the shared storage for active workloads and the cloud infrastructure backup during the staging of the cloud infrastructure backup.

Abstract: Enabling intelligent navigation is described, including: performing analysis of historical user activity data with respect to a query term to generate reference data associated with the query term; selecting a navigation recommendation model for the query term based at least in part on the reference data; using the reference data and the selected navigation recommendation model to determine a set of recommendation data associated with the query term, wherein the set of recommendation data includes at least a portion of a category system to be displayed in response to a subsequently received query including the query term.

Abstract: A container database stores redo records and logical timestamps for multiple pluggable databases. When it is detected that a first read-write instance of the pluggable database is opened and no other read-write instances of the pluggable database are open, offline range data associated with the pluggable database is updated. When it is detected that a second read-write instance of the pluggable database is closed, and the second read-write instance is the last open read-write instance, the offline range data associated with the pluggable database is updated. The pluggable database is restored to a logical timestamp associated with a restore request based on the offline range data.

Abstract: Methods for encoding file system metadata are described herein. According to one embodiment, a file system cache is maintained including information representing relationships between inodes and disk blocks of a disk having disk sections. Each disk section includes a data segment and a header encoding metadata for describing the data section of each disk section. The metadata is encoded using a set partitioning algorithm and each set represents a set of disk blocks. In response to a file system request for reading a disk section, metadata associated with the disk section is retrieved and decoded to extract information representing a relationship between inodes and disk blocks associated with the requested disk section. The file system request is then serviced using the decoded metadata and the associated data segment and one or more entries of the file system cache are updated using the decoded metadata.

Abstract: A method includes receiving information about a plurality of data chunks and determining if one or more of a plurality of back-end nodes already stores more than a threshold amount of the plurality of data chunks where one of the plurality of back-end nodes is designated as a sticky node. The method further includes, responsive to determining that none of the plurality of back-end nodes already stores more than a threshold amount of the plurality of data chunks, deduplicating the plurality of data chunks against the back-end node designated as the sticky node. Finally, the method includes, responsive to an amount of data being processed, designating a different back-end node as the sticky node.

Abstract: A method and system for facilitating an undo operation. In one embodiment, the method includes generating a plurality of control files, where each of the control files is associated with a batch of data that is received from a sending partition during a redistribution process, and where each control file includes a list of pages and corresponding ranges of rows of data that have been appended to the pages. The method also includes writing the control files to a persistent memory for each control file where all of the associated rows of the respective consistency point have been appended to pages and written to a persistent memory. The method also includes, in response to an interruption in the redistribution process, identifying pages and rows to be deleted during an undo operation based on the plurality of control files.