Entries |
Document | Title | Date |
20100082603 | Managing Execution Of Database Queries - One embodiment is a method to manage queries in a database. The method identifies a query that executes on the database for an elapsed time that is greater than a threshold and then implements a remedial action when the query executes on the database for an execution time that is greater than an estimated execution time. | 04-01-2010 |
20100114871 | Distance Quantization in Computing Distance in High Dimensional Space - Techniques and systems for quantization based nearest neighbor searches can include quantizing a set of candidate points based on one or more characteristics of a query point; generating metric values based on the quantized candidate points, respectively, the metric values being indicative of respective proximities between the query point and the candidate points; and selecting one or more of the candidate points in response to the query point based on the metric values. In some implementations, techniques and systems can compress search metric computation resolution by implementing non-uniform scalar quantization within a metric computation process. | 05-06-2010 |
20100205173 | QUERY STRING MATCHING METHOD AND APPARATUS - In one implementation, a method is provided for increasing relevance of database search results. The method includes receiving a subject query string and determining a trained edit distance between the subject query string and a candidate string using trained cost factors derived from a training set of labeled query transformations. A trained cost factor includes a conditional probability for mutations in labeled non-relevant query transformations and a conditional probability for mutations in labeled relevant query transformations. The candidate string is evaluated the for selection based on the trained edit distance. In some implementations, the cost factors may take into account the context of a mutation. As such, in some implementations multi-dimensional matrices are utilized which include the trained cost factors. | 08-12-2010 |
20100217759 | SYSTEM, METHOD, AND PROGAM PRODUCT FOR DATABASE RESTRUCTURING SUPPORT - A database restructuring support system that enables a user to flexibly design the structure of a database after a restructure. | 08-26-2010 |
20100241622 | METHOD AND APPARATUS FOR QUERY PROCESSING - An n-gram based query processing apparatus and method are provided. A query processing is performed using only a portion of n-grams out of all n-grams with respect to the search key. A candidate set of documents having a possibility of including the search key is extracted using a posting list with respect to the portion of n-grams. | 09-23-2010 |
20110010360 | RESTRICTING QUERIES BASED ON COST OF PERFORMANCE - Queries that are determined to be too expensive to perform are prevented from being executed. Queries are determined to be too expensive based on the resources that are required to perform the query. For example, the query may be determined to be too expensive to perform based a length of a list the query requires to access, a number of lookups that may be performed relating to the query, a number of unique permissions accessed by the query, and the like. Queries that are deemed to expensive during normal operation may be performed during other times such that the impact of performing the query on other users is limited. | 01-13-2011 |
20110010361 | SYSTEM, METHOD, AND COMPUTER-READABLE MEDIUM FOR CONTROLLING OPTIMIZER ROBUSTNESS AND ACHIEVING SERVICE LEVEL GOALS IN A DATABASE SYSTEM - A system, method, and computer-readable medium for automatic and dynamic control of optimizer settings in a large complex system environment are provided. The described mechanisms significantly increase the potential of achieving Service Level Goals for classes of queries where optimizer aggression is needed. Confidence threshold parameters are automatically controlled to facilitate generation of query execution plans to conform with associated Service Level Goals. | 01-13-2011 |
20110022585 | MULTI-PARTITION QUERY GOVERNOR IN A COMPUTER DATABASE SYSTEM - An apparatus and method for a multi-partition query governor in a partitioned computer database system. In preferred embodiments a query governor uses data of a query governor file that is associated with multiple partitions to determine how the query governor manages access to the database across multiple partitions. Also, in preferred embodiments, the query governor in a local partition that receives a query request communicates with a query governor in a target partition to accumulate the total resource demands of the query on the local and target partitions. In preferred embodiments, a query governor estimates whether resources to execute a query will exceed a threshold over all or a combination of database partitions. | 01-27-2011 |
20110055201 | SYSTEM, METHOD, AND COMPUTER-READABLE MEDIUM FOR AUTOMATIC INDEX CREATION TO IMPROVE THE PERFORMANCE OF FREQUENTLY EXECUTED QUERIES IN A DATABASE SYSTEM - A system, method, and computer-readable medium that facilitate the optimization of frequently executed queries via automated index creation are provided. Standard optimizer strategies for dynamic index creation are utilized with query frequency information taken from a system's request cache. The described mechanisms provide a process of determining what indexes would be beneficial to query performance based on decisions and information from the optimizer that is ultimately responsible for the choice of index usage. Further, the plan cache is utilized in a manner that provides reliable information about the historical and anticipated frequency of specific queries. | 03-03-2011 |
20110119251 | System and Method for SQL Query Load Balancing - Systems and methods for SQL query load balancing are disclosed. A method may include establishing a ranking scheme, assigning a rank to an SQL query from the ranking scheme based on a plurality of rank assignment parameters, determining a threshold rank based on a plurality of gathered operational characteristics, comparing the assigned rank to the threshold rank, and, if the assigned rank is greater than the threshold rank, executing the SQL query on a database server. Otherwise, if the assigned rank is not greater than the threshold rank, executing the SQL query on a centralized storage system. | 05-19-2011 |
20110137890 | Join Order for a Database Query - In an embodiment, a portion of the execution plan is executed to produce a portion of records in a partial result set. If a first join of a table is performed that eliminates more than a first threshold number of records from the partial result set, a determination is made whether an estimated cost of a forced primary join is less than an estimated cost of a star join. If the estimated cost of the forced primary join is less than the estimated cost of the star join, then the table is moved first in a join order in the execution plan, the portion of the records in the partial result set is discarded, and the execution is re-started with a different portion of the execution plan to produce a different portion of the records. | 06-09-2011 |
20110161311 | SEARCH SUGGESTION CLUSTERING AND PRESENTATION - Disclosed are methods and apparatus for clustering and presenting search suggestions. A segment of text is obtained via a search query section of a user interface, the segment of text being a portion of a search query. A set of suggestions is obtained, each suggestion in the set of suggestions being a suggested search query relating to the segment of text. Two or more groups of suggestions are generated, each of the two or more groups of suggestions including a different subset of the set of suggestions. The two or more groups of suggestions are provided such that each of the two or more groups of suggestions is displayed in a separate partition of a search assistance segment of the user interface. | 06-30-2011 |
20110173183 | SYSTEM AND METHOD FOR OPTIMIZING SEARCH RESULTS RANKING THROUGH COLLABORATIVE GAMING - The present invention provides a method and system for optimizing search result rankings through use of a game interface. The method and system includes providing a game interface to at least two users, the game interface comprising at least one search query and at least two search result sets. The method and system further includes detecting the selection of one of the two search result sets by the users based on competition criteria and updating ranking data in response to the selection of one of the two search results. The method and system further includes selecting ranking data associated with a given query, determining an optimum ranking based on aggregating the selected ranking data, and storing the optimum ranking. | 07-14-2011 |
20110184935 | COMPUTERIZED SYSTEM AND METHOD FOR ASSISTING IN RESOLUTION OF LITIGATION DISCOVERY IN CONJUNCTION WITH THE FEDERAL RULES OF PRACTICE AND PROCEDURE AND OTHER JURISDICTIONS - A networked data processor maintains a database of information concerning potential evidence from litigants in legal proceedings supporting stipulated discovery agreements, and requiring meet-and-confer sessions prior to seeking court supervision. Individual or adverse parties can participate. Sources include data custodians, file repositories, electronic data, witnesses, etc. Managers and employees are polled to populate a database defining the litigant's organization and evidence. The evidence may be sequestered, copied and processed, e.g., filtered for confidentiality or privilege, analyzed as to format, and queried to assess the volume of data that would be responsive under alternative discovery specifications. Cost and time are assessed under alternative specifications and reports are provided for use in negotiating a discovery plan. A stipulated discovery plan may result, or if not, a meet-and-confer session is electronically managed in a multi-user teleconference. A report of stipulated and disputed points and associated arguments can be presented to the court. | 07-28-2011 |
20110270822 | DATABASE QUERY GOVERNOR WITH TAILORED THRESHOLDS - A query governor intelligently sets tailored thresholds for a query accessing a computer database. The query governor preferably generates a tailored threshold for each query sent to the database for execution. The tailored threshold for the query is preferably compared to an estimated query execution time to determine whether to execute the query. The query governor uses one or more factors applied to a standard threshold to generate the tailored threshold. The factors preferably include user factors and query factors. These factors are dynamically adjusted by the query governor in an intelligent way to increase optimal use of the database. Other factors may include factors such as job priority factor, resource factor and an application factor. | 11-03-2011 |
20110282864 | Method and System for Optimizing Queries in a Multi-Tenant Database Environment - In accordance with embodiments, there are provided mechanisms and methods for query optimization in a database system. These mechanisms and methods for query optimization in a database system can enable embodiments to optimize OR expression filters referencing different logical tables. The ability of embodiments to optimize OR expression filters referencing different logical tables can enable optimization that is dynamic and specific to the particular tenant for whom the query is run and improve the performance and efficiency of the database system in response to query requests. | 11-17-2011 |
20110295840 | GENERALIZED EDIT DISTANCE FOR QUERIES - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining a generalized edit distance for queries. In one aspect, a method includes selecting query pairs of consecutive queries, each query pair being a first query and a second query consecutively submitted as separate queries, each first and second query including at least one term. For each query pair, the method includes selecting term pairs from the query pair, each term pair being a first term in the first query and a second term in the second query; and determining a co-occurrence value for each term pair. The method also includes determining transition costs based on the co-occurrence values for term pairs, each transition cost indicative of a cost of transitioning from a first term in a first query to a second term in a second query consecutive to the first query. | 12-01-2011 |
20110307472 | SYSTEM AND METHOD FOR MANAGING METADATA IN A RELATIONAL DATABASE - In a method for storing data in a relational database system using a processor, a collection of values is assigned to a structure dictionary, wherein each of the values represents the value of a row for an attribute and has a unique ordinal number within the collection, and wherein the structure dictionary contains structures defined based on at least one of interaction with a user of the system via an interface, automatic detection of structures occurring in data, and predetermined information about structures relevant to data content that is stored in the system. For each structure in the structure dictionary, a structure match list is formed from ordinal numbers of values matching the structure, and a structure sub-collection from values matching the structure, using the processor. An outlier match list is formed from ordinal numbers of values that are not null and do not match any structure in the structure dictionary, and an outlier sub-collection from values that are not null and do not match any structure in the structure dictionary. The collection of values is stored in the relational database in a form of structure match lists, structure sub-collections, outlier match list and outlier sub-collection. | 12-15-2011 |
20110320436 | OPTIMIZING ACCESS TIME OF FILES STORED ON STORAGES - When each file of a number of files is accessed, at least a number of times each file has been accessed is kept track of. Each file is stored on a storage of a number of storages. Periodically, at least one file is moved among the number of storages, based at least on the number of times each file has been accessed. As such, the at least one file is moved from being stored on a first storage to being stored on a second storage, to optimize subsequent access time of the at least one file. The storages are physically distinct storage devices. At least one of the storage devices has different storage characteristics as compared to one or more other of the storage devices. | 12-29-2011 |
20120030193 | Method and system for connecting users - A method and system for connecting users via a matrix/mesh/grid/graph of intermediate relationship routing (FIG. | 02-02-2012 |
20120036120 | QUERY TRANSLATION FOR SEARCHING COMPLEX STRUCTURES OF OBJECTS - Searching stored content is disclosed. A first mapping is created from an object to one or more stored relational database tables. A second mapping is created from the object to an indexer schema. One or both of the following is done: 1) using the first mapping to translate a search request expressed in an abstract query language to a first query language associated with the relational database; and 2) using the second mapping to translate the search request to a second query language associated with the indexer schema. | 02-09-2012 |
20120072414 | QUERY PROCESSING ALGORITHM FOR VERTICALLY PARTITIONED FEDERATED DATABASE SYSTEMS - Querying data stores in a federation of data stores. A first search filter is accessed. The first search filter is constructed with one or more nested logical AND, OR, or NOT operands. The first search filter is normalized to a normalized search filter that is logically equivalent to the first search filter. The normalized search filter includes 3 or 4 levels. All first level operands are logically ORed. All second level operands are logically ANDed. All third level operands are at least one of parameters or logical NOTs. Any fourth level operands are parameters. The normalized search filter is used to search a plurality of data stores in a federation of data stores for information by searching different data stores for at least two or more of the top level operands. | 03-22-2012 |
20120078880 | Accelerating Database Queries Containing Bitmap-Based Conditions - Systems, methods and articles of manufacture for accelerating database queries containing bitmap-based conditions are described herein. An embodiment includes determining a bitmap, where the bitmap represents a set of rows that have satisfied one or more conjunctive conditions which preceded a conjunct that is a disjunction in a query expression and restricting evaluation of a disjunct within the disjunction to the set of rows represented by the bitmap. Another embodiment includes determining a satisfaction bitmap, where the bitmap represents the result of one or more preceding disjuncts in a disjunction within a query expression and restricting scope of evaluation of a disjunct to a set of rows that are not within the determined satisfaction bitmap. In this way, embodiments of the present invention enable the acceleration of queries containing disjunctions of conditions on a database table, as well as reduce the temporary resources consumed for such queries. | 03-29-2012 |
20120084278 | SCAN SHARING FOR QUERY PREDICATE EVALUATIONS IN COLUMN-BASED IN-MEMORY DATABASE SYSTEMS - A plurality of queries of an in-memory column-oriented database are obtained. Each of the queries has at least one column predicate. For each of the queries, it is determined which of a plurality of columns in the in-memory column-oriented database need to be scanned. The plurality of queries are grouped into a plurality of scan groups, based at least in part on the determining step. The column predicates are evaluated for those of the queries in a given one of the scan groups in accordance with a scheduling scheme. The grouping step and the scheduling scheme take into account real time scan information. | 04-05-2012 |
20120095990 | METHOD AND SYSTEM FOR APPROXIMATE STRING MATCHING - A method and system for approximate string matching are provided for generating approximate matches whilst supporting compounding and correction rules. The method for approximate string matching of an input pattern to a trie data structure, includes traversing a trie data structure to find approximate partial and full character string matches of the input pattern. Traversing a node of the trie data structure to process a character of the string applies any applicable correction rules to the character, wherein each correction rule has an associated cost, adjusted after each character processed. The method includes accumulating costs as a string of characters is gathered, and restricting the traverse through the trie data structure according to the accumulated cost of a gathered string and potential costs of applicable correction rules. | 04-19-2012 |
20120179669 | SYSTEMS AND METHODS FOR SEARCHING A SEARCH SPACE OF A QUERY - One example discloses a database management system that can comprise a memory for storing computer executable instructions and a processing unit for accessing the memory and executing the computer executable instructions. The computer executable instructions can comprise a compiler to amortize the execution resource cost of searching a search space corresponding to a received query over a plurality of searches. | 07-12-2012 |
20120191701 | DATABASE INDEX PROFILE BASED WEIGHTS FOR COST COMPUTATION - Database tables can have different types of database indices defined for the database tables and different numbers of database indices. The efficiency of reading the indexes can vary with the different profiles of the indexes, which impacts the costs of access plans that use the indexes. Weights can be predefined to reflect the relative efficiencies of the different characteristics. Costs can be computed in accordance with a variety of techniques (e.g., based on edge traversals). The weights can be predefined to reduce costs, increase costs, or a combination thereof. A database management application or associated application or program can also refine or revise these weights based on statistical data gathered about the operation of the database and/or heuristics that are developed based on observations/research. The corresponding weights can be adjusted accordingly. | 07-26-2012 |
20120191702 | INTELLIGENT ADAPTIVE INDEX DENSITY IN A DATABASE MANAGEMENT SYSTEM - Adaptive index density in a database management system is provided, which includes receiving a number of partitions for an index for a database table, the index subject to creation. The adaptive index density also includes selecting a column from the database table, the column selected based upon an estimated frequency of execution of database queries for the column. The adaptive index density further includes calculating an estimated cost of executing each of the database queries for the column, and determining data to reside in each of the partitions of the index responsive to the estimated cost. | 07-26-2012 |
20120226679 | FULFILLING QUERIES USING SPECIFIED AND UNSPECIFIED ATTRIBUTES - A query is received and processed to determine one or more specified and unspecified attributes in the query. The specified and unspecified attributes may correspond to attributes of one or more items. A graph is generated for the items and includes a node for each item and an edge between each unique pair of nodes. Each node is assigned a cost based on a distance between the specified attributes of the query and the attributes of the item associated with the node. Each edge is assigned a weight based on a distance between the unspecified attributes associated with the nodes of the node pair corresponding to the edge. A set of nodes from the graph is selected by minimizing a total cost of the nodes while maximizing a dispersion of the nodes based on the edge weights. | 09-06-2012 |
20120259840 | SYSTEM AND METHOD FOR ENHANCED QUERY OPTIMIZER SEARCH SPACE ORDERING - In an optimizer within a Relational Database Management System improved ways in which a search space (the universe of possible join combinations) is generated and managed and improved ways in which the elements of a search space are evaluated so that among other things unpromising elements are efficiently dropped (pruned). | 10-11-2012 |
20120330927 | INTELLIGENT ADAPTIVE INDEX DENSITY IN A DATABASE MANAGEMENT SYSTEM - Adaptive index density in a database management system is provided, which includes receiving a number of partitions for an index for a database table, the index subject to creation. The adaptive index density also includes selecting a column from the database table, the column selected based upon an estimated frequency of execution of database queries for the column. The adaptive index density further includes calculating an estimated cost of executing each of the database queries for the column, and determining data to reside in each of the partitions of the index responsive to the estimated cost. | 12-27-2012 |
20130066851 | MULTIPLE CANDIDATE SELECTION IN AN ENTITY RESOLUTION SYSTEM - Systems, methods and articles of manufacture are disclosed for matching an inbound identity record to existing entities. Entity resolution (ER) candidate-building keys may be determined for a received identity record. A query may be generated from the ER candidate-building keys. When executing the query, a generic key may be identified. Execution of the query may be aborted upon a condition involving the generic key being satisfied. | 03-14-2013 |
20130117257 | QUERY RESULT ESTIMATION - Techniques for efficiently performing queries are provided. A search component can receive a request for information based on data, and a management component can determine a degree of accuracy requested for the information. In turn, the search component can render the information based on the degree of accuracy requested. In an aspect, the search generates a query configured to determine the first information, and the management component instructs the search component to perform the query to a level of completion less than full completion when the degree of accuracy requested is below a predetermined threshold to cause the search component to render an estimation of the first information. In another aspect, a tracking component can track information associated with multiple query requests and an analysis determine and employ a related aspect of the tracked information to a new query request to determine an answer for a the new query request. | 05-09-2013 |
20130124502 | METHOD AND APPARATUS FOR FACILITATING ANSWERING A QUERY ON A DATABASE - A method and apparatus for facilitating answering a query on a database. Example embodiments include: accessing a database tree having a plurality of nodes; receiving a set of input variable values, a non-empty set of output variables, and information indicative of a node in the database tree; determining a traversal cost based on the node and the set of input variable values; determining a lower bound based on the node and the set of input variable values, wherein the lower bound corresponds to an upper-bound probability estimate based on one or more of the plurality of nodes and the set of input variable values; pruning one or more of the plurality of nodes based on the traversal cost, the lower bound, and a pruning bound; and returning a result including a non-empty set of output variable values based on the set of input variable values, the node, the traversal cost, and the lower bound. | 05-16-2013 |
20130132371 | METHODS, SYSTEMS, AND COMPUTER-READABLE MEDIA FOR PROVIDING A QUERY LAYER FOR CLOUD DATABASES - Computer-implemented methods, systems and computer-readable media for providing a query layer for cloud databases comprise importing data into said cloud by at least one of the computing devices, converting at least one of the queries over row-store database into a query over column-store database by means of cost based query optimizer and retrieving said data from the column-store database based on said query by at least one of the computing devices. | 05-23-2013 |
20130151506 | SYSTEM AND METHOD FOR DETERMINING AND ACTING UPON A USER'S ASSOCIATION TO A ZONE OF RELEVANCE - A computer-implemented method for determining a zone of relevance for locating a wireless end-user and making a user notification decision including: storing information related to the enterprise in an enterprise database; storing information related to the end-user in an end-user database; accessing said enterprise and user end databases to extract enterprise and end-user related information; accessing a geographical database to extract geographic information, based on information obtained from the enterprise database; extracting relevant dynamic inputs from external sources via a predefined application programming interface; determining a value for the user notification based on weighting of said extracted information and historical use information; determining a zone of relevance for the wireless end-user; and notifying a user, wherein notifying the user meets predetermined criteria for the determined value of notification. | 06-13-2013 |
20130173592 | SYSTEM, METHOD, AND COMPUTER-READABLE MEDIUM FOR OPTIMIZING DATABASE QUERIES WHICH USE SPOOLS DURING QUERY EXECUTION - A database system comprises a processing module, and a storage device communicatively coupled with the processing module and allocated thereto. The storage device stores a base table allocated to the processing module. The processing module receives a database query from a client computer system, and generates a spool based upon a number of columns of a table, and partitions at least one column of the spool based upon the database query received from the client computer system. | 07-04-2013 |
20130179434 | DYNAMIC CONSTRUCTION OF MODULAR INVITATIONAL CONTENT - The present disclosure is related to managing delivery of items of invitational content based on a feature-based model. Specifically, a content delivery system is provided for managing a campaign using a content bundle identifying different content blocks and rules for assembling the content blocks into the items of invitational content. The feature-based model then accrues costs based on content blocks delivered, content blocks accessed, a degree of user interaction with the accessed content blocks, or any combinations thereof. The relative performance of the items can be evaluated by obtaining a ranking based at least on the number of content blocks and a performance of these content blocks. The ranking can then be used to manage future assembly and delivery of items. In some configurations, rules can be provided to specify when particular content items can be included as costs vary. | 07-11-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 |
20130290298 | Data Flow Graph Optimization Using Adaptive Rule Chaining - A query is received and an initial data flow graph comprising a plurality of nodes is generated for executing the query. The initial data flow graph is optimized using a model optimizer that accesses at least one of a plurality of patterns to identify a matching pattern and executes at least one optimization rule associated with a matching pattern. Execution of the query is then initiated using the optimized data flow graph. Related apparatus, systems, techniques and articles are also described. | 10-31-2013 |
20130297586 | OPTIMIZING QUERIES USING PREDICATE MAPPERS - Provided are a computer implemented method, computer program product, and system for re-writing a query. A query including a query predicate is received. It is determined that the query predicate includes one column with an associated predicate mapper. An equivalent predicate is generated for the query predicate using the predicate mapper that provides a mapping from the one column to another column. A cost of the query with the equivalent predicate is evaluated. In response to determining that the cost of the query is optimal, the query is rewritten to replace the query predicate with the equivalent predicate. | 11-07-2013 |
20130297587 | OPTIMIZING QUERIES USING PREDICATE MAPPERS - Provided are a computer implemented method, computer program product, and system for re-writing a query. A query including a query predicate is received. It is determined that the query predicate includes one column with an associated predicate mapper. An equivalent predicate is generated for the query predicate using the predicate mapper that provides a mapping from the one column to another column. A cost of the query with the equivalent predicate is evaluated. In response to determining that the cost of the query is optimal, the query is rewritten to replace the query predicate with the equivalent predicate. | 11-07-2013 |
20130311446 | PERFORMANCE ANALYSIS OF A DATABASE - A method and system are provided for performance analysis of a database. The method includes receiving a proposed data model, generating a hypothetical query workload using a plurality of sample query templates representing different query constructs for the proposed data model, generating hypothetical optimizer statistics using predefined generating rules that include a projected cardinality for the proposed data model and creating a sample empty database and database schema using the proposed data model. The method also includes applying the hypothetical optimizer statistics to the sample empty database, based on generating the hypothetical optimizer statistics, applying each query construct of the hypothetical query workload to the database schema and estimating a cost of the hypothetical query workload for the proposed data model. | 11-21-2013 |
20130346390 | Cost Monitoring and Cost-Driven Optimization of Complex Event Processing System - A cost monitoring system can monitor a cost of queries executing in a complex event processing system, running on top of a pay-as-you-go cloud infrastructure. Certain embodiments may employ a generic, cloud-platform independent cost model, multi-query optimization, cost calculation, and/or operator placement techniques, in order to monitor and explain query cost down to an operator level. Certain embodiments may monitor costs in near real-time, as they are created. Embodiments may function independent of an underlying complex event processing system and the underlying cloud platform. Embodiments can optimize a work plan of the cloud-based system so as to minimize cost for the end user, matching the cost model of the underlying cloud platform. | 12-26-2013 |
20140006384 | Elastic Complex Event Processing | 01-02-2014 |
20140074819 | Optimal Data Representation and Auxiliary Structures For In-Memory Database Query Processing - A method for providing optimized data representation of relations for in-memory database query processing is disclosed. The method seeks to optimize the use of the available memory by encoding relations on which the in-memory database query processing is performed and by employing auxiliary structures to maintain performance. Relations are encoded based on data patterns in one or more attribute-columns of the relation and the encoding that is selected is suited to a particular type of data in the column. Members of a set of auxiliary structures are selected based on the benefit the structure can provide and the cost of the structure in terms of the amount of memory used. Encoding of the relations is performed in real-time while query processing occurs, using locks to eliminate conflicts between the query processing and encoding. | 03-13-2014 |
20140095476 | Database Comparison System and Method - A System and method include receiving a request for data at a programmed computer, the request identifying a field and an operation for an embedded database, translating the request via the programmed computer into multiple requests tailored to schemas of multiple different databases, estimating a cost to execute the request against each of the multiple different databases, and identifying the database that can execute the request with the least cost. | 04-03-2014 |
20140136516 | RELATIVE PERFORMANCE PREDICTION OF A REPLACEMENT DATABASE MANAGEMENT SYSTEM (DBMS) - Embodiments of the present invention provide a method, system and computer program product for pre-migration performance prediction of a database management system (DBMS). In an embodiment of the invention, a method for pre-migration performance prediction of a DBMS can include executing a calibration workload in a target DBMS to produce a conversion factor of cost of executing the calibration workload to temporal performance of executing the calibration workload. The method also can include subsequently submitting a sample workload from a database of a source DBMS for evaluation of cost of execution on an empty replica of the database in the target DBMS. Finally, the method can include predicting a temporal performance of the sample workload in the target DBMS as a product of the conversion factor and the cost of execution of the sample workload on the empty replica of the database in the target DBMS. | 05-15-2014 |
20140164357 | METHOD AND SYSTEM FOR OPTIMIZING QUERIES IN A MULTI-TENANT DATABASE ENVIRONMENT - In accordance with embodiments, there are provided mechanisms and methods for query optimization in a database system. These mechanisms and methods for query optimization in a database system can enable embodiments to optimize OR expression filters referencing different logical tables. The ability of embodiments to optimize OR expression filters referencing different logical tables can enable optimization that is dynamic and specific to the particular tenant for whom the query is run and improve the performance and efficiency of the database system in response to query requests. | 06-12-2014 |
20140172824 | PARALLEL LOCAL SEQUENCE ALIGNMENT - Various technologies described herein pertain to parallel local sequence alignment that aligns a query sequence with a database sequence. The database sequence is segmented into a plurality of stripes. A first processing unit can compute Smith-Waterman values for a first stripe of the database sequence across the query sequence based on a cost function that models biological similarity between sequences. Moreover, a second processing unit can compute Smith-Waterman values for a second stripe of the database sequence across the query sequence based on the cost function. Further, a subset of the Smith-Waterman values for the second stripe of the database sequence across the query sequence can be re-computed based on the cost function (e.g., by the first processing unit or the second processing unit). The subset of the Smith-Waterman values to be re-computed can be determined based on a query sequence length and the cost function. | 06-19-2014 |
20140181080 | COSTS OF OPERATIONS ACROSS COMPUTING SYSTEMS - Disclosed herein are techniques for measuring or assessing the costs of executing operations across a plurality of computing systems. The cost of transferring data across at least one arrangement of computing systems is determined. The cost of executing at least one arrangement of the operations is also determined. | 06-26-2014 |
20140280037 | Pushdown Of Sorting And Set Operations (Union, Intersection, Minus) To A Large Number Of Low-Power Cores In A Heterogeneous System - A system and method for performing a query operation on a pair of relations in a database system coupled to a heterogeneous system (HS) is disclosed. Assuming that that pair of relations is partitioned and already loaded into the HS, the database system receives a query on the pair of relations and based on the type of query operation computes the cost of performing the query operation on the database alone or the costs of performing the query operation with the assistance of the HS, each of the costs corresponding to a particular algorithm. If the costs indicate that the HS improves the performance of the query operation, then the HS computes portions of the operation, and returns the results back to the database system. If any parts of the relation are out of sync with the database system, the database system performs operations to maintain transactional consistency. | 09-18-2014 |
20140310261 | DATABASE INDEX PROFILE BASED WEIGHTS FOR COST COMPUTATION - Database tables can have different types of database indices defined for the database tables and different numbers of database indices. The efficiency of reading the indexes can vary with the different profiles of the indexes, which impacts the costs of access plans that use the indexes. Weights can be predefined to reflect the relative efficiencies of the different characteristics. Costs can be computed in accordance with a variety techniques (e.g., based on edge traversals). The weights can be predefined to reduce costs, increase costs, or a combination thereof. A database management application or associated application or program can also refine or revise these weights based on statistical data gathered about the operation of the database and/or heuristics that are developed based on observations/research. The corresponding weights can be adjusted accordingly. | 10-16-2014 |
20140372409 | Data Flow Graph Optimization Using Adaptive Rule Chaining - A query is received and an initial data flow graph comprising a plurality of nodes is generated for executing the query. The initial data flow graph is optimized using a model optimizer that accesses at least one of a plurality of patterns to identify a matching pattern and executes at least one optimization rule associated with a matching pattern. Execution of the query is then initiated using the optimized data flow graph. Related apparatus, systems, techniques and articles are also described. | 12-18-2014 |
20150019529 | SALIENT SAMPLING FOR QUERY SIZE ESTIMATION - Salient sampling for query size estimation includes identifying two or more columns in a database table that have corresponding columns in one or more other tables. One or more hash functions are applied to domains of each of the identified columns. A first hash function is applied to a domain of the first column and a second hash function to a domain of the second column. A subset of the rows in the database table is selected. The selecting includes selecting rows in the database table where results of the first hash function meet a first numeric threshold and selecting rows in the database table where results of the second hash function meet a second numeric threshold. A sample database table corresponding to the database table is created. The sample database table includes the selected subset of the rows in the database table. | 01-15-2015 |
20150019530 | QUERY LANGUAGE FOR UNSTRUCTED DATA - A system and methods are provided for interactive construction of data queries. One method comprises: generating a query based upon a plurality of user-identified data items, wherein the user-identified data items are data items representing desired results from a query, and wherein information related to the user-identified data items is included in a “given” clause of the query, assigning received input data to a hierarchical set of categories, presenting to a user a plurality of new query results, wherein the plurality of new query results are determined by scanning the received input data to find data elements in the same hierarchical categories as those in the “given” query clause and not in the same hierarchical categories as those of an “unlike” clause of the query, receiving from the user an indication as to whether each query result of the presented plurality of new query results is a desirable query result, adding query results indicated by the user as desirable to the “given” clause of the query, adding query results indicated by the user as undesirable to the “unlike” clause of the query, evaluating a metric indicative of the accuracy of the query, and responsive to a determination that the query achieves a predetermined threshold level of accuracy, storing the query. | 01-15-2015 |
20150149440 | SYSTEMS AND METHODS FOR FINDING OPTIMAL QUERY PLANS - Systems and methods for optimizing a query, and more particularly, systems and methods for finding optimal plans for graph queries by casting the task of finding the optimal plan as an integer programming (ILP) problem. A method for optimizing a query, comprises building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern, determining a plurality of flows of query variables between the plurality of components, and determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query. | 05-28-2015 |
20150149441 | Data Statistics in Data Management Systems - A system, computer-implemented method, and a computer-readable storage medium for determining estimations to statistical questions. Data statistics used in evaluating estimations to statistical questions are gathered from multiple sources in a database management system. A statistical question comprising, for example, cardinality estimations is received, wherein the question is posed by different database components, such as query optimizer, or execution engine. Estimation for the statistical question is computed, where the estimation is based on multiple data statistics and without using the data referred to in the question. | 05-28-2015 |
20150149442 | Optimal Operator Placement for Distributed Query Processing - Total global minimum costs can be determined for multiple sub-plans for completing a multi-operation database process to be performed in a distributed database management system that includes a plurality of nodes. The multiple sub-plans can include different distributions of node locations of a plurality of operators among the plurality of nodes. An optimal plan having a lowest total minimum global cost can be selected from the multiple sub-plans. | 05-28-2015 |
20150347510 | DISTRIBUTED EXECUTION OF EXPRESSIONS IN A QUERY - A computer-implemented method for executing a query specification can include evaluating the query specification by a first computing device to identify a candidate expression in the query specification to be executed by a second computing device hosting a source of data specified in the candidate expression. A cost estimate for executing the candidate expression at the first computing device is determined. Whether the cost estimate of executing the candidate expression at the first computing device is greater than a threshold is determined. The candidate expression is replaced with a native query function when the cost estimate of executing the candidate expression at the first computing device is greater than the threshold. The native query function can be executed at the second computing device. It can be determined whether a runtime context is necessary, and if necessary, a context parameter is injected into the native query function. | 12-03-2015 |
20150363467 | PERFORMING AN INDEX OPERATION IN A MAPREDUCE ENVIRONMENT - A method for performing an index operation in a MapReduce environment is provided. An execution plan is generated based on a conceptual job input by a user, wherein said conceptual job comprises an index operator, a mapper and a reducer and said execution plan is generated to minimize an execution cost based on characteristics of the index operator. The execution plan is converted to MapReduce jobs and the MapReduce jobs are provided to a runtime component for execution. | 12-17-2015 |
20160004755 | INFORMATION PROVIDING DEVICE, INFORMATION PROVIDING PROGRAM, INFORMATION PROVIDING SERVER, AND INFORMATION PROVIDING METHOD - An information providing device includes: a device management unit acquiring information of a connected device; a history database storing the information acquired by the device management unit as a history; a function estimation unit estimating a function to be presented to a user, based on the information of the connected device and the history stored in the history database; an availability determination unit determining availability of the function estimated by the function estimation unit; and an output unit outputting the function to be presented to the user, based on an indication of the function estimation unit. The function estimation unit confirms that the estimated function is a function to be presented to the user and causes the output unit to output the function when the availability determination unit determines that the estimated function is available. | 01-07-2016 |
20160034530 | SYSTEMS AND METHODS FOR A QUERY OPTIMIZATION ENGINE - Various embodiments of the present disclosure can include systems, methods, and non-transitory computer readable media configured to receive at least one database query to be executed. At least one computation graph corresponding to the at least one database query is generated. The computation graph is transformed to an optimized computation graph. The respective portions of the optimized computation graph are distributed to a plurality of distributed computing systems for execution. A result for the at least one database query is provided. | 02-04-2016 |
20160042034 | GROUPING AND PRICING LOW-COMPETITION CONTENT ITEM REQUESTS - Methods, systems, and apparatus include computer programs encoded on a computer-readable storage medium, including a method for providing content. A set of k requests is identified, each request being associated with a request for content. Candidate content items are identified for one or more of the requests in the set. Identified candidate content items are ranked based at least in part on their respective associated bids, expected value or long-term value. Top K candidate content items are determined based on the ranking. A price is assigned to each of the top K candidate content items based on the ranking and the associated bids. One or more of the top K candidate content items are provided responsive to the requests in the set. | 02-11-2016 |
20160117365 | QUERY HOTNESS AND SYSTEM HOTNESS METRICS - A query signature is computed for each of a plurality of database queries. The time duration of at least some of the queries is determined. The determined time durations are normalized. A system hotness metric is computed for query signatures other than a first query signature based on an average of normalized time durations for the query signatures other than the first query signature. A query hotness metric for the first query signature is computed based on division of an average of the normalized time durations for the first query signature by the system hotness metric. | 04-28-2016 |
20160154848 | DATABASE MANAGEMENT APPARATUS, DATABASE MANAGEMENT METHOD, AND STORAGE MEDIUM | 06-02-2016 |
20160154849 | SYSTEMS AND METHODS FOR FINDING OPTIMAL QUERY PLANS | 06-02-2016 |
20160162549 | Scalable Multi-Query Optimization for SPARQL - Multiquery optimization is performed in the context of RDF/SPARQL. Heuristic algorithms partition an input batch of queries into groups such that each group of queries can be optimized together. The optimization incorporates an efficient algorithm to discover the common sub-structures of multiple SPARQL queries and an effective cost model to compare candidate execution plans. No assumptions are made about the underlying SPARQL query engine. This provides portability across different RDF stores. | 06-09-2016 |
20160253394 | DATA HUB ARCHITECTURE TO PROVIDE ACTIONABLE DATA FROM REMOTE SENSOR FEEDS | 09-01-2016 |
20180025056 | SALIENT SAMPLING FOR QUERY SIZE ESTIMATION | 01-25-2018 |