Abstract: The resources of an organization may provide various functions and services, and the performance of the resources may be of interest. Performance indicators (e.g., network bandwidth, I/O throughput, and processing capacity) may be measured and logged, and examined in the event of diminished performance in order to identify a non-performing resource. However, because resources may depend on other resources, and to different degrees, the performance of the first resource may be limited by the performance of a related resource, and logging respective resource performance may not inform this determination. An embodiment of the techniques presented herein may evaluate an effect of the performance indicators of a first resource on the performance indicators of related resources (e.g., through historic comparisons or differential testing), and a visual resource map may include a visual indicator of the effect of performance indicators of a first resource on the performance indicators of a related resource.

Abstract: Storing text samples in a manner that the text samples may be quickly searched. The text samples are assigned a text sample identifier and are each parsed to thereby extract text components from the text samples. Text components that have the same content are assigned the same text component identifier. For each parsed text component, a text component entry is created that includes the assigned text component identifier as well as the text sample identifier for the text sample from which the text component was parsed. A text sample entry group is created for each text sample that contains the text component entries in sequence for the text components found within the text sample. The text sample entry groups are stored so as to be scannable during a future search.

Abstract: Systems, methods, and apparatuses for displaying items based on time data, such as time of entry, include use of a display device configured to display items, and a processing circuit configured to control operation of the display device and modify characteristics associated with the items. An input, such as a touch, may be used to guide display of the items, including presenting the items in a replay format.

Abstract: Implementing a database system using a plurality of sequentially ordered drives to store sequential portions of columns of the database, but where the database system is usable by a system configured for use with in-memory database systems. The method includes loading one or more columns of a database into main memory of a computing system as a table based database. The method further includes dividing a column of the database into sequential portions. Each of the sequential portions is of sufficient size to create efficient transfers using hard disk controllers to transfer an entire sequential portion. The method further includes writing each of the sequential portions sequentially onto sequentially ordered drives in a round robin fashion such that sequential portions of the column are on sequential drives.

Abstract: Implementing a database system using a plurality of sequentially ordered drives to store sequential portions of columns of the database, but where the database system is usable by a system configured for use with in-memory database systems. The method includes loading one or more columns of a database into main memory of a computing system as a table based database. The method further includes dividing a column of the database into sequential portions. Each of the sequential portions is of sufficient size to create efficient transfers using hard disk controllers to transfer an entire sequential portion. The method further includes writing each of the sequential portions sequentially onto sequentially ordered drives in a round robin fashion such that sequential portions of the column are on sequential drives.

Abstract: The creation and updating of an association index that defines a linking between a child table and a parent table in a database system, and in which each of at least some of the parent table rows have an associated expression defining rules for mapping child table rows to the associated parent table row. The association index may be constructed with one pass of the parent table by evaluating the mapping definition to identifying associated child table rows. If there are such associations for a given parent table row, the linking module may record that association in an association index. If there are changes made that potentially invalidate an association status (whether an association or lack thereof), a re-evaluation module then determines which mapping definitions for which parent rows need to be re-evaluated, and potentially for which child table rows, rather than perform the entire process again.

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: The present invention extends to methods, systems, and computer program products for using cinematic technique taxonomies to present data. Embodiments of the invention can be used to infer and identify cinematic techniques or combinations thereof based on a model and user action. Cinematic techniques can be used to meet the data exploration and analysis requirements of a user. As such, embodiments of the invention permit users (including non-programmers) to employ cinematic techniques from a cinematic technique hierarchy (possibly in combination with other techniques) to gain insights into their data and also convey appropriate emotional messages.

Abstract: Efficient display of search results. A method includes receiving a query specifying a search object for a dataset. Data items in the dataset are able to be viewed or navigated to in an active region of a user interface. The active region is a portion of a display which is primarily configured for use by a user to view, navigate to for viewing, add, remove or edit the data items in the dataset. The method rearranges data items in the dataset to aggregate together data items of the dataset that include a match for the search object. The method includes providing the rearranged dataset through the active region of the user interface, such that a user can view or navigate to the aggregated data items in the dataset as well as other data items in the dataset.

Abstract: A view of data transformation jobs can be presented by way of a user interface. Related jobs can subsequently be identified automatically after a job is selected based on data dependencies between jobs. Execution status can also be determined and presented such that successful and failed execution of jobs, for example, can be differentiated. Furthermore, selection of a job run that failed to execute successfully can trigger identification of related jobs runs that failed or are predicted to fail to execute successfully.

Abstract: Mismatches between schema elements of a data set and a job are identified automatically. Furthermore, the mismatches can be presented visually in conjunction with an interactive visual workspace configured to support diagrammatic authoring of data transformation pipelines. After a data set is connected to a job, one or more mismatches can be determined and presented in context with the workspace. In addition, schema elements can be reconfigured by way of interaction with a visual representation of schema elements to resolve mismatches.

Abstract: Methods and systems are disclosed for receiving and processing data analysis expressions. A particular method includes receiving a data analysis expression at a pivot table of a spreadsheet. The data analysis expression is executed for a particular cell of the pivot table by determining a context associated with the particular cell, calculating a value of the data analysis expression based on the context, and outputting the calculated value at the particular cell.

Abstract: Jobs can be created within a visual authoring environment. A new job of a selected type can be added to a diagrammatic workspace. Subsequently, a mechanism configured to enable selection of a saved job that implements all or a portion of the job can be presented. After selection, a saved job can be acquired and the workspace updated based thereon. Furthermore, data sources associated with the saved job can be can be added to a data source designated portion of the environment.

Abstract: Jobs can be authored in conjunction with a visual workspace. Upon selection of representation of a data source in the workspace, a preview of the data source can be generated within context of the visual workspace. Further, representations of one or more data transformation operations can be provided with the preview. Selection of a transformation operation results in an updated preview reflecting application of the operation as well as generation of backend code to perform the operation. Furthermore, a job comprising one or more transformation operations can be added to the workspace automatically.

Abstract: Methods and systems are disclosed for receiving and processing data analysis expressions. A particular method includes receiving a data analysis expression at a pivot table of a spreadsheet. The data analysis expression is executed for a particular cell of the pivot table by determining a context associated with the particular cell, calculating a value of the data analysis expression based on the context, and outputting the calculated value at the particular cell.

Abstract: Search suggestions are generated in manner that takes into account access-control information. A query can be received from a user of a search engine prior to initiating execution of the query. Data that is accessible to the user can be determined based on access information associated with the user and data. Subsequently, query suggestions can be generated dynamically based on data accessible to the user.

Abstract: Linking of a child table to a parent table in a database system. For a given parent table row, an expression associated with the particular row is identified. The expression may be a semantic expression that comprises something different than or more than an equals expression or a contains expression. The expression might also take as input a field of the parent table other than the primary key of the parent table. For each of multiple (and potentially all) rows of a child table, the expression is evaluated against a foreign key of the corresponding row of the child table. If the foreign key matches the expression, an association is created, and perhaps saved, between the foreign key and the particular row of the parent table. The expressions may differ even down to the granularity of a single row in the parent table, thereby enabling perhaps custom per-row expressions.

Abstract: At least one cue can be generated regarding manipulating representations of data. The cue provides information regarding manipulating a first representation of a first set of data with respect to a second representation of a second set of data based on correlations between the first set of data and the second set of data. Among other things, a cue can identify shift direction and distance, scale factor, and correlation strength.

Abstract: Providing predictive data predicting data values for a historical dataset. The method facilitates improving the accuracy of the predictive data by identifying for a user, and allowing the user to select ancillary datasets that can be evaluated, using a predictive evaluation, together with a historical dataset to improve the accuracy of the predictive data. A user interface is provided to a user. The user interface identifies one or more ancillary datasets. The ancillary datasets are identified to the user based on the ancillary datasets meeting a threshold condition to a historical dataset. The ancillary datasets are selectable by the user in the user interface. User input is received at the user interface selecting one or more of the ancillary datasets. A predictive dataset is displayed to the user. The predictive dataset is determined by predictive evaluation of the historical dataset and the one or more selected ancillary datasets.

Abstract: A scalable analysis system is described herein that performs common data analysis operations such as distinct counts and data grouping in a more scalable and efficient manner. The system allows distinct counts and data grouping to be applied to large datasets with predictable growth in the cost of the operation. The system dynamically partitions data based on the actual data distribution, which provides both scalability and uncompromised performance. The system sets a budget of available memory or other resources to use for the operation. As the operation progresses, the system determines whether the budget of memory is nearing exhaustion. Upon detecting that the memory used is near the limit, the system dynamically partitions the data. If the system still detects memory pressure, then the system partitions again, until a partition level is identified that fits within the memory budget.