Abstract: A computer readable medium includes executable instructions to define an individual publication schema for each heterogeneous source of a set of heterogeneous sources. Each individual publication schema specifies mapping rules between data from a heterogeneous source and a non-permanent structured instance of data. A non-permanent structured instance of data as defined by an individual publication schema is generated. An integration schema defining a set of integration rules for combining data from each non-permanent structured instance of data as defined by individual publication schema is established. A target non-permanent structured instance of data to include data from the plurality of heterogeneous sources based on at least one integration schema is formed.

Abstract: A representative parameterized query in a second database query language is generated from a parameterized query in first database query language. By randomly generating a query in the first database query language, translating this query into the second database query language, and then identifying locations of relevant parameters in the translated query, parameter placeholders can then be substituted at the identified locations to provide a parameterized query in the second database query language. A representative parameterized query in the second database query language can be selected by randomly generating multiple parameterized queries and applying statistical methods including Monte Carlo methods.

Abstract: A method is provided for forming an entity cluster. In this method, a plurality of entities found in one or more data sources are identified. An entity may represent a word or a phrase found in the one or more data sources. The plurality of entities may then be organized into groups, where each group has a master entity and a set of subordinate entities. The groups are formed using a first comparison criteria. Then, using a second comparison criteria, a first group is associated with a second group. The second comparison criteria may compare the master entities associated with the first and second groups. Based on the association between the first group and the second group, the method can then determine that the first entity is related to the second entity.

Abstract: Embodiments include systems and methods for automated versioning of software on a client machine, allowing installation and updates over multiple platforms with modules written in different computer languages. In an embodiment, the client sends a list of installed modules to the server. This may be done by causing a client processor to perform method calls determining version information of the installed product. The server then checks the list and sends updates (if any) that are then automatically installed on the client. Some embodiments can perform software installation over-the-network, and prerequisite software may also be automatically installed on the client machine. The system may work on multiple platforms (e.g. Windows™, UNIX) and support multiple computer languages (e.g. C++, Java®, Python®, .NET, etc.).

Abstract: In an embodiment, a method provides a carbon footprint comparison. In this method, a request to compare a first carbon footprint associated with a first user is received. Here, first profile attributes and the first carbon footprint associated with the first user are accessed. Additionally, second profile attributes associated with a second user are accessed. A match of a first number of the first profile attributes with a second number of the second profile attributes is identified. With the match, a strength of the match is calculated based on a number of identified matching profile attributes. A response to the request is then transmitted, and this response comprises the strength of the match and the first carbon footprint.

Abstract: Disclosed are systems and methods for synchronizing data present in a target data set with data present in a source data set. The data present in the target data set is partitioned to determine a partition definition of the target data set. A target message digest is calculated for the data present in each partition of the target data set. Based upon the partition definition of the target data set, the data present in the source data set is partitioned. A source message digest is calculated for the data present in each partition of the source data set. The source message digest of a partition is compared with the target message digest of a corresponding partition to capture a change in data present in the source data set. Based upon the captured data, the data in the target data set is synchronized with the data in the source data set.

Abstract: Example systems and methods of providing an application programming interface tracing mechanism are presented. In one example, an application programming interface for an application is provided, the interface including an interface object. A proxy object is created for the interlace object. At the proxy object, method calls from the application for the interface object are received, recorded, and passed to the interface object. An execution trace including the recorded method calls is generated.

Abstract: Various embodiments may operate to access individual lines of information included in a file stored in an electronic storage medium, to detect the existence of data clusters in the file based on neighboring cell content in a horizontal direction (corresponding to the individual lines), and in a vertical direction (orthogonal to the horizontal direction), to identify at least some of the data clusters as being associated with predefined table types (comprising vertical tables, horizontal tables, or cross tables), to merge some of the data clusters into section tables having common properties, and to transform the tables resulting from the merging activity, as well as remaining un-merged data clusters, into a single flat table. The stored file may comprise a spreadsheet file.

Abstract: An apportioned queue data structure allows a server to specify allocation of resources to return requests according to a prescribed usage request. The data structure comprises an input queue comprising of a set of subqueues (also known as windows). Windows contain requests that will be processed over a fixed window of time. Received items are removed from the input queue and packed into the subqueues according to the service level agreement. These windows (and the elements present within) are then processed in the order of the windows queue (and the order in the window) are arranged. The time for each task is not known until after the request is processed and may be estimated. In a steady state of high load, a queue is created that returns requests tending toward requested percentages of the service level agreement.

Abstract: A data transform leverages a known hierarchy within a target data structure, in order to improve query and mapping capabilities and enhance performance. Where a target data structure is hierarchical, output data of that target data structure is often built in the document order of the nodes in the structure (from top down and from left to right). Hence, when the data for a child node in the target structure is being built, the data for the parent nodes of the child node has been built. Embodiments utilize this available portion of the target data in the form of target columns, to increase processing efficiency of the transformation process. Use of target columns according to embodiments may also allow powerful and concise expression of mapping logic in the transform, facilitating the use of functions such as selection (e.g. Where clauses), uniqueness (e.g. DISTINCT), ordering (Order By, Group By), and Aggregation.

Abstract: Various embodiments of systems and methods for database consistent sample data extraction are described herein. The technique uses production data as input and outputs sample data in the same relational schema while preserving the integrity of joins of the different tables in the schema. For a given relational schema, the master tables are found. Then a subset is created by placing selection criteria in a query defining how to sample the data for these master tables. Following the joins, the dependent tables are added to the query automatically.

Abstract: Some aspects include determination of second document identifiers added to a search index. The search index associates each of a plurality of words with at least one of a plurality of first document identifiers. For each of the second document identifiers, metadata of a document identified by the second document identifier is added to a content store storing metadata of each document identified by the plurality of first document identifiers. In some aspects, the content store comprises at least one flat file, and the metadata is appended to an end of one or more of the at least one flat file.

Abstract: Various embodiments of methods and systems for recommending tools to a user are based on the verbs and nouns in the user request and a context of the user. The method involves receiving a user request, the user request including a search query with one or more keywords, identifying one or more verbs and nouns in the one or more keywords, based on the one or more verbs, nouns and a context of the user executing the search query to obtain list of tools, ranking the list of tools based on the identified nouns and the context of the user and displaying the list of tools.

Abstract: A computer readable medium includes executable instructions to create a report; augment the report with metadata including a report identifier and parameter information; and export the report and metadata to a non-report electronic document.

Abstract: A system and method for lane graph visualization are described. In various embodiments, a system includes modules to receive and display nodes in topological order. In various embodiments, the system determines a structure for nodes and sorts the data nodes. In various embodiments, a user interface is provided for displaying the lane graph visualization. In various embodiments, the user interface offers interactivity features responsive to user interface events. In various embodiments, a method for lane graph visualization is presented. The method includes receiving nodes in topological order and displaying the nodes in a lane graph visualization. In various embodiments, the method provides interactivity features for the lane graph visualization.

Abstract: A computer readable storage medium includes executable instructions to receive from a requester a query for objects within a system. An index for the objects within the system that match the query is generated. The index is segmented into pages. A set of page state queries is returned to the requester. The page state queries specify criteria for retrieving objects from segments of the index.

Abstract: A computer readable storage medium includes executable instructions to retrieve a dataset from a data source, where the dataset includes a first set of categories. A data structure that represents the dataset is built. A first set of merit values for the first set of categories is calculated. The first set of categories is ordered based on a criterion. The first set of categories is returned.

Abstract: Techniques for data classification include receiving, at a local computing system, a query from a remote computing system, the query comprising data associated with a commodity, the data comprising one or more attributes of the commodity; matching the one or more attributes of the commodity with one or more terms of a plurality of terms in a word matrix that includes a plurality of nodes that each include a term of the plurality of terms and a plurality of links that each connect two or more nodes and define a similarity between the two or more nodes; generating, based on the matching, a numerical vector for the business enterprise commodity; identifying one or more classification regions that each define a classification of the commodity; and preparing the classifications for display at the remote computing system.

Abstract: Techniques for data classification include receiving, at a local computing system, a query from a remote computing system, the query comprising data associated with a commodity, the data comprising one or more attributes of the commodity; matching the one or more attributes of the commodity with one or more terms of a plurality of terms in a word matrix that includes a plurality of nodes that each include a term of the plurality of terms and a plurality of links that each connect two or more nodes and define a similarity between the two or more nodes; generating, based on the matching, a numerical vector for the business enterprise commodity; identifying one or more classification regions that each define a classification of the commodity; and preparing the classifications for display at the remote computing system.

Abstract: Various embodiments of systems and methods for variable length data protected by Seqlock are described herein. Seqlock is a special locking mechanism used in data structures for multithreaded applications that can be read very quickly, when there are no changes being made, at the cost of needing to repeat a read operation when writing has occurred. A Seqlock, in normal use, can only protect a fixed-size data structure with no pointers. This is because the writing thread may invalidate a pointer after a reading thread has followed it. The embodiments specify an algorithm where a Seqlock-protected pointer, once written, is never invalidated. This removes the “no pointers” restriction, allowing the Seqlock to protect a simple singly-linked list, which can be safely increased in size while being read by other threads. The innovation includes the use of the write-once head and next pointers, and the always valid end iterator.