| Patent application number | Description | Published |
|---|
| 20080222087 | System and Method for Optimizing Query Access to a Database Comprising Hierarchically-Organized Data - An cost based optimizer optimizes access to at least a portion of hierarchically-organized documents, such as those formatted using eXtensible Markup Language (XML), by estimating a number of results produced by the access of the hierarchically-organized documents. Estimating the number of results comprises computing the cardinality of each operator executing query language expressions and further computing a sequence size of sequences of hierarchically-organized nodes produced by the query language expressions. Access to the hierarchically-organized documents is optimized using the structure of the query expression and/or path statistics involving the hierarchically-organized data. The cardinality and the sequence size are used to calculate a cost estimation for execution of alternate query execution plans. Based on the cost estimation, an optimal query execution plan is selected from among the alternate query execution plans. | 09-11-2008 |
| 20080263001 | SYSTEM AND METHOD FOR AUTOMATING DATA PARTITIONING IN A PARALLEL DATABASE - A system for automating data partitioning in a parallel database includes plural nodes connected in parallel. Each node includes a database server and two databases connected thereto. Each database server includes a query optimizer. Moreover, a partitioning advisor communicates with the database server and the query optimizer. The query optimizer and the partitioning advisor include a program for recommending and evaluating data table partitions that are useful for processing a workload of query statements. The data table partitions are recommended and evaluated without requiring the data tables to be physically repartitioned. | 10-23-2008 |
| 20100005077 | METHODS AND SYSTEMS FOR GENERATING QUERY PLANS THAT ARE COMPATIBLE FOR EXECUTION IN HARDWARE - Embodiments of the present invention generate and optimize query plans that are at least partially executable in hardware. Upon receiving a query, the query is rewritten and optimized with a bias for hardware execution of fragments of the query. A template-based algorithm may be employed for transforming a query into fragments and then into query tasks. The various query tasks can then be routed to either a hardware accelerator, a software module, or sent back to a database management system for execution. For those tasks routed to the hardware accelerator, the query tasks are compiled into machine code database instructions. In order to optimize query execution, query tasks may be broken into subtasks, rearranged based on available resources of the hardware, pipelined, or branched conditionally | 01-07-2010 |
| 20110060768 | Computer Software for Visualizing Genotyping Data - A computer system for visualizing recombination events in a group of individuals is provided. According to one aspect of the invention, high-density SNP genotype data is obtained from related individuals in a family. A pedigree is created, haplotypes are reconstructed and likely recombination breakpoints are identified with the use of publicly available computer programs. A software tool is then used facilitate the visualization of the recombination events in the family. | 03-10-2011 |
| Patent application number | Description | Published |
|---|
| 20080317217 | SYSTEM AND METHOD FOR DETERMINING AND OPTIMIZING RESOURCES OF A DATA PROCESSING SYSTEM UTILIZED BY A SERVICE REQUEST - A computer-implemented method for determining resources utilized by a service request in a data processing system. The method includes determining monitored relationship types from monitoring data, determining relationship domains, determining intra-domain relationships from relationships that are internal to the relationship domains and determining cross-domain relationships from the intra-domain relationships that are linked between pairs of the relationship domains, and determining resources utilized by the service request from the intra-domain and cross-domain relationships. The domains are derived from one of the relationship types that is monitored by a single monitoring application. | 12-25-2008 |
| 20090287744 | APPARATUS, SYSTEM AND METHOD FOR HEALTHCHECK OF INFORMATION TECHNOLOGY INFRASTRUCTURE BASED ON LOG DATA - A method and system for checking health of information technology infrastructure based on log data, in one aspect, collect log data non-intrusively from a production system, said log data at least associated with transactions occurring in the production system and resource utilization of the production system, normalize said log data into a plurality of log data types, perform data regression analysis using said plurality of log data types to estimate resources consumed by each of said transactions and throughput of each of said transactions, and use a queuing model to predict performance of the information technology infrastructure under various workloads. | 11-19-2009 |
| 20100005468 | BLACK-BOX PERFORMANCE CONTROL FOR HIGH-VOLUME THROUGHPUT-CENTRIC SYSTEMS - Throughput of a high-volume throughput-centric computer system is controlled by dynamically adjusting a concurrency level of a plurality of events being processed in a computer system to meet a predetermined target for utilization of one or more resources of a computer system. The predetermined target is less than 100% utilization of said one or more resources. The adjusted concurrency level is validated using one or more queuing models to check that said predetermined target is being met. Parameters are configured for adjusting the concurrency level. The parameters are configured so that said one or more resources are shared with one or more external programs. A statistical algorithm is established that minimizes total number of samples collected. The samples may be used to measure performance used to further dynamically adjust the concurrency level. A dynamic thread sleeping method is designed to handle systems that need only a very small number of threads to saturate bottleneck resources and hence are sensitive to concurrency level changes. | 01-07-2010 |
