Patent application number | Description | Published |
20080288446 | Queries with soft time constraints - Systems, methodologies, media, and other embodiments associated with supporting queries with soft time constraints are described. One exemplary system embodiment includes logic for accepting a query having a soft time constraint. The example system may also include logic for rewriting the query having the soft time constraint into a query having a row limitation or a sample percentage limitation. In one example, the row limitation or sample percentage limitation are computed by repetitively comparing an estimated query execution time to the soft time constraint. | 11-20-2008 |
20080288473 | Queries with hard time constraints - Systems, methodologies, media, and other embodiments associated with supporting queries with hard time constraints are described. One exemplary system embodiment includes logic for accepting a query having a hard time constraint. The example system may also include logic for selectively rewriting the query having the hard time constraint into a query having a row limitation or a sample percentage limitation. In one example, the row limitation or sample percentage limitation are computed by repetitively comparing an estimated query execution time to the hard time constraint. The example system may also include logic for establishing a timer(s) associated with the rewritten query. | 11-20-2008 |
20090019005 | Materialized views with user-defined aggregates - Systems, methodologies, media, and other embodiments associated with supporting materialized views with user-defined aggregates are described. One example system includes logic for exposing a set of interface actions to support a user-defined aggregate in a materialized view associated with a base table. The materialized view may store both the user-defined aggregate and a user-defined aggregate context that facilitates logically connecting the user-defined aggregate to the base table. The example system may also include logic for supporting the user-defined aggregate. The support may be based on the set of interface actions. Example systems and methods may, therefore, facilitate incremental updating of the materialized view and/or rewriting a query to access the materialized view. | 01-15-2009 |
20090030874 | Techniques for Optimizing SQL Statements Using User-Defined Indexes with Auxiliary Properties - In one embodiment, a database server registers one or more functions included in a user-defined index that includes one or more auxiliary properties. The database server receives a query that specifies one or more parameters. A query optimizer generates a plurality of execution plans for evaluating the query. The query optimizer estimates a plurality of total costs respectively associated with the plurality of execution plans, where estimating a particular total cost associated with a particular execution plan comprises: invoking the one or more functions with one or more function arguments based on the one or more parameters; receiving one or more index costs that are associated with using the one or more auxiliary properties of the user-defined index to evaluate the query; and determining the particular total cost based on the one or more index costs. From the plurality of execution plans, the query optimizer selects an optimal execution plan that is associated with an optimal total cost of the plurality of total costs. | 01-29-2009 |
20090030883 | Techniques for Extending User-Defined Indexes with Auxiliary Properties - In one embodiment, a database server registers one or more functions included in a user-defined index that includes one or more auxiliary properties. The one or more functions are operable to generate index entries of the user-defined index for the one or more auxiliary properties. The one or more auxiliary properties are different than, and in addition to, a primary property of the user-defined index that provides for evaluating a query operator. The database server receives a first statement that defines the user-defined index, where the first statement includes one or more parameters that define the one or more auxiliary properties. The database server invokes the one or more functions in response to the first statement, where the one or more functions when invoked generate and store the index entries of the user-defined index according to the one or more parameters that define the one or more auxiliary properties. | 01-29-2009 |
20090177622 | Method and system for speeding up rebuild of user-defined indexes during partition maintenance operations in the database systems - A method, system, and computer program product provides improved performance for rebuild of user-defined indexes during partition maintenance operations (partition split, merge, and move). A method of maintaining a index of a partitioned database table comprises performing a partition maintenance operation on the partitioned database table wherein a plurality of rows of the partitioned database table are moved from one partition to another, storing mapping information for at least some of the plurality of moved rows, including an old mapping for each of the moved rows and a corresponding new mapping for each of the moved rows, and when rebuilding the index, replacing an old mapping in the index for each of the plurality of moved rows with the corresponding stored new mapping for each of the plurality of moved rows. | 07-09-2009 |
20100161680 | Data visualization with summary graphs - Systems, methods, and other embodiments associated with visualizing data using summary graphs are described. One example method includes constructing a summary graph for display. The summary graph represents the data as a summary node having a plurality of property edges connected to the summary node. The summary node represents the set of values for the node in the data. | 06-24-2010 |
20100281017 | Partition pruning via query rewrite - Systems, methods, and other embodiments associated with query pruning via query rewrite are described. One example method includes receiving a query on a partitioned table that will result in a first query plan that includes accessing a local domain index on each partition in the database. The query is rewritten to generate a second query that will result in a second query plan that includes accessing a global domain index instead of the local domain index on each partition in the database. | 11-04-2010 |
20110136686 | SEQUENCE MATCHING ALLOWING FOR ERRORS - Systems, methods, and other embodiments associated with sequence matching with no more than a number E errors are disclosed. A test fragment to be located within a target sequence with at most a number E errors is received. The test fragment is broken into E+1 test sub-fragments. If one test sub-fragment is located within the target sequence with no errors; a determination is made as to whether the other test sub-fragments are located within the target sequence adjacent to the one test sub-fragment with a total of at most E errors. If the other test sub-fragments are located within the target sequence adjacent the one test sub-fragment with at most E errors, a location of the test fragment within the target sequence is returned. | 06-09-2011 |
20140059043 | NORMALIZED RANKING OF SEMANTIC QUERY SEARCH RESULTS - A method, system, and computer program product for normalized ranking of semantic query search results. The method commences by forming a SPARQL query, the SPARQL query specifying a collection of named RDF graphs, then executing the SPARQL query to retrieve matched documents selected from the collection of named RDF graphs. Having retrieved the matches, the method calculates an absolute normalized score for the matched document. The calculation of an absolute normalized score for a second matched document allows for relevance ranking. To enhance the relationship of the computer-calculated score to the relevance (and not solely to occurrence counts) embodiments consider the number of distinct variables selected in the SPARQL query, and also consider the total number of bindings to the aforementioned variables. For comparing from among possibly different sized documents, a further normalization component is implemented by considering the total number of triples found in the document's underlying subgraph. | 02-27-2014 |