Abstract: Systems and methods are disclosed for a swap-based multitenant database load balancing (SWAT) by finding an optimal swap set that eliminates hotspots, and finding a sequencing and parallelization of swap executions for the multi-tenant database.

Abstract: A data warehouse is created using an input file that can contain sub-documents of different formats. A root document model including path names to all nodes among the sub-documents is generated, and a table is generated with columns being derived from the path names of the root model. The sub-documents are shredded to populate the table. Then, the dimensions of the data warehouse are defined by selecting respective columns. A routine such as a DDL may then be generated to populate the data warehouse with data.

Abstract: A system and method for data sharing are provided. Context parameters associated with a user are gathered from a plurality of applications. A mobile context of the user is determined based on the gathered context parameters. Content is presented to the user in accordance with the mobile context of the user.

Abstract: A platform as a service (PaaS) is provided as part of a data sharing scheme. The PaaS is configured to setup a materialized shared space in a cloud. The materialized shared space includes a set of resources invested by the PaaS to permit data sharing between a tenant application and at least one consumer application. A sharing middleware configured to provide the at least one consumer application with access to the data in the materialized shared space.

Abstract: A system and method are provided for data sharing. A sharing negotiation tool permits at least one consumer application to negotiate a service level agreement on a dataset which is being shared by a tenant application on a cloud. A capacity planner is configured to determine an appropriate allocation of cloud resources to ensure that the service level agreement of the at least one consumer application is satisfied.

Abstract: A system and method are provided for data sharing. A uniform communication framework is provided as part of a sharing service on the cloud platform to facilitate data sharing among a plurality of applications. The uniform communication framework includes an application programming interface which provides a communication gateway to permit a first application to access data of a second application stored in the data store.

Abstract: A data layout recommendation system for heterogeneous storages is disclosed. The system has an SSD-aware Time-based query optimizer from the database optimizer. The query optimizer can detect the interaction between the query plans and underlying data layout and dynamically update the cheapest query plan and response time of a query based on the changing data layout. The system also includes a module utilizing the query estimates from the backend to find a cost-effective data layout as well as the capacity and SLAs constrains are guaranteed.

Abstract: An admission control system for a cloud database includes a machine learning prediction module to estimate a predicted probability for a newly arrived query with a deadline, if admitted into the cloud database, to finish its execution before said deadline, wherein the prediction considers query characteristics and current system conditions. The system also includes a decision module applying the predicted probability to admit a query into the cloud database with a target of profit maximization with an expected profit determined using one or more service level agreements (SLAs).

Abstract: Systems and methods are disclosed to consolidate workload on cloud-based computers by co-locating one or more high-penalty tenants on one or more cloud-based servers; reducing service level agreement (SLA) violations by over-provisioning the cloud-based server; and maximizing an SLA profit.

Abstract: An efficient cost-based scheduling method called incremental cost-based scheduling, iCBS, maps each job, based on its arrival time and SLA function, to a fixed point in the dual space of linear functions. Due to this mapping, in the dual space, the job will not change their locations over time. Instead, at the time of selecting the next job with the highest priority to execute, a line with appropriate angle in the query space is used to locate the current job with the highest CBS score in logarithmic time. Because only those points that are located on the convex hull in the dual space can be chosen, a dynamic convex hull maintaining method incrementally maintains the job with the highest CBS score over time.

Abstract: Systems and methods are disclosed to manage resources in a cloud-based computing system by generating a model of a relationship between cloud database resources and an expected profit based on cloud-server system parameters and service level agreements (SLAs) that indicates profits for different system performances, wherein the model comprises a two level optimization/control problem, wherein model receives system metrics, number of replicas, and arrival rate as the multiple input; and dynamically adjusting resource allocation among different customers based on current customer workload and the expected profit to maximize the expected profit for a cloud computing service provider.

Abstract: Systems and methods are disclosed for scheduling one or more queries for execution with one or more cloud computers by applying a service level agreement (SLA) analysis using an SLA-tree data structure to each query in a query queue; using the SLA-tree data structure to determine an overall profit in the query queue; and generating a profit-oriented schedule to select the next query for execution by the cloud computers.

Abstract: The present invention provides a computer-readable medium and system for selecting a set of n-grams for indexing string data in a DBMS system. Aspects of the invention include providing a set of candidate n-grams, each n-gram comprising a sequence of characters; identifying sample queries having character strings containing the candidate n-grams; and based on the set of candidate n-grams, the sample queries, database records, and an n-gram space constraint, automatically selecting, given the space constraint, a minimal set of an n-grams from the set of candidate n-grams that minimizes the number of false hits for the set of sample queries had the sample queries been executed against the database records.

Abstract: Systems and methods are disclosed to schedule jobs in a cloud computing infrastructure by receiving in a first queue jobs with deadlines or constraints specified in a hard service level agreement (SLA); receiving in a second queue jobs with a penalty cost metric specified in a soft SLA; and minimizing both constraint violation count and total penalty cost in the cloud computing infrastructure by identifying jobs with deadlines in the first queue and delaying jobs in the first queue within a predetermined slack range in favor of jobs in the second queue to improve the penalty cost metric.

Abstract: Systems and methods are disclosed for efficient maintenance of job prioritization for profit maximization in cloud-based service delivery infrastructures with multi-step cost structure support by breaking multiple steps in the SLA of a job into corresponding cost steps; generating a segmented cost function for each cost step; creating a cost-based-scheduling (CBS)-priority value associated with a validity period for each segment based on the segmented cost function; and choosing the job with the highest CBS priority value.

Abstract: A computer-implemented method for pairing a new document to a document from a plurality of documents. Embodiments include, for each of the new document and the plurality of documents, generating a vector of terms of interest uniquely associated with a document of the new document and the plurality of documents. For each term of interest, an associated element value of the vector is assigned as zero if the term of interest does not occur in the document and one otherwise. The method also includes, for each document from the plurality of documents, determining a similarity between the vectors. The method also includes selecting a document from the plurality of documents as related to the new document if the similarity between the vector for the new document and the vector for the document from the plurality of documents is greater than or equal to a threshold value.

Abstract: A method and system for forming service compositions to provide service components to business processes. Service components independently needed by each business process are identified. At least one of the service components is needed by at least two business processes. At least two different service components are needed by at least one business process. At least two service compositions are specified. Each service composition includes at least one service component. At least one service composition comprises at least two service components. An optimal subset of the service compositions is ascertained, such that the total cost of deploying the service compositions in the optimal subset to provide the service components independently needed by each business process does not exceed the total cost of deploying the service compositions in any other subset of the service compositions to provide the service components independently needed by each business process.

Abstract: A system includes one or more application nodes sending SQL queries to one or more query execution nodes. Each query execution node translates the SQL queries into key-based requests to the storage engine, which comprises one or more storage nodes. The system provides an abstraction layer with an external schema and an internal schema, maps the external schema into the internal schema; and generates one or more microshards for the storage node.

Abstract: A client-server relational database system, wherein data from the client computer is encrypted by the client computer and hosted by the server computer, the encrypted data is operated upon by the server computer, using one or more operators selected from a group of operators comprising: (a) inequality logic operators, (b) aggregation operators, and (c) wildcard matching operators, to produce an intermediate results set, the intermediate results set is sent from the server computer to the client computer, and the intermediate results set is decrypted and filtered by the client computer to produce actual results. The group of operators is limited because the encrypted results set, when decrypted, includes inaccuracies therein. The client computer applies a set of correction procedures to the decrypted results set to remove the inaccuracies therein.

Abstract: A system, method and programmed article of manufacture to perform efficient encryption key updates in encrypted database-as-a-service (DAS) environments using a key registry and key locks. A database as a service environment allows organizations to send their data management infrastructures to a database service provider. The service provider employs data encryption techniques to ensure the privacy of hosted data. The security of encryption techniques relies on the confidentiality of the encryption keys. The dynamic nature of the encrypted database in the DAS model adds complexity and raises specific requirements on key management techniques. The solution is provided by the key registry and by the key update lock, key management process and log management process to allow data update access to data concurrently with encryption key update for the same data.