Abstract: A computer readable storage medium comprises executable instructions to receive a report for access by a user. The report is divided into sections and each section is tokenized based on the user's interests. A section score is calculated for each section in the report. One or more sections are selected for display to the user according to their section scores. The one or more sections are delivered to the user.

Abstract: A system includes reception of a partial query, determination of one or more previously-selected query phrases based on the partial query, determination, for each of the one or more previously-selected query phrases, of a dataset of a data source, determination, for each dataset determined for each of the one or more previously-selected query phrases, of a plurality of columns, and presentation, for each of the one or more previously-selected query phrases, of the previously-selected query phrase, the dataset determined for the previously-selected query phrase, and the columns determined for the dataset.

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: 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: 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: 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: 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: 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: 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.

Abstract: A system may include reception of a selection of a set of one or more elements of a data visualization, the set associated with a measure and each of the one or more elements associated with a value of the measure for a respective combination of one or more dimension members, reception of an instruction to create a second set of one or more elements associated with a calculated measure, where a value of the calculated measure for a respective combination is based on two values of the measure for the respective combination, and where a first value of the two values of the measure is associated with a first time and a second value of the two values of the measure is associated with a second time, and automatic generation of a query to produce the value of the calculated measure for each of the combinations.

Abstract: Methods, systems, and apparatuses for processing function calls using a hooking routines to perform pre-execution tasks are disclosed. A server computer receives a function call including a hooking routine and a request to run a particular function from a client computer. Based on a function group identifier and the credentials of the user or client computer, the server computer can perform various pre-execution tasks. The tasks can be common to all functions in the function group or be customized Both pre-execution tasks can be stored remotely from the client computer, so that updates to the pre-execution task can be made without the need to update computer readable code stored on the client computer. If the pre-execution tasks, such as an authorization, passes, then the server computer can execute the requested function, the server computer can reject or abort the requested function.

Abstract: A certificate of a user is presented by a client to a server. The certificate is used to authenticate communications between the client and the server. Thereafter, data from the certificate is cached at the server. The server then initiates one or more business intelligence processes of a business intelligence application at the client using the cached data to provide context to the one or more business intelligence processes. Related apparatus, systems, techniques and articles are also described.

Abstract: Described herein is a technology for visualizing data. In accordance with some implementations, dimension metadata is automatically extracted from multiple documents. The extracted dimension metadata may be used to populate one or more relation dimensions. Based on the dimension metadata, one or more relations between the documents are determined along the one or more relation dimensions. A relation graph is presented to represent the documents interconnected by the one or more relations.

Abstract: One embodiment includes a computer implemented method of processing documents. The method includes generating a text analysis task object that includes instructions regarding a document processing pipeline and a document identifier. The method further includes accessing, by a worker system, the text analysis task object and generating the document processing pipeline according to the instructions. The method further includes performing text analysis using the document processing pipeline on a document identified by the document identifier.

Abstract: One embodiment includes a computer implemented method of storing information. The method includes implementing, by a document repository server computer, a schema-flexible database. The method further includes receiving, by the document repository server computer, processed text information from a text analysis computer, wherein a semantic type is assigned to the processed text information. The method further includes storing, by the document repository server computer, the processed text information in the schema-flexible database. The method further includes outputting, by the document repository server computer to an analysis computer, data selected from the processed text information stored in the schema-flexible database in response to a query received from the analysis computer.

Abstract: A system includes reception of first data content, generation of a first semantic representation of the first data content, determination of whether the first semantic representation is similar to a second semantic representation of second data content, generation of a third semantic representation based on the first semantic representation and on the second semantic representation, and association of the third semantic representation with the first data content and with the second data content if the first semantic representation is similar to the second semantic representation, and association of the first semantic representation with the first data content if the first semantic representation is not similar to the second semantic representation.

Abstract: Data read from a database may be transferred to an external system utilizing a dynamic interface, through a remote procedure call (RPC) communication mechanism. In particular embodiments within the SAP environment, data is transferred utilizing an executable program in a high level language such as Advanced Business Application Programming (ABAP). Data may be streamed from the ABAP executable program directly to a Data Services Job engine via a NetWeaver remote function call (NWRFC) C/C++ connector.

Abstract: Providing input data in a user interface includes presenting previous data states of the user interface. One or more selections of input controls from previous data states of the user interface can be received. Data associated to those selections of input controls can be associated with corresponding input controls in a current session dialog of the user interface.