Abstract: Certain example embodiments relate to a method of storing data in a tabular data structure having columns and rows in a column-oriented storage system. At least one of the columns is divided into a plurality of segments. Each segment has an associated cell size that indicates the maximum size of the data items in the respective segment. When storing a data item into one of the segments, it is determined whether the size of the data item exceeds the cell size of the segment; and if the size of the data item exceeds the cell size of the segment, the cell size of the segment is adapted to accommodate the size of the data item. The adapting of the cell size of the segment to accommodate the size of the data item is performed independent of the cell sizes of the other of the plurality of segments.

Abstract: Techniques for a method for efficiently extracting data from multidimensional databases are disclosed herein. When extracting data from a subset of a multidimensional database, the method first extracts data from high-level cells within the subset. If there are any empty high-level cells, the method removes lower-level cells that roll-up into the empty high-level cell, without extracting data from these lower-level cells. The method improves the data extraction efficiency by reducing the overhead of extracting data from empty cells of multidimensional databases.

Abstract: An input query can be spell checked by first parsing the input query into one or more tokens. The one or more tokens are then compared against spell storage tables to derive alternative tokens. A spell cursor is launched, with the spell cursor calculating scores for permutations of the tokens and alternative tokens, and the scores representing a likelihood that a user intended to use the permutation as the input query. A memory table may then be formed including the permutations and scores. The memory table can then be passed to a column cursor, the column cursor designed to form an output table of results based on queries to a database using the permutations.

Abstract: Systems and methods for non-disruptive cache startup, shutdown, data partition movement, and node rebalancing for a data fabric within a data grid in a database environment. The data grid is a clustered in-memory database (IMDB) cache comprising one or more data fabrics including multiple IMDB cache nodes. The method takes a time tag and moves data from source to destination nodes while allowing updates to data on the source nodes. The method propagates updates occurring after the time tag to destination nodes from source nodes and switches applications and ownership to the destination nodes. Another method slices data for a partitioned fabric and stores slices on nodes. Another method starts a data fabric by moving data from a grid backend to the nodes. In an embodiment, another method rebalances nodes in a non-disruptive manner. When a fabric is shutdown, the method saves data from the nodes to the grid backend.

Abstract: A distributed storage system may store data object instances in persistent storage and may cache keymap information for those data object instances. The system may cache a latest symbolic key entry for some user keys of the data object instances. When a request is made for the latest version of stored data object instances having a specified user key, the latest version may be determined dependent on whether a latest symbolic key entry exists for the specified user key, and keymap information for the latest version may be returned. When storing keymap information, a flag may be set to indicate that a corresponding latest symbolic key entry should be updated. The system may delete a latest symbolic key entry for a particular user key from the cache in response to determining that no other requests involving the keymap information for data object instances having the particular user key are pending.

Abstract: Various embodiments sort data. In one embodiment, a matrix D including a set of data values is received. A matrix Q is received, and includes a set of columns and a set of rows. The matrix Q further includes a sorting of each column of the matrix D. Each of these rows corresponds to a sorting. Each of a set of values in each of the set of columns in the matrix Q identifies a row in the matrix D. At least one sub-matrix D? of the matrix D is identified. A set of columns of the sub-matrix D? is restricted to one or more columns of the matrix D. A processor sorts the sub-matrix D? by rows based on the sorting of the set of columns of the matrix D as given in the matrix Q, and based on the set of data values in the matrix D.

Abstract: A user interface can be used to associate data in a database. Data is presented in an assignment column, a first data element column, and a second data element column in the user interface, wherein the first and second data element columns show data elements stored in a database. First user input is received to select one or more data elements in the first data column. After receiving the first user input, the data assignment elements of the data assignment column are configured to correspond to the data elements of the second column Second user input is received in one or more of the data assignment elements indicating selection of one or more data elements of the second data column. The selected one or more data elements in the first data column are associated in the database with the selected one or more data elements in the second data column.

Abstract: A method utilizes cluster-awareness to effectively support a live partition mobility (LPM) event and provide recovery from node failure within a Virtual Input/Output (I/O) Server (VIOS) cluster. An LPM utility creates a monitoring thread on a first VIOS on initiation of a corresponding LPM event. The monitoring thread tracks a status of an LPM and records status information in the mobility table of a database. The LPM utility creates other monitoring threads on other VIOSes running on the (same) source server. If the first VIOS VIOS sustains one of multiple failures, the LPM utility provides notification to other functioning nodes/VIOSes. The LPM utility enables a functioning monitoring thread to update the LPM status. In particular, a last monitoring thread may perform cleanup/update operations within the database based on an indication that there are nodes on the first server that are in failed state.

Abstract: Described herein are technologies that facilitate representing instances in time over 62 orders of magnitude as well as graphically depicting events over various time ranges and resolutions in time. A filter window is selected as a function of a resolution of a display, such filter window is applied over a representation of an instant in time. The position of the filter window along the representation of the instant in time defines a resolution in time, and such resolution in time is utilized to select graphical objects for display.

Abstract: A method, system, and computer program product for managing the products of a sub-community operating within a community are provided in the illustrative embodiments. The sub-community is defined in an application executing on a data processing system using a processor and a memory. The community comprises a set of members working for a common objective. The sub-community comprises a subset of the set of members working for a part of the common objective. The defining of the sub-community also configures a closing condition for the sub-community. A plurality of members is added to the sub-community. The sub-community is created.

Abstract: Automated detection and management of electronic records is disclosed. An electronic content is detected. It is determined through automated processing of the electronic content that a records management policy applies to the electronic content. It is ensured through automated processing that the electronic content is stored as required by the records management policy.

Abstract: A computer-implemented method of extracting key phrases from a document is disclosed comprising the steps of accessing a repository comprising linked subjects, the repository comprising first and second data structures representing the relationship between said subjects using different representation criteria; pruning the first data structure by removing links between subjects based on a further relationship between said subjects in the second data structure; matching phrases in said document to subjects in the pruned first data structure; further pruning the pruned first data structure by removing unmatched subjects that are not linked to matched subjects; determining a ranking for each matched subject; and selecting key phrases using the determined subject rankings. A computer program for implementing the steps of this method when executed on a computer is also disclosed.

Abstract: The present invention relates to a system and method for improving a resume according to a job description, including generating a first user profile signature based on a first user profile element associated with a user, generating a first job description signature based on a first job description element associated with a job description; and comparing the first user profile signature with the first job description signature to determine a first score indicating a strength of a match between the first user profile element and the job description.

Abstract: A platform (referred to herein as Extensible Application Platform, or XAP) for developing extensible business applications. In one set of embodiments, XAP can include an Extensible Markup Language (XML) based application model that is designed to support a high degree of application extensibility. For example, the XAP application model can support declarative definition of application semantics, separation of application data and metadata, and a flexible type system that allows constraints and calculations (e.g., XQuery constraints and calculations) for a data object instance (e.g., an XML document) to change over time. In certain embodiments, the XAP application model can be implemented via a server-side database/application engine that is configured to interoperate with a spreadsheet-like, client-side user interface. Using the spreadsheet-like UI, a non-programmer can build, customize, and run an application workflow that operates on top of a shared database like a traditional business application.

Abstract: Mechanisms, in a data processing system, are provided for extracting semantic relationships amongst table contents in a table data structure associated with an electronic document. These mechanisms determine a configuration of cells within the table data structure. The mechanisms identify one or more super-cells within the table data structure based on the determined configuration of cells. The mechanisms also, for each super-cell in the one or more super-cells, converts table data corresponding to the super-cell into a semantic relationship statement for the super-cell, wherein the semantic relationship statement identifies one or more relationships between portions of the table data corresponding to the super-cell. The mechanisms further store the semantic relationship statements for each of the super-cells in association with the table data structure.

Abstract: Various embodiments are disclosed that relate to detecting mobile operator networks. For example, one disclosed embodiment provides a method of operating a catalog server to which a mobile computing device connects via a computer network path that traverses a mobile operator network. The method may include receiving data from a mobile device, the data including a locale and a mobile operator identifier stored in memory on the mobile device; searching a database to find a store based on the mobile operator identifier and the locale; if a store is found, populating settings based on the store; and sending configuration information to the mobile device based on the settings.

Abstract: Managing a cache includes determining from metadata of a received service request whether a cache data response may satisfy the request as a function of recognizing a cacheable method name specification within request metadata by a service provider associated with the request, and determining whether the request is an inquiry or a request as a function of comparing an update frequency specification or a time interval period to a value of a time parameter associated with the cacheable method name in the metadata, in order to decide if the request may be satisfied by the cached data. Aspects also include searching the cache for the data response if determined the data is cacheable and the request is an inquiry, and sending the request on to a service provider if the data response is not a cacheable response, or the request is an update request.

Abstract: A data assignment column, a first data element column, and a second data element column are presented in a graphical user interface, wherein the first and second data element columns show data elements stored in a database. First user input selecting one or more data elements in the first data column is received. Second user input in one or more of the data assignment elements indicates selection of one or more data elements of the second data column. The selected one or more data elements in the first data column are associated in the database with the selected one or more data elements in the second data column.

Abstract: Methods, systems, and computer-readable media include actions of receiving a query, identifying, based on the query, one or more relevant elements from an overall data model, identifying, using an adapter mapping, one or more adapters based on the one or more relevant elements, the adapter mapping associating each relevant element with a particular adapter, querying, using the one or more adapters, one or more data elements in data sources of a plurality of disparate data sources, each adapter being specific to a data source of the plurality of data sources, receiving, at the one or more adapters, one or more data results, transforming each data result of the one or more data results into a unified data format to provide respective one or more transformed data results, storing the one or more transformed data results in a temporary data store and querying the temporary data store to generate a result.

Abstract: Disclosed is an improved approach for performing lock management. A semi-distributed Lock Management (SDLM) system is provided utilizing RDMA and an acyclic time-dependent dependency graph that can lead to higher system performance while maintaining higher flexibility and autonomy for each process at each compute node in the given cluster, in particular for distributed database applications.