Abstract: Business groups are created to secure business entities of a BI data model. In one aspect, a user to be secured is selected and a business group of the BI model is retrieved. Based on the business group, access to a business entity of the BI model is secured. The business group is associated with the business entity it secures. A value of the secured business entity is selected. A user is secured by assigning the user to the business group for the selected value. The value of the secured business entity is assigned to the user. In one aspect, requests from the user to access the secured business entity are filtered based on the assigned, to the user, value of the business entity.

Abstract: Systems and methods for identifying and eliminating outlying point of interest search results to improve the readability of the mapped results are provided. One exemplary method includes obtaining, by one or more computing devices, a plurality of points of interest. Each point of interest has an associated location. The method includes determining, by the one or more computing devices, a distance score for each of the plurality of points of interest. The method includes determining, by the one or more computing devices, a distance ratio. The distance ratio compares the distance score associated with the point of interest having the distance score of greatest magnitude to the distance score associated with the point of interest having the distance score of second greatest magnitude.

Abstract: Embodiments of the present invention utilize context subsystems to logically group resources according to context. Such context subsystems can be nested (i.e. hierarchical), and thus further simplify the complex configuration relationships encountered with complex systems. Higher level (i.e. parent) context subsystems contain at least one resource that is utilized by a lower level (i.e. child) component, subsystem, or context subsystem. Context subsystems can be hierarchically arranged in single- and multi-parent arrangements and single- and multi-child arrangements. The number of context subsystem hierarchical levels is virtually unlimited and is generally dictated by the complexity of the system and the corresponding simplification needs of the configuration technology being utilized to configure the system. Context subsystems are applicable and useful in a configuration environment for virtually any configurable system amenable to contextual groupings of resources.

Abstract: A method for transporting relational data from one relational database to another such database. The data transported may be a subset of data in the entire database and the relations between the root of this data and other data entities are preserved in a way allowing their reconstruction in the target database. This preservation, itself further directed through configuration, is able to recreate new data identifiers without collision, yet also without requiring maintenance of the original identifiers.

Abstract: A data analysis system is proposed for providing fine-grained low latency access to high volume input data from possibly multiple heterogeneous input data sources. The input data is parsed, optionally transformed, indexed, and stored in a horizontally-scalable key-value data repository where it may be accessed using low latency searches. The input data may be compressed into blocks before being stored to minimize storage requirements. The results of searches present input data in its original form. The input data may include access logs, call data records (CDRs), e-mail messages, etc. The system allows a data analyst to efficiently identify information of interest in a very large dynamic data set up to multiple petabytes in size. Once information of interest has been identified, that subset of the large data set can be imported into a dedicated or specialized data analysis system for an additional in-depth investigation and contextual analysis.

Abstract: A method, article of manufacture, and apparatus for providing content services on a distributed file system is discussed. These services may be applied to files, data blocks, and/or metadata. A content fabric that resides within or sits along side the distributed file system may apply the services.

Abstract: A method for dynamically building a column store database from a row store database. The method includes establishing the row store database for storing data, wherein each row includes a plurality of attributes, and wherein data in row store database is current to a temporal point in time. The method includes establishing the column store database including data structured to satisfy received analytic queries. The method includes beginning from an initial state of the column store database, for each subsequently received analytic query, importing a targeted amount of data from a corresponding temporal state of the row store database into the column store database to satisfy the corresponding subsequently received analytic query.

Abstract: A method and a system for archiving data from a source database to a target database perform the following step: a) specifying the data being subject to the archiving operation in the source database; b) extracting the data genealogy of the specified data, thereby revealing the physical relations among tables of the specified data and/or arbitrary rules defined by an administrator in order to create a data tree of the specified data; c) executing an export/import operation of the specified data from the source database to the target database, thereby starting in a direction from the root of the data tree to the leaves of the data tree; and d) after the successful execution of the export/import operation, executing a delete operation in the source database for the specified data, thereby starting in a direction of the leaves of the data tree to the root of the data tree.

Abstract: Systems and methods for maintaining a datacenter are provided. A repair component includes modules that are configured to scan the data objects based on the identifiers of the data objects, identify potential issues or concerns with the data objects, and then repair the issues as they are discovered or over time. The repair component can be run in a non-centralized and highly parallelized manner.

Abstract: Disclosed herein are a system, non-transitory computer readable medium and method for fulfilling requests for source code. A description is associated with each section of source code text. A section of source code, whose description at least partially matches a source code request, is obtained and displayed.

Abstract: A relational database for storing data used to populate form records fields, wherein a database table structure stores both fixed and variable form content, for multiple form types by creating tables to store the fixed form content and variable form content. Also described is a method for structuring a relational database, the data content of which is used to populate form fields in forms; the forms structured as fixed data content interspersed with form fields for receipt and display of variable data content; the variable data content derived from primary tables in said relational database; said method comprising creating one or more reference tables which store information about said primary tables thereby to permit tracking of changes to said form fields.

Abstract: A method and system for determining a service description most closely matching a service name provided by a user. It is determined that the service name provided by the user is not an exact match to a service name in a service registry that comprises service names and associated service descriptions. A ranked service name is generated and includes at least one alternative service name and a respective rank of each alternative service name. The respective rank indicates how closely the alternative service name associated with the respective rank resembles the service name provided by the user. It is ascertained that a service description associated with a service name in the service registry that either matches the highest ranked alternative service name in the service name list or matches the next highest ranked alternative service name in the service name list. The ascertained service description is communicated to the user.

Abstract: An intelligent conflict detection system. The system provides semantic expression of edits and history-aware conflict detection in a large-scale service allowing multiple users to simultaneously work with the same document, which may result in conflicting edits. When submitted, changes to a version of a document are compared to all versions of the document created since the document was sourced. Edits to documents are expressed as intents describing the changes in terms of an action and object of that action based on a characteristic of the data being edited. Comparing the intent of current edits against the historical intent of the edits made in prior versions originating from the same source document allows the system to intelligently assess whether the edits are in conflict. History-aware semantic analysis results in users being prompted less frequently to resolve conflicts, which improves the user experience.

Abstract: A method and system for determining a service description most closely matching a service name provided by a user. It is determined that the service name provided by the user is not an exact match to a service name in a service registry that comprises service names and associated service descriptions. A ranked service name is generated and includes at least one alternative service name and a respective rank of each alternative service name. The respective rank indicates how closely the alternative service name associated with the respective rank resembles the service name provided by the user. It is ascertained that a service description associated with a service name in the service registry that either matches the highest ranked alternative service name in the service name list or matches the next highest ranked alternative service name in the service name list. The ascertained service description is communicated to the user.

Abstract: An apparatus, computer-readable medium, and computer-implemented method for data subsetting, including receiving a request for a subset of data from a plurality of tables, generating an entity graph corresponding to the plurality of tables, expanding the entity graph if the entity graph does not have any cycles, and performing acyclic subset processing on the expanded entity graph if the entity graph does not have any cycles and the expanded entity graph does not have any cycles.

Abstract: Systems, apparatuses, and methods described herein are configured for monitoring and managing a plurality of sensors. The plurality of sensors may be fixed, mobile, or a combination thereof. In some embodiments, the monitoring and management of the sensors is facilitated via a graphical user interface.

Abstract: A compound application that is operated across multiple devices using constituent transformation chains associated with multiple devices. Dependencies are identified between different transformation chain classes. Devices are also identified along with their associated instance of a transformation chain class. Upon determining that the transformation chain instances associated with different devices are to be joined, data is permitted to flow between the various devices in accordance with the identified dependences between their respective classes of the associated transformation chain instances, and in accordance with dependency state between the instances. Thus, a compound transformation chain is formed. As devices exit the environment, the associated transformation chain instances may be removed from the compound transformation chain. Thus, rather than devices having interoperating applications, the devices become mutually engaged with the same compound application.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for a search dialog user interface. In one aspect, a method includes displaying a search using interface, comprising: a search dialog user interface in which a plurality of search threads are initiated, each search thread comprising a plurality of entries, wherein the entries comprise: one or more query messages, each query message being descriptive of one or more search criteria, one or more result messages, each result message being a message describing criteria for a corresponding search and that is responsive to one or more preceding query messages within the search thread; and a search result display location in which search results corresponding to an active result message are displayed.

Abstract: Processing information relevant analytically to a user's endeavor is described. Data, gathered in relation to the analytically relevant information, is organized into a first result that is sensitive to an endeavor-related context. A synoptic representation of the contextually sensitive first result is presented, with which the user may interact. The first synoptic representation is expanded into a second result, which has a graphical or numerical data attribute. The expansion includes determining a format that best, or most efficiently, represents the second result in relation to the context sensitivity and the graphical or numerical data attribute. A representation of the second result is presented according to the determined best or more efficient format. The first results second results presentations are linkable to underlying data sets that correspond to the organized data for access and presentation upon the user's request.

Abstract: An approach is provided for evaluating a potential post based on historical data. In the approach, historically highly rated attributes that to previously received highly rated posts are identified. The process receives a potential post from an online Subject Matter Expert (SME). The process analyzes the potential post, using a Natural Language Processing (NLP) routine performed by computer processors. The analysis identifies a lack of one or more of the historically highly rated attributes in the potential post. The process then notifies the SME, based on the analysis, regarding the lack of one or more of the historically highly rated attributes in the potential post.