Abstract: A method for data processing is described. The method may include configuring a connection template that defines a data extraction flow for a first data source and transmitting from an analytics application server a controller application programming interface (API) call based on a query request for data stored at the first data source. The method may further include instantiating a connector microservice based on the controller API call and the connection template, where the connector microservice is configured with a first data connector with the analytics application server and a second data connector with the first data source that is specific to the first data source. The method may further include retrieving at the analytics application server the data from the first data source based on the connector microservice.

Abstract: Methods are disclosed for dynamic node allocation for a server system that can automatically heal on failure—minimizing the need for static configuration—dynamically adjusting server resources to match load, and minimize end user wait times. The disclosed methods dynamically allocate nodes to increase capacity for a platform that accepts data queries. Additionally disclosed is a system for rolling version update deployment: workers maintain org lists of org-task-queues that they service; org-affinities between the workers and the org-task-queues require the workers to have access to local copies of immutable data sets to service org-tasks from the org-task-queues of the orgs that they service. A leader running on a worker implements a healing and balancing service that maintains worker redundancy, manages the workers' org-affinities to accumulate orgs on their respective org-lists. The leader implements messaging to the workers to update to a new software version and monitors completion of updates.

Abstract: A predicate-based row level security system is used when workers build or split an analytical data store. According to one implementation, predicate-based means that security requirements of source transactional systems can be used as predicates to a rule base that generates one or more security tokens, which are associated with each row as attributes of a dimension. Similarly, when an analytic data store is to be split, build job, user and session attributes can be used to generate complementary security tokens that are compared to security tokens of selected rows. Efficient indexing of a security tokens dimension makes it efficient to qualify row retrieval based on security criteria.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for displaying one or more data sets to a user. These mechanisms and methods for displaying one or more data sets to a user can enable enhanced data security, more relevant data display, reduced processing, etc.

Abstract: Methods and systems for performing cross store joins in a multi-tenant store are described. In one embodiment, such a method includes retrieving data from a multi-tenant database system having a relational data store and a non-relational data store, receiving a request specifying data to be retrieved from the multi-tenant database system, retrieving, based on the request, one or more locations of the data to be retrieved, generating a database query based on the request, in which the database query specifies a plurality of data elements to be retrieved, the plurality of data elements including one or more data elements residing within the non-relational data store and one or more other data elements residing within the relational data store, and executing the database query against the multi-tenant database system to retrieve the data.

Abstract: Methods are disclosed for dynamic node allocation for a server system that can automatically heal on failure—minimizing the need for static configuration—dynamically adjusting server resources to match load, and minimize end user wait times. The disclosed methods dynamically allocate nodes to increase capacity for a platform that accepts data queries. Additionally disclosed is a system for rolling version update deployment: workers maintain org lists of org-task-queues that they service; org-affinities between the workers and the org-task-queues require the workers to have access to local copies of immutable data sets to service org-tasks from the org-task-queues of the orgs that they service. A leader running on a worker implements a healing and balancing service that maintains worker redundancy, manages the workers' org-affinities to accumulate orgs on their respective org-lists. The leader implements messaging to the workers to update to a new software version and monitors completion of updates.

Abstract: The technology disclosed preserves the tenant specificity and user specificity of the tenant data by associating user IDs to complementary special IDs referred to as the integration user(s). In particular, it combines the traceability of user actions, the integration of security models and the flexibility of a service ID into one integration user(s).

Abstract: In accordance with embodiments, there are provided mechanisms and methods for displaying one or more data sets to a user. These mechanisms and methods for displaying one or more data sets to a user can enable enhanced data security, more relevant data display, reduced processing, etc.

Abstract: A predicate-based row level security system is used when workers build or split an analytical data store. According to one implementation, predicate-based means that security requirements of source transactional systems can be used as predicates to a rule base that generates one or more security tokens, which are associated with each row as attributes of a dimension. Similarly, when an analytic data store is to be split, build job, user and session attributes can be used to generate complementary security tokens that are compared to security tokens of selected rows. Efficient indexing of a security tokens dimension makes it efficient to qualify row retrieval based on security criteria.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for displaying one or more data sets to a user. These mechanisms and methods for displaying one or more data sets to a user can enable enhanced data security, more relevant data display, reduced processing, etc.

Abstract: A predicate-based row level security system is used when workers build or split an analytical data store. According to one implementation, predicate-based means that security requirements of source transactional systems can be used as predicates to a rule base that generates one or more security tokens, which are associated with each row as attributes of a dimension. Similarly, when an analytic data store is to be split, build job, user and session attributes can be used to generate complementary security tokens that are compared to security tokens of selected rows. Efficient indexing of a security tokens dimension makes it efficient to qualify row retrieval based on security criteria.

Abstract: The technology disclosed preserves the tenant specificity and user specificity of the tenant data by associating user IDs to complementary special IDs referred to as the integration user(s). In particular, it combines the traceability of user actions, the integration of security models and the flexibility of a service ID into one integration user(s).

Abstract: In accordance with embodiments, there are provided mechanisms and methods for displaying one or more data sets to a user. These mechanisms and methods for displaying one or more data sets to a user can enable enhanced data security, more relevant data display, reduced processing, etc.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for displaying one or more data sets to a user. These mechanisms and methods for displaying one or more data sets to a user can enable enhanced data security, more relevant data display, reduced processing, etc.

Abstract: Methods and systems for performing cross store joins in a multi-tenant store are described. In one embodiment, such a method includes retrieving data from a multi-tenant database system having a relational data store and a non-relational data store, receiving a request specifying data to be retrieved from the multi-tenant database system, retrieving, based on the request, one or more locations of the data to be retrieved, generating a database query based on the request, in which the database query specifies a plurality of data elements to be retrieved, the plurality of data elements including one or more data elements residing within the non-relational data store and one or more other data elements residing within the relational data store, and executing the database query against the multi-tenant database system to retrieve the data.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for displaying one or more data sets to a user. These mechanisms and methods for displaying one or more data sets to a user can enable enhanced data security, more relevant data display, reduced processing, etc.

Abstract: An integrated data mining and relational database management system is provided on a server. The data mining engine determines characteristics of relationships between input data values and an output data value that are obtained from a relational database (managed by the relational database management system). The integration allows direct conversion of data values from the relational database to data mining identifiers used for data mining operations by the data mining engine, and vice-versa. The integrated server also makes patterns uncovered during data mining (e.g., “understand” and “predict” information) available in virtual relational database tables that can be queried.

Abstract: Hybrid target indexes are employed for skewed data set domains. Such hybrid indexes contain multiple value representations within a given index. The representations can be optimized for particular keys in highly skewed data set domains. For example, a hybrid target index on customer states might employ a bitmap to represent the index value for a California key and also employ, in the same index, an uncompressed list of row-IDs to represent the index value for a Delaware key.