公开(公告)号：US08185519B2

公开(公告)日：2012-05-22

申请号：US12404284

申请日：2009-03-14

Applicant: Surajit Chaudhuri ,  Vivek Narasayya ,  Ravishankar Ramamurthy

Inventor： Surajit Chaudhuri ,  Vivek Narasayya ,  Ravishankar Ramamurthy

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30463

Abstract: An exact cardinality query optimization system and method for optimizing a query having a plurality of expressions to obtain a cardinality-optimal query execution plan for the query. Embodiments of the system and method use various techniques to shorten the time necessary to obtain the cardinality-optimal query execution plan, which contains the query execution plan when all cardinalities are exact. Embodiments of the system and method include a covering queries technique that leverages query execution feedback to obtain an unordered subset of relevant expressions for the query, an early termination technique that bounds the cardinality to determine whether the processing can be terminate before each of the expressions are executed, and an expressions ordering technique that finds an ordering of expressions that yields the greatest reduction in time to obtain the cardinality-optimal query execution plan.

Abstract translation: 一种精确的基数查询优化系统和方法，用于优化具有多个表达式的查询，以获得查询的基本优化查询执行计划。 系统和方法的实施例使用各种技术来缩短获得基数优化查询执行计划所需的时间，当所有基数是精确的时，其包含查询执行计划。 该系统和方法的实施例包括利用查询执行反馈来获取查询的相关表达式的无序子集的覆盖查询技术，限制基数以确定处理是否可以在每个表达式之前终止的提前终止技术是 以及表达式排序技术，其找到产生最大时间缩短以获得基数优化查询执行计划的表达式的排序。

公开(公告)号：US20090254522A1

公开(公告)日：2009-10-08

申请号：US12098178

申请日：2008-04-04

Applicant: Surajit Chaudhuri ,  Vivek Narasayya ,  Ravishankar Ramamurthy

Inventor： Surajit Chaudhuri ,  Vivek Narasayya ,  Ravishankar Ramamurthy

IPC: G06F7/06 ,  G06Q10/00 ,  G06F17/30

CPC classification number: G06F17/30306 ,  G06Q30/0202

Abstract: A database server may be configured to compute distinct page counts of pages accessed to execute operands of respective queries. The queries may be executed against a table comprised of the pages and having an index managed by the database server. The distinct page counts may be obtained by counting, as a part of the executing of the queries, distinct pages accessed during the execution of the queries.

Abstract translation: 数据库服务器可以被配置为计算被访问的页面的不同页面计数以执行各个查询的操作数。 可以针对由该页组成的表并且具有由数据库服务器管理的索引来执行查询。 独立页面计数可以通过在执行查询期间计数访问的不同页面作为执行查询的一部分来获得。

公开(公告)号：US20090094191A1

公开(公告)日：2009-04-09

申请号：US11868957

申请日：2007-10-08

Applicant: Surajit Chaudhuri ,  Vivek R. Narasayya ,  Ravishankar Ramamurthy

Inventor： Surajit Chaudhuri ,  Vivek R. Narasayya ,  Ravishankar Ramamurthy

IPC: G06F17/30

CPC classification number: G06F16/24542

Abstract: A proactive monitoring mechanism for correcting the choice of access methods (available query plans) for a given query, based on execution feedback from the same query. The mechanism exploits bypassing predicate short-circuiting inside the database server's predicate evaluation module to obtain expression cardinalities. The mechanism can also modify a plan to obtain expression cardinalities. These techniques are used judiciously by the query optimizer and/or a database administrator (DBA) so that the execution overheads are within acceptable limits.

Abstract translation: 一种主动监视机制，用于根据同一查询的执行反馈来校正给定查询的访问方法（可用查询计划）的选择。 该机制利用绕过数据库服务器谓词评估模块内的谓词短路来获得表达式的基数。 该机制还可以修改计划以获得表达式的基数。 这些技术由查询优化器和/或数据库管理员（DBA）明智地使用，以便执行开销在可接受的限度内。

公开(公告)号：US07454407B2

公开(公告)日：2008-11-18

申请号：US11149968

申请日：2005-06-10

Applicant: Surajit Chaudhuri ,  Ravishankar Ramamurthy ,  Kaushik Shriraghav

Inventor： Surajit Chaudhuri ,  Ravishankar Ramamurthy ,  Kaushik Shriraghav

IPC: G06F7/00

CPC classification number: G06F17/30522 ,  G06F17/30474 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935

Abstract: Techniques for estimating the progress of database queries are described herein. In a first implementation, a respective lower-bound parameter is associated with each node in an operator tree that representing a given database query, and the progress of the database query at a given point is estimated based upon the lower-bound parameters. In a second implementation, the progress of the query is estimated by associating respective lower-bound and upper-bound parameters with each node in the operator tree. The progress of the query at the given point is then estimated based on the lower-bound and upper-bound parameters.

Abstract translation: 本文描述了用于估计数据库查询的进度的技术。 在第一实现中，相应的下限参数与表示给定数据库查询的运算符树中的每个节点相关联，并且基于下限参数来估计给定点处的数据库查询的进度。 在第二个实现中，通过将相应的下限和上限参数与运算符树中的每个节点相关联来估计查询的进度。 然后，基于下限和上限参数估计给定点处的查询进度。

公开(公告)号：US20080177694A1

公开(公告)日：2008-07-24

申请号：US11625153

申请日：2007-01-19

Applicant: Surajit Chaudhuri ,  Ravishankar Ramamurthy

Inventor： Surajit Chaudhuri ,  Ravishankar Ramamurthy

IPC: G06F7/00

CPC classification number: G06F17/30463

Abstract: Database systems use a plan cache to avoid the overheads (e.g., time, money) of query recompilation. Query plans can become invalidated by updates to the statistics on data or changes to the physical database design. Once a plan is invalidated, it can be repaired utilizing one or more of the disclosed embodiments. Incremental repair of query plans includes reusing parts of the current plan rather than discarding the plan entirely when it is invalidated. Repair to an existing query plan is attempted before resorting to full recompilation.

Abstract translation: 数据库系统使用计划缓存来避免查询重新编译的开销（如时间，金钱）。 通过对数据统计信息的更新或物理数据库设计更改，查询计划可能会失效。 一旦计划无效，可以利用所公开的一个或多个实施例来修复计划。 查询计划的增量修复包括重新使用当前计划的部分，而不是完全在无效的情况下丢弃计划。 在进行完全重新编译之前尝试修复现有的查询计划。

公开(公告)号：US10032131B2

公开(公告)日：2018-07-24

申请号：US13527601

申请日：2012-06-20

Applicant: Tao Cheng ,  Kris Ganjam ,  Kaushik Chakrabarti ,  Zhimin Chen ,  Vivek R. Narasayya ,  Surajit Chaudhuri

Inventor： Tao Cheng ,  Kris Ganjam ,  Kaushik Chakrabarti ,  Zhimin Chen ,  Vivek R. Narasayya ,  Surajit Chaudhuri

IPC: G06F13/00 ,  G06Q10/10

Abstract: A data service system is described herein which processes raw data assets from at least one network-accessible system (such as a search system), to produce processed data assets. Enterprise applications can then leverage the processed data assets to perform various environment-specific tasks. In one implementation, the data service system can generate any of: synonym resources for use by an enterprise application in providing synonyms for specified terms associated with entities; augmentation resources for use by an enterprise application in providing supplemental information for specified seed information; and spelling-correction resources for use by an enterprise application in providing spelling information for specified terms, and so on.

公开(公告)号：US08874592B2

公开(公告)日：2014-10-28

申请号：US11427287

申请日：2006-06-28

Applicant: Gary W. Flake ,  William H. Gates, III ,  Eric J. Horvitz ,  Joshua T. Goodman ,  Surajit Chaudhuri ,  Trenholme J. Griffin ,  Oliver Hurst-Hiller ,  Kenneth A. Moss

Inventor： Gary W. Flake ,  William H. Gates, III ,  Eric J. Horvitz ,  Joshua T. Goodman ,  Surajit Chaudhuri ,  Trenholme J. Griffin ,  Oliver Hurst-Hiller ,  Kenneth A. Moss

IPC: G06F17/30

CPC classification number: G06F17/30867 ,  G06F17/30061 ,  G06F17/30241 ,  G06F17/3087 ,  G06Q30/0261

Abstract: The subject disclosure pertains to web searches and more particularly toward influencing resultant content to increase relevancy. The resultant content can be influenced by reconfiguring a query and/or filtering results based on user location and/or context information (e.g., user characteristics/profile, prior interaction/usage temporal, current events, and third party state/context . . . ). Furthermore, the disclosure provides for query execution on at least a subset of designated web content, for example as specified by a user. Still further yet, a localized marketing system is disclosed that provides discount offers to users that match merchant criteria including proximity. A system for actively probing populations of users with different parameters and monitoring responses can be employed to collect data for identifying the best discounts and deadlines to offer to users to achieve desired results.

Abstract translation: 本发明涉及网络搜索，更具体地涉及影响结果内容以增加相关性。 可以通过基于用户位置和/或上下文信息（例如，用户特征/简档，先前交互/使用时间，当前事件和第三方状态/上下文）重新配置查询和/或过滤结果来影响所得到的内容。 ）。 此外，本公开提供了在指定的web内容的至少一个子集上的查询执行，例如由用户指定的。 此外，公开了一种本地化的营销系统，其向与用户相匹配的商品标准（包括接近度）提供折扣优惠。 可以采用用于主动探测具有不同参数和监测响应的用户群体的系统来收集数据，以识别提供给用户以获得期望结果的最佳折扣和期限。

公开(公告)号：US20130275436A1

公开(公告)日：2013-10-17

申请号：US13444717

申请日：2012-04-11

Applicant: Surajit Chaudhuri ,  Lev Novik ,  John C. Platt

Inventor： Surajit Chaudhuri ,  Lev Novik ,  John C. Platt

IPC: G06F17/30

CPC classification number: G06F16/319 ,  G06F16/245

Abstract: Various embodiments promote the discoverability of data that can be contained within a database. In one or more embodiments, data within a database is organized in a structure having a schema. The structure and data can be processed in a manner that renders one or more pseudo-documents each of which constitutes a sub-structure that can be indexed. Once produced and indexed, the pseudo-documents constitute a set of searchable objects each of which relationally points back to its associated structure within the database. Searches can now be performed against the pseudo-documents which, in turn, returns a set of search results. The set of search results can include multiple sub-sets of pseudo-documents, each sub-set of which is associated with a different structure.

Abstract translation: 各种实施例提高了可以包含在数据库内的数据的可发现性。 在一个或多个实施例中，数据库内的数据被组织在具有模式的结构中。 结构和数据可以以呈现一个或多个伪文档的方式进行处理，每个伪文档构成可被索引的子结构。 一旦生成和索引，伪文档构成一组可搜索的对象，每个可搜索对象在数据库中相互关联地指向其相关联的结构。 现在可以针对伪文档执行搜索，这些伪文档又返回一组搜索结果。 该组搜索结果可以包括多个伪文档子集，每个子​​集的每个子集与不同的结构相关联。

公开(公告)号：US20130091120A1

公开(公告)日：2013-04-11

申请号：US13253315

申请日：2011-10-05

Applicant: Kris Ganjam ,  Vivek Ravindranath Narasayya ,  Raghav Kaushik ,  Arvind Arasu ,  Surajit Chaudhuri

Inventor： Kris Ganjam ,  Vivek Ravindranath Narasayya ,  Raghav Kaushik ,  Arvind Arasu ,  Surajit Chaudhuri

IPC: G06F17/30

CPC classification number: G06F17/30303 ,  G06F17/30533

Abstract: A fuzzy joins system that is integrated in a database system generates fuzzy joins between records from two datasets. The fuzzy joins system includes a tokenizer to generate tokens for data records and a transformer to find transforms for the tokens. The fuzzy joins system invokes a signature generator, running within a runtime layer of the database system, to generate signatures for data records based on the tokens and their transforms. Subsequently, an equi-join operation joins the records from the two datasets with at least one equal signature. A similarity calculator, running within a runtime layer of the database system, computes a similarity measure using the token information of the joined records. If the similarity measure for any two records is above a threshold, the fuzzy joins system generates a fuzzy join between such two records.

Abstract translation: 集成在数据库系统中的模糊连接系统在两个数据集的记录之间生成模糊连接。 模糊连接系统包括一个用于生成数据记录令牌的标记器和一个用于为令牌找到变换的变压器。 模糊连接系统调用在数据库系统的运行时层内运行的签名生成器，以基于令牌及其转换生成用于数据记录的签名。 随后，等连接操作将来自两个数据集的记录与至少一个相等的签名相连。 在数据库系统的运行时层内运行的相似度计算器使用所连接的记录的令牌信息来计算相似性度量。 如果任何两个记录的相似性度量高于阈值，则模糊连接系统在这两个记录之间生成模糊连接。

公开(公告)号：US08332388B2

公开(公告)日：2012-12-11

申请号：US12818237

申请日：2010-06-18

Applicant: Surajit Chaudhuri ,  Leo Giakoumakis ,  Vivek Narasayya ,  Ravi Ramamurthy

Inventor： Surajit Chaudhuri ,  Leo Giakoumakis ,  Vivek Narasayya ,  Ravi Ramamurthy

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30463

Abstract: Technology is described for transformation rule profiling for a query optimizer. The method can include obtaining a database query configured to be optimized by the query optimizer of a database system. An optimized query plan for the database query can be found using a host set of transformation rules. One transformation rule can be removed and checked at a time. Each transformation rule can be checked to determine whether the transformation rule affects an optimal query plan output. A test query plan can be generated after each transformation rule has been removed. The query optimizer can determine whether the test query plan is different than the optimized query plan in the absence of the removed transformation rule. An equivalent set of transformation rules can be created that includes transformation rules where the test query plan generated from the equivalent set of transformation rules is equivalent to the optimized plan.

Abstract translation: 描述技术用于查询优化器的转换规则剖析。 该方法可以包括获得配置为由数据库系统的查询优化器优化的数据库查询。 可以使用主机转换规则集查找数据库查询的优化查询计划。 一次可以删除和检查一个转换规则。 可以检查每个变换规则以确定变换规则是否影响最优查询计划输出。 每个转换规则已被删除后，可以生成测试查询计划。 在没有删除的转换规则的情况下，查询优化器可以确定测试查询计划是否与优化的查询计划不同。 可以创建一组等效的转换规则，其中包括转换规则，其中从等效转换规则集生成的测试查询计划等同于优化的计划。