Patent application number | Description | Published |
20090063404 | SELECTION OF A SET OF OPTIMAL N-GRAMS FOR INDEXING STRING DATA IN A DBMS SYSTEM UNDER SPACE CONSTRAINTS INTRODUCED BY THE SYSTEM - 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 in 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. | 03-05-2009 |
20090077378 | QUERYING ENCRYPTED DATA IN A RELATIONAL DATABASE SYSTEM - 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. | 03-19-2009 |
20100241629 | System and Methods for Database Distribution and Querying over Key-based Scalable Storage - 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. | 09-23-2010 |
20110087701 | SYSTEM, METHOD, AND APPARATUS FOR PAIRING A SHORT DOCUMENT TO ANOTHER SHORT DOCUMENT FROM A PLURALITY OF SHORT DOCUMENTS - 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. | 04-14-2011 |
20110173038 | CONSTRAINT-CONSCIOUS OPTIMAL SCHEDULING FOR CLOUD INFRASTRUCTURES - 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. | 07-14-2011 |
20110173626 | EFFICIENT MAINTENANCE OF JOB PRIORITIZATION FOR PROFIT MAXIMIZATION IN CLOUD SERVICE DELIVERY INFRASTRUCTURES - 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. | 07-14-2011 |
20110219031 | SYSTEMS AND METHODS FOR SLA-AWARE SCHEDULING IN CLOUD COMPUTING - 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. | 09-08-2011 |
20120022910 | INTELLIGENT MANAGEMENT OF VIRTUALIZED RESOURCES FOR CLOUD DATABASE SYSTEMS - 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. | 01-26-2012 |
20120023501 | HIGHLY SCALABLE SLA-AWARE SCHEDULING FOR CLOUD SERVICES - 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. | 01-26-2012 |
20120066020 | MULTI-TENANT DATABASE MANAGEMENT FOR SLA PROFIT MAXIMIZATION - 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. | 03-15-2012 |
20120109873 | ADMISSION CONTROL IN CLOUD DATABASES UNDER SERVICE LEVEL AGREEMENTS - 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). | 05-03-2012 |
20120109936 | COST-EFFECTIVE DATA LAYOUT OPTIMIZATION OVER HETEROGENEOUS STORAGE CLASSES - 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. | 05-03-2012 |
20120143951 | SYSTEM AND METHOD FOR PROVIDING A PLATFORM AS A SERVICE (PAAS) WITH A MATERIALIZED SHARED SPACE - 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. | 06-07-2012 |
20120144040 | NEGOTIATION TOOL AND METHOD FOR CLOUD INFRASTRUCTURE DATA SHARING - 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. | 06-07-2012 |
20120144403 | System and method for gathering context parameters to determine a mobile user context - 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. | 06-07-2012 |
20120144407 | System and method for cloud infrastructure data sharing through a uniform communication framework - 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. | 06-07-2012 |
20120265741 | REPLICA BASED LOAD BALANCING IN MULTITENANT DATABASES - 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. | 10-18-2012 |
20130085742 | SERVICE LEVEL AGREEMENT-AWARE MIGRATION FOR MULTITENANT DATABASE PLATFORMS - A method for migration from a multitenant database is shown that includes building an analytical model for each of a set of migration methods based on database characteristics; predicting performance of the set of migration methods using the respective analytical model with respect to tenant service level agreements (SLAs) and current and predicted tenant workloads, where the prediction includes a migration speed and an SLA violation severity; and selecting a best migration method from the set of migration methods according to the respective predicted migration speeds and SLA violation severities. | 04-04-2013 |
20130085998 | LATENCY-AWARE LIVE MIGRATION FOR MULTITENANT DATABASE PLATFORMS - Methods and systems for database migration from a multitenant database include taking a snapshot of an original database to be migrated with a hot backup process, such that the database is still capable of answering queries during the hot backup process; maintaining a query log of all queries to the tenant database after the hot backup process begins; initializing a new database at a target server using the snapshot; replaying the query log synchronize the new database with the original database; and answering new queries with the new database and not the original database. | 04-04-2013 |
20130110574 | GENERATION AND OPTIMIZATION OF DATA SHARING AMONG MULTIPLE DATA SOURCES AND CONSUMERS | 05-02-2013 |
20130110575 | FINDING OPTIMUM COMBINED PLANS AMONG MULTIPLE SHARING ARRANGEMENTS AND MULTIPLE DATA SOURCES AND CONSUMERS | 05-02-2013 |
20130110767 | Online Transaction Processing | 05-02-2013 |
20130132403 | TENANT PLACEMENT IN MULTITENANT CLOUD DATABASES WITH DATA SHARING - A method for tenant placement in a multi-tenant system is shown that includes creating a weighted graph of tenants and sharing relationships between tenants, where a weight for each tenant and each sharing relationship represents an associated degree of resource consumption; and adding one or more tenants to a database using a processor based on said weighted graph and a database capacity, such that the combined weight of the added tenants and the sharing relationships belonging to the added tenants are within the database capacity. If a tenant cannot be added to the database without exceeding the database capacity, a new database is created and the one or more tenants are added to the new database, subject to a new database capacity. The adding and creating steps are repeated until all tenants have been added to a database. | 05-23-2013 |
20130132404 | TENANT PLACEMENT IN MULTITENANT CLOUD DATABASES WITH ONE-TO-MANY DATA SHARING - Methods for generating a data fetching plan in a multi-tenant system include placing tenants in consecutively allocated databases according to a weighted graph of tenants and sharing relationships between tenants, where at least one sharing relationship includes multiple accessing tenants accessing a given set of data from a provider tenant. For each sharing relationship, if a current database has one or more accessing tenants and does not have the provider tenant, data is fetched from the latest-allocated database prior to the current database that has accessing tenants, if such a database exists; if a current database has the provider tenant, data is provided to the earliest-allocated database after the current database that has accessing tenants if such a database exists. The fetching and providing steps are repeated for each allocated database. | 05-23-2013 |
20130166750 | SCHEDULING METHODS USING SOFT AND HARD SERVICE LEVEL CONSIDERATIONS - A computer implemented method of workload scheduling under two different types of Service Level Agreements (SLAs), namely soft and hard SLA which employ both a deadline- and cost-aware scheduler called iCBS-DH. The scheduler is evaluated against deadline and cost performance of various scheduling policies under a large range of SLA cost function and deadline types. | 06-27-2013 |
20130212064 | SYSTEM AND METHOD FOR SLA-AWARE DATABASE CONSOLIDATION USING PER-TENANT MEMORY SIZE CONFIGURATION - Systems and methods for consolidating workload on one or more computing devices, comprising: generating tenant performance profiles for at least one of a buffer memory size and a buffer warmness; assigning one or more tenants to a database management system (DBMS) instance; configuring the one or more tenants to minimize a total server count needed to host the one or more tenants; and reducing the total server count by adjusting of buffer sizes while satisfying Service Level Agreement (SLA) requirements. | 08-15-2013 |
20130226878 | SEAMLESS CONTEXT TRANSFERS FOR MOBILE APPLICATIONS - Methods and systems for seamless context transfers include receiving a context object from one or more applications, where the context object including updated context information for a user having an associated timestamp; entering the updated context information into a context information database; determining entries of the context information database for the user having a timestamp older than a predetermined threshold using a processor; purging the determined entries from the context information database; and sending an updated context object to one or more applications that reflects a current state of the context information for the user. | 08-29-2013 |
20130226903 | PREDICTING QUERY EXECUTION TIME - There are provided a system and method for predicting query execution time in a database system. A cost model determination device determines a cost model of a database query optimizer for the database system. The cost model models costs of queries applied to the database system. A profiling device determines profiling queries for profiling input/output cost units and processor cost units relating to the database system, and profiles the cost units using the profiling queries to output profiled cost units. A calibrating device calibrates cost units in the cost model responsive to the profiled cost units to output calibrated cost units. A sampling re-estimator samples and re-estimates a cardinality estimation of a final query plan to output an updated cardinality estimation. A predictor applies the calibrated cost units and the updated cardinality estimation in the cost model to generate a prediction of an execution time of a given query. | 08-29-2013 |
20130275382 | BALANCING DATABASE WORKLOADS THROUGH MIGRATION - A method for balancing database workloads among a plurality of database servers includes when a new server is available, selecting a set of master and slave databases to be migrated to the new server; and migrating the selected databases to result in a balanced new workload among all servers while minimizing migration cost; and during operation, if workload unbalance is detected in real time from a workload change in a certain database, iteratively selecting one database at a time to migrate to a different server to balance the workload. | 10-17-2013 |
20130346360 | TENANT PLACEMENT IN MULTITENANT DATABASES FOR PROFIT MAXIMIZATION - A method for database consolidation includes generating a model for expected penalty estimation; determining a tenant's value as a function of query arrival rate and SLA penalty; placing a tenant to minimize a total expected cost in the order of the tenant value; and progressively using additional servers to prevent any server from being saturated to guarantee a tenant placement that costs no more than four times the cost of any other placement | 12-26-2013 |
20140006383 | SYSTEM FOR EVOLUTIONARY ANALYTICS | 01-02-2014 |
20140122374 | COST EXPLORATION OF DATA SHARING IN THE CLOUD - A method to facilitate data sharing for cloud applications includes determining one or more cost levers for a cloud service provider to share data among applications; determining a costing function that considers a resource cost of creating and maintaining the sharing, potential penalties to be paid if a service level agreement (SLA) is breached by the cloud service provider, and overprovisioning of services from the provider; and interactively answering what-if questions on pricing of services to allow a consumer to explore the cost of data sharing from the provider. | 05-01-2014 |
20140122387 | PORTABLE WORKLOAD PERFORMANCE PREDICTION FOR THE CLOUD - A method is disclosed to perform performance prediction for cloud-based databases by building on a computer a cloud database performance model using one or more training workloads; and using the learned model on the computer to predict database performance in the cloud for a new workload. | 05-01-2014 |
20140129531 | Automatic Entity-Grouping for Scalable OLTP - A method for automatic database design for scalability by receiving a database schema and database workload; applying transaction chopping to split a large transaction into smaller transactions; select one or more transactions using dynamic programming based on transaction weights; deriving a database design that covers the selected transactions; and generating a transaction class design that is scalable. | 05-08-2014 |
20140129588 | SYSTEM AND METHODS FOR PRIORITIZING QUERIES UNDER IMPRECISE QUERY EXECUTION TIME - Systems and methods for prioritizing queries in a cloud based database by determining a priority score in real time under an imprecise query execution time; and incrementally maintaining query priority scores. | 05-08-2014 |
20140188532 | Multitenant Database Placement with a Cost Based Query Scheduler - Systems and methods are disclosed for placing tenants in a cloud based database server, by estimating with a processor a cost of placing a set of tenants on a server using a simulator; estimating a relative importance of different tenant's queries; and selecting an optimal server for each tenant based with a cost-based schedular to maximize profit using the simulator. | 07-03-2014 |
20140207755 | System for Multi-store Analytics Execution Environments with Storage Constraints - Systems and methods are disclosed for managing a multi-store execution environment by applying opportunistic materialized views to improve workload performance and executing a plan on multiple database engines to increase query processing speed by leveraging unique capabilities of each engine by enabling stages of a query to execute on multiple engines, and by moving materialized views across engines. | 07-24-2014 |
20140214793 | Cost-Effective Data Layout Optimization Over Heterogeneous Storage Classes - A system to optimize layout of database objects in a relational database management system stored on a plurality of storage classes each characterized by a price and a storage capacity includes a time-based query optimizer and a layout recommender coupled to the time-based query optimizer to estimate a total cost of operation (TCO) for a query workload on each data layout. The layout recommender includes an auxiliary object selection comprising database objects that include auxiliary objects that are optional to place with auxiliary object candidates being given from an auxiliary object recommender component. | 07-31-2014 |
20140214880 | System and methods for Predicting Query Execution Time for Concurrent and Dynamic Database Workloads - Systems and methods for predicting query execution time for concurrent and dynamic database workloads include decomposing each query into a sequence of query pipelines based on the query plan from a query optimizer, and predicting an execution time of each pipeline with a progress predictor for a progress chart of query pipelines. | 07-31-2014 |