Query Cost Estimation Patents (Class 707/719)
-
Publication number: 20140006383Abstract: A system for evolutionary analytics supports three dimensions (analytical workflows, the users, and the data) by rewriting workflows to be more efficient by using answers materialized as part of previous workflow execution runs in the system.Type: ApplicationFiled: May 9, 2013Publication date: January 2, 2014Applicant: NEC LABORATORIES AMERICA, INC.Inventors: Vahit Hakan Hacigumus, Jagan Sankaranarayanan, Jeffrey LeFevre, Junichi Tatemura, Neoklis Polyzotis
-
Publication number: 20140006384Abstract: Systems and methods according to embodiments provide elasticity for complex event processing (CEP) systems. Embodiments may comprise at least the following three components: (1) incremental query optimization, (2) operator placement, and (3) cost explanation. Incremental query optimization allows avoiding simultaneous computation of identical results by performing operator-level query reuse and subsumption. Using automatic operator placement, a centralized CEP engine can be transformed into a distributed one by dynamically distributing and adjusting the execution according to unpredictable changes in data and query load. Cost explanation functionality can provide end users with near real-time insight into the monetary cost of the whole system, down to operator level granularity. Combination of these components allows a CEP system to be scaled up and down.Type: ApplicationFiled: June 28, 2012Publication date: January 2, 2014Applicant: SAP AGInventors: Zbigniew Jerzak, Thomas Heinze, Yuanzhen Ji
-
Publication number: 20130346390Abstract: 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.Type: ApplicationFiled: June 21, 2012Publication date: December 26, 2013Applicant: SAP AGInventors: Zbigniew Jerzak, Thomas Heinze, Yuanzhen Ji
-
Patent number: 8612424Abstract: 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.Type: GrantFiled: February 14, 2012Date of Patent: December 17, 2013Assignee: Yahoo! Inc.Inventors: Ali Dasdan, Santanu Kolay, Chris Drome
-
Patent number: 8606790Abstract: More efficient querying of a multi-tenant database using dynamic tuning of database indices. A layer of meta-data associates data items with tenants, e.g., via tags, and the meta-data is used to optimize searches by channeling processing resources during a query to only those pieces of data bearing the relevant tenant's unique tag.Type: GrantFiled: September 14, 2012Date of Patent: December 10, 2013Assignee: salesforce.com, inc.Inventors: Craig Weissman, Dave Moellenhoff, Simon Wong, Paul Nakada
-
Patent number: 8595215Abstract: A plan combining unit combines a plan including all predicate nodes by increasing a size of a subplan stepwise while selecting the subplan with a low cost using an analysis graph generated by a query analyzing unit and plan combination constraint data extracted by a constraint extracting unit. The analysis graph is the one expressed by a graph including a variable node corresponding to a variable to which an object on a database is bound and a predicate node indicating a condition between the variable nodes. The plan combination constraint data represents a constraint to a plan and a subplan extracted from the analysis graph as a condition between the nodes.Type: GrantFiled: March 13, 2008Date of Patent: November 26, 2013Assignee: Kabushiki Kaisha ToshibaInventor: Masakazu Hattori
-
Patent number: 8595217Abstract: Techniques for using database metric results are provided. Structure Query Language (SQL) statements are parsed for multiple metric calculations. Each metric calculation is dynamically processed against a database to obtain combined results. The combined results are fed to remaining portions of the SQL statements as a source for or a driver to the remaining portions of the SQL statements.Type: GrantFiled: January 9, 2009Date of Patent: November 26, 2013Assignee: Teradata US, Inc.Inventors: Paul H. Phibbs, Marianne Ruegsegger, Linette Draper
-
Publication number: 20130311446Abstract: 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.Type: ApplicationFiled: May 6, 2013Publication date: November 21, 2013Applicant: International Business Machines CorporationInventors: Austin Clifford, Konrad Emanowicz, Enda McCallig
-
Publication number: 20130297586Abstract: 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.Type: ApplicationFiled: May 7, 2012Publication date: November 7, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Sweta Singh, Renu P. Sumam
-
Publication number: 20130297587Abstract: 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.Type: ApplicationFiled: May 10, 2013Publication date: November 7, 2013Applicant: International Business Machines CorporationInventors: Sweta Singh, Renu P. Sumam
-
Patent number: 8577871Abstract: Methods, systems, and computer program products for monitoring database queries and executions is disclosed. The query syntax may conform to the structured query language (SQL). The approach supports various performance statistics to be monitored at each step of the query statement's execution plan and for each row processed in order to meet requirements of a near real-time query monitoring solution. Such statistics include timing information plus some miscellaneous statistics like the number of rows processed, the amount of memory used, the amount of data spilled to disk, etc.Type: GrantFiled: March 31, 2008Date of Patent: November 5, 2013Assignee: Oracle International CorporationInventors: Benoit Dageville, Venkateshwaran Venkataramani
-
Publication number: 20130290298Abstract: 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.Type: ApplicationFiled: April 26, 2012Publication date: October 31, 2013Applicant: SAP AGInventors: Christoph Weyerhaeuser, Tobias Mindnich, Daniel Baeumges, Gerrit Simon Kazmaier
-
Patent number: 8566308Abstract: 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.Type: GrantFiled: January 26, 2011Date of Patent: October 22, 2013Assignee: International Business Machines CorporationInventors: John G. Musial, Abhinay R. Nagpal, Sandeep R. Patil, Yan W. Stein
-
Patent number: 8566307Abstract: 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.Type: GrantFiled: April 30, 2010Date of Patent: October 22, 2013Assignee: International Business Machines CorporationInventors: James L. Denton, Brian R. Muras
-
Patent number: 8560525Abstract: 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.Type: GrantFiled: August 23, 2011Date of Patent: October 15, 2013Assignee: EMC CorporationInventors: Marc Brette, Frédéric Ciminera, Bruno Marquié
-
Patent number: 8560563Abstract: A correlation-based service mediator consists of Semantic Query Generator, Service Query Manager, Service Invocation Flow Generator, Service Invocation Manager, Expression Interpreter and Service Invocation Result Cache. The Semantic Query Generator handles service requests. It generates Semantic Query statements. Basically, the generator converts service request to Semantic Query based on input/output parameters in the service request. The Service Query Manager interfaces with an Ontology Engine, in order to execute the semantic queries. It will pass the query results to Service Invocation Flow Generator. The Service Invocation Flow Generator creates service invocation flow definition based on query results passed from Service Query Manager. The Service Invocation Manager executes the flow definitions. It also manages a service invocation result cache, so that invocation results can be saved and reused for later service request.Type: GrantFiled: July 9, 2008Date of Patent: October 15, 2013Assignee: International Business Machines CorporationInventors: Trieu C. Chieu, Hui Lei, Guo Tong Xie, Liangzhao Zeng
-
Patent number: 8554762Abstract: Generally described, the present disclosure is directed to an eventually consistent replicated data store that uses, for its underlying storage, a computer software library that provides a high-performance embedded database for data. The replicated data store employs a plurality of hosts interconnected to one another, allowing for writes to any host and full awareness of membership across all hosts. With the data replication framework disclosed herein, various modes are allowed to be built up on top of the core system.Type: GrantFiled: December 28, 2010Date of Patent: October 8, 2013Assignee: Amazon Technologies, Inc.Inventors: Brian S. O'Neill, Jason Shijia Long, Archit Shivaprakash, Olga I. Kuznetsova
-
Patent number: 8548987Abstract: A system and method for applying a first filter and a second filter, such as a recommendation and a constraint filter, to a plurality of items, including determining a cost of applying the first filter and the second filter to the plurality of items, and determining an order of applying the first and second filters based on the cost of applying the first and second filters.Type: GrantFiled: October 31, 2008Date of Patent: October 1, 2013Assignee: Thalveg Data Flow LLCInventors: John Rauser, Valerie Guralnik
-
Patent number: 8533183Abstract: 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.Type: GrantFiled: March 10, 2009Date of Patent: September 10, 2013Assignee: Hewlett-Packard Development Company, L.P.Inventor: Mark K. Hokanson
-
Patent number: 8533181Abstract: 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.Type: GrantFiled: April 29, 2009Date of Patent: September 10, 2013Assignee: Oracle International CorporationInventors: Ying Hu, Seema Sundara, Siva Ravada
-
Patent number: 8527500Abstract: A document preprocessor preprocess a document to enhance the statistical features of the document. The system preprocesses the document by matching a prefix and a trailing context in the document with one or more matching prefixes in a transformation database, where the prefix is a first string of one or more tokens in the first document and the trailing context is a second string of one or more tokens in the first document that trail the prefix. Alternatively, the system preprocesses the document by computing cyclic permutations of the document, sorting these permutations and taking the last token from each of the sorted permutations.Type: GrantFiled: February 27, 2009Date of Patent: September 3, 2013Assignee: Red Hat, Inc.Inventor: James Paul Schneider
-
Publication number: 20130226903Abstract: 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.Type: ApplicationFiled: December 11, 2012Publication date: August 29, 2013Applicant: NEC Laboratories America, Inc.Inventor: NEC Laboratories America, Inc.
-
Patent number: 8521748Abstract: In a method for managing metadata in a relational database system using a processor, the metadata is created in a form of rough values corresponding to collections of values, wherein each rough value represents summarized information about values, the values are elements of the corresponding collection of values, and each rough value is substantially smaller than the corresponding collection of values. 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. A match granule is formed, and for each structure in the structure dictionary, a structure granule is formed.Type: GrantFiled: June 14, 2011Date of Patent: August 27, 2013Assignee: Infobright Inc.Inventors: Dominik Slezak, Graham Toppin, Marcin Kowalski, Arkadiusz Wojna
-
Patent number: 8516488Abstract: A database system includes an optimizer to generate resource estimates regarding execution of a request in the database system, and a regulator to monitor progress of execution of the request (and in some examples every step of the request), and to adjust the resource estimates based on the monitored progress. The regulator also adjusts a priority setting of the request according to the adjusted resource estimates.Type: GrantFiled: November 9, 2010Date of Patent: August 20, 2013Assignee: Teradata US, Inc.Inventors: Douglas P. Brown, Anita Richards
-
Patent number: 8515949Abstract: Methods and systems are provided for a transparent application of multiple queries across multiple data sources. The system may receive a request to search for data. The system may perform a search of a logical table based on a criterion to identify a plurality of rows in the logical table. The system may generate fetch levels that include a first and second plurality of tuples based on the plurality of rows. Each fetch level may include a plurality of tuples that identify servers and physical tables that may store the data. The system may further query at least two data sources for the data based on the first plurality of tuples and communicate the data.Type: GrantFiled: May 3, 2012Date of Patent: August 20, 2013Assignee: eBay Inc.Inventors: Greg Seitz, Christopher J. Kasten
-
Patent number: 8510291Abstract: A system and/or method are implemented to process queries to a database. In particular, the processing of queries to the database is enhanced by enhancing the determination of join orders of tables implicated in queries. Join orders between relatively large numbers of tables are determined by dividing the set of tables to be ordered into a plurality of subsets of tables, and ordering the individual subsets of tables.Type: GrantFiled: July 11, 2012Date of Patent: August 13, 2013Assignee: Paraccel, Inc.Inventors: Richard L. Cole, Yijou Chen, William J. McKenna, Sergei Perfilov, Aman Sinha, Eugene Szedenits, Jr.
-
Patent number: 8504556Abstract: Various embodiments of a system and method for diminishing workload imbalance across multiple database systems are described. Embodiments may include a resource balancer configured to, for each of a multiple database systems hosting database resources assigned to different user entities, generate a system usage score for that database system based on database usage scores of respective database resources hosted by that database system. Each usage score of a given database resource may indicate a quantity of work performed by the respective database system to process one or more requests directed to that database resource. The resource balancer may also be configured to generate one or more instructions to move a database resource from a first database system having a first system usage score to a second database system having a smaller system usage score in order to diminish an imbalance of workload across the database systems.Type: GrantFiled: March 8, 2010Date of Patent: August 6, 2013Assignee: Amazon Technologies, Inc.Inventors: Charles E. Rice, Adam D. Morley, Michael D. Leonhard, Glenn A. Dierkes
-
Patent number: 8504557Abstract: In accordance with embodiments, there are provided mechanisms and methods for querying data relationships over a network. These mechanisms and methods for querying data relationships over a network can enable embodiments to provide the capability to query for more than a single entity at a time. The ability of embodiments to query for more than a single entity at a time can enable improved network throughput, faster response time and more efficient utilization of resources.Type: GrantFiled: April 21, 2010Date of Patent: August 6, 2013Assignee: salesforce.com, inc.Inventors: Simon Z. Fell, Benji H. Jasik, Sven E. Mawson, Craig Weissman
-
Patent number: 8489581Abstract: A method, system, and article for improving performance of a Boolean combination of at least two filters to a data stream. Stream processing is applied to an expression having two or more logical operators. As the data stream is processed, efficiency of the operators in the expression is evaluated. A sort algorithm is dynamically invoked to ensure that a more efficient operator precedes processing of a less efficient operator.Type: GrantFiled: July 28, 2010Date of Patent: July 16, 2013Assignee: International Business Machines CorporationInventors: Shun Jiang, Kenneth M. Johns, James J. Rhodes, Hovey Raymond Strong, Jr.
-
Publication number: 20130179434Abstract: 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.Type: ApplicationFiled: April 26, 2012Publication date: July 11, 2013Applicant: Apple Inc.Inventors: Mehul K. Sanghavi, Michael Froimowitz Greenzeiger
-
Publication number: 20130173592Abstract: 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.Type: ApplicationFiled: March 12, 2012Publication date: July 4, 2013Inventors: Heng Yuan, Mark Sirek
-
Patent number: 8478875Abstract: One embodiment of the present method and apparatus adaptive in-operator load shedding includes receiving at least two data streams (each comprising a plurality of tuples, or data items) into respective sliding windows of memory. A throttling fraction is then calculated based on input rates associated with the data streams and on currently available processing resources. Tuples are then selected for processing from the data streams in accordance with the throttling fraction, where the selected tuples represent a subset of all tuples contained within the sliding window.Type: GrantFiled: June 30, 2008Date of Patent: July 2, 2013Assignee: International Business Machines CorporationInventors: Bugra Gedik, Kun-Lung Wu, Philip S. Yu
-
Publication number: 20130151506Abstract: 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.Type: ApplicationFiled: December 8, 2011Publication date: June 13, 2013Applicant: TECHNOCOM CORPORATIONInventors: Khaled I. Dessouky, Mario Proietti, Brenda C. Schafer
-
Patent number: 8452756Abstract: A database query optimizer includes an access plan storage mechanism that stores execution detail corresponding to a query statement in an access plan cache. By storing execution detail in the access plan cache along with the query statement, the execution detail is available when needed to debug database problems, even after a problem occurs. The execution detail stored in the access plan cache may be mined and analyzed after-the-fact, producing a very powerful tool for debugging database problems. Snapshots of the execution detail may also be created by a user. In addition, the user may setup autonomic snapshots and comparisons so that a user may be alerted from a degradation in database performance between two snapshots.Type: GrantFiled: November 9, 2006Date of Patent: May 28, 2013Assignee: International Business Machines CorporationInventors: Mark John Anderson, Robert Joseph Bestgen, Daniel E. Beuch, Curtis Neal Boger, James Michael Flanagan, Scott Forstie, Shantan Kethireddy, Thomas Owen McKinley, Michael Donald Pfeifer
-
Patent number: 8452755Abstract: Database query analysis technology, in which an input query is received that relates to multiple attribute classes of data records. An index that is descriptive of the data records in data storage is accessed and relative positions in the accessed index for the multiple attribute classes are identified. The accessed index is processed based on more than one of the multiple attribute classes and the identified relative positions, and the processed index is used to identify groups of data records that are included in the data records in the data storage and that share common values for the multiple attribute classes in the input query. Metrics corresponding to the data records included in each of the identified groups of data records are accessed, computations are performed on the accessed metrics, and a report is generated that reflects results of the computations.Type: GrantFiled: May 11, 2010Date of Patent: May 28, 2013Assignee: MicroStrategy IncorporatedInventors: Alex Ye, Benjamin Z. Li
-
Publication number: 20130132371Abstract: 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.Type: ApplicationFiled: November 23, 2011Publication date: May 23, 2013Applicant: INFOSYS TECHNOLOGIES LIMITEDInventors: S/shri. V. Bharath, Satyanarayana R. Valluri, Kamalakar Karlapalem, Radha Krishna Pisipati
-
Publication number: 20130124502Abstract: 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.Type: ApplicationFiled: November 16, 2011Publication date: May 16, 2013Applicant: QUOVA, INC.Inventor: Armand Erik Prieditis
-
Patent number: 8442971Abstract: In an embodiment, a first driver source specified by a first execution plan that implements a query is designated, and a second driver source specified by a second execution plan that implements the query is designated. A portion of the first execution plan and a portion of the second execution plan are executed. If a unique identifier of a first row returned by the executing the portion of the first execution plan does not match all unique identifiers of all rows from the second driver source that were saved to a result set by the executing the portion of the second execution plan, then the first row returned by the executing the portion of the first execution plan is added to the result set and the unique identifier of the first row that was returned by the executing the portion of the first execution plan is added to a unique identifier log.Type: GrantFiled: December 21, 2010Date of Patent: May 14, 2013Assignee: International Business Machines CorporationInventors: Robert J. Bestgen, Robert V. Downer, Brian R. Muras
-
Publication number: 20130117257Abstract: 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.Type: ApplicationFiled: November 3, 2011Publication date: May 9, 2013Applicant: MICROSOFT CORPORATIONInventors: Henricus Johannes Maria Meijer, Michael Isard, Alexander Sasha Stojanovic, Carl Carter-Schwendler, Stephen Harris Toub
-
Patent number: 8433701Abstract: An embodiment of the system and method for optimizing pattern query searches on a graph database uses a pattern query optimizer to optimize execution of the search plan for any sequence of SQL expressions by separating or breaking a pattern query into multiple subpattern queries before converting the subpattern queries into SQL expressions. An embodiment of the pattern query optimizer algorithmically, without intervention by an analyst, decomposes any pattern query into a set of subpattern queries by first identifying branches and cycles within a pattern query and then decomposing each identified branch and cycle into equivalent straight line paths, i.e., straight line nodes joined by edges. Cardinality may be used to improve the performance of pattern searches.Type: GrantFiled: November 19, 2010Date of Patent: April 30, 2013Assignee: 21CT, Inc.Inventors: Daniel Sargeant, Morgan Hollinger
-
Patent number: 8429151Abstract: Systems, methods and articles of manufacture for determining at least one algorithm from a pool of algorithms to optimize a query. An embodiment includes building optimization blocks for the subplan, determining the complexity of the subplan based on the optimization blocks and selecting an algorithm from a pool of search space generation algorithms based on complexity of the subplan and characteristics of the selected algorithm, and optimizing the subplan with the selected algorithm.Type: GrantFiled: November 22, 2010Date of Patent: April 23, 2013Assignee: iAnywhere Solutions, Inc.Inventors: Anisoara Nica, Ian Lorne Charlesworth
-
Patent number: 8417692Abstract: 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.Type: GrantFiled: May 18, 2011Date of Patent: April 9, 2013Assignee: Google Inc.Inventors: Massimiliano Ciaramita, Amac Herdagdelen, Daniel Mahler
-
Patent number: 8402016Abstract: A method of performing a multi-way join of a plurality of database relations includes executing a plurality of pipelined two-way joins with the database relations. Each two-way join has two sequential phases. In the first phase, missing attributes of the input relations that are required to evaluate a joining criterion specific to said two-way join are fetched from a non-volatile memory device, and the input relations are joined according to the criterion. In the second phase, any additional missing attributes of the input relations are fetched from the non-volatile memory device as assigned by an optimization process executed prior to commencing the multi-way join.Type: GrantFiled: May 27, 2009Date of Patent: March 19, 2013Assignee: Hewlett-Packard Development Company, L.P.Inventors: Dimitrios Tsirogiannis, Stavros Harizopoulos, Mehul A. Shah, Janet L. Wiener, Goetz Graefe
-
Publication number: 20130066851Abstract: 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.Type: ApplicationFiled: September 10, 2012Publication date: March 14, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: THOMAS B. ALLEN, BARRY M. CACERES
-
Patent number: 8396862Abstract: A method of searching a multilevel partitioned database includes receiving a query data from the multilevel partitioned database. At least for one level partitions are dynamically included. For some levels, partitions may also be statically included for execution of the query. The query is the executed over the partitions that are both dynamically and statically included. In one example, the cost of joining two tables in a multilevel partitioned database includes determining level partitions that can be statically included, estimating level partitions that will be dynamically considered for the join, and determining a cost as a function of the estimated statically included level partitions and estimated dynamically included level partitions.Type: GrantFiled: July 30, 2007Date of Patent: March 12, 2013Assignee: Teradata US, Inc.Inventors: Paul Sinclair, Xiaorong Luo, Mark Sirek
-
Patent number: 8397025Abstract: A method and apparatus for determining a cache line in an N-way set associative cache are disclosed. In one example embodiment, a key associated with a cache line is obtained. A main hash is generated using a main hash function on the key. An auxiliary hash is generated using an auxiliary hash function on the key. A bucket in a main hash table residing in an external memory is determined using the main hash. An entry in a bucket in an auxiliary hash table residing in an internal memory is determined using the determined bucket and the auxiliary hash. The cache line in the main hash table is determined using the determined entry in the auxiliary hash table.Type: GrantFiled: December 30, 2010Date of Patent: March 12, 2013Assignee: LSI CorporationInventors: Maghawan Punde, Deepak Lala
-
Patent number: 8392400Abstract: Method and apparatus for stress management in a searchable data service. The searchable data service may provide a searchable index to a backend data store, and an interface to build and query the searchable index, that enables client applications to search for and retrieve locators for stored entities in the backend data store. Embodiments of the searchable data service may implement a distributed stress management mechanism that may provide functionality including, but not limited to, the automated monitoring of critical resources, analysis of resource usage, and decisions on and performance of actions to keep resource usage within comfort zones. In one embodiment, in response to usage of a particular resource being detected as out of the comfort zone on a node, an action may be performed to transfer at least part of the resource usage for the local resource to another node that provides a similar resource.Type: GrantFiled: March 29, 2006Date of Patent: March 5, 2013Assignee: Amazon Technologies, Inc.Inventors: Patrick W. Ransil, Aleksey V. Martynov, James S. Larson, James R. Collette, Robert Wai-Chi Chu, Partha Saha
-
Patent number: 8392405Abstract: One embodiment of the present invention provides a system that facilitates performing a cost-based optimization of authorization checks in a database system. During operation, the system receives a query at the database system. Next, the system estimates a cost for executing the query, which involves estimating a cost for evaluating authorization checks, which involve functional evaluations of access rights for data accessed by the query. The system then rewrites the query to include evaluating authorization checks within the query. The system also estimates a cost for executing the rewritten query. Next, the system determines if executing the rewritten query has a lower cost than executing the query and performing the authorization checks. If so, the system executes the rewritten query. However, if not, the system executes the query.Type: GrantFiled: June 23, 2008Date of Patent: March 5, 2013Assignee: Oracle International CorporationInventors: Sam Idicula, Mohammed Irfan Rafiq, Nipun Agarwal
-
Patent number: 8392406Abstract: A table-level histogram is maintained incrementally without requiring rescanning of the entire table when new data values are added to the table. A table has multiple partitions of data values. A histogram for data values of the partitions is generated. When a new partition of data values is added to the table, a histogram for only the new partition is generated. To generate a histogram for the entire table, the histograms for the previously generated and newly added partitions are used without needing to refer to the underlying data. A similar approach is applicable when modifying data values in a partition.Type: GrantFiled: August 13, 2008Date of Patent: March 5, 2013Assignee: Oracle International CorporationInventors: Fatih Emekci, Sunil P. Chakkappen, Uri Shaft
-
Patent number: 8392403Abstract: Data and computation may be unified (i.e., integrated) in a data center using a single query interface. Users may interact with the data center via a query interface to provide a query (i.e., a computation) to the data center. The results of the query may be referred to as derived datasets and may be managed by a cache server. In an implementation, a derived dataset is uniquely referenced by the query that computes it. Shared common computations are computed only once and may be reused by other computations. The result of a query may be computed (if not previously cached) and returned to the user. Infrequently used derived datasets may be garbage collected (e.g., deleted or otherwise removed from storage) by a garbage collector. This integration of data and computation provides efficient resource management for data center.Type: GrantFiled: September 18, 2009Date of Patent: March 5, 2013Assignee: Microsoft CorporationInventors: Yuan Yu, Pradeep Kumar Gunda, Li Zhuang