公开(公告)号：US20080183764A1

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

申请号：US11669807

申请日：2007-01-31

Applicant: Nicolas Bruno ,  Surajit Chaudhuri

Inventor： Nicolas Bruno ,  Surajit Chaudhuri

IPC: G06F17/30

CPC classification number: G06F16/2453 ,  G06F16/2272

Abstract: Online physical design tuning is constantly monitoring database indexes and can effectively react to changes in a workload by modifying the physical design as needed. Algorithms can be utilized that take into account various criteria including storage constraints, update statements, and the cost of temporarily creating physical structures.

Abstract translation: 在线物理设计调整是不断监视数据库索引，并可以根据需要修改物理设计，对工作负载的变化做出有效的反应。 可以利用考虑到各种标准的算法，包括存储约束，更新语句和临时创建物理结构的成本。

公开(公告)号：US07383262B2

公开(公告)日：2008-06-03

申请号：US10879450

申请日：2004-06-29

Applicant: Gautam Das ,  Surajit Chaudhuri ,  Vagelis Hristidis ,  Gerhard Weikum

Inventor： Gautam Das ,  Surajit Chaudhuri ,  Vagelis Hristidis ,  Gerhard Weikum

IPC: G06F7/00

CPC classification number: G06Q30/0603 ,  G06Q50/16 ,  Y10S707/99937

Abstract: A system and methods rank results of database queries. An automated approach for ranking database query results is disclosed that leverages data and workload statistics and associations. Ranking functions are based upon the principles of probabilistic models from Information Retrieval that are adapted for structured data. The ranking functions are encoded into an intermediate knowledge representation layer. The system is generic, as the ranking functions can be further customized for different applications. Benefits of the disclosed system and methods include the use of adapted probabilistic information retrieval (PIR) techniques that leverage relational/structured data, such as columns, to provide natural groupings of data values. This permits the inference and use of pair-wise associations between data values across columns, which are usually not possible with text data.

Abstract translation: 系统和方法对数据库查询的结果进行排序。 披露了一种用于排名数据库查询结果的自动化方法，它利用数据和工作量统计信息和关联。 排名函数基于适用于结构化数据的信息检索的概率模型的原理。 排序函数被编码为中间知识表示层。 该系统是通用的，因为排序功能可以针对不同的应用进一步定制。 所公开的系统和方法的优点包括使用适应的概率信息检索（PIR）技术来利用诸如列的关系/结构化数据来提供数据值的自然分组。 这允许推断和使用跨列之间的数据值之间的成对关联，这通常不可能与文本数据。

公开(公告)号：US20080005091A1

公开(公告)日：2008-01-03

申请号：US11427303

申请日：2006-06-28

Applicant: Stephen Lawler ,  Eric J. Horvitz ,  Joshua T. Goodman ,  Anoop Gupta ,  Christopher A. Meek ,  Eric D. Brill ,  Gary W. Flake ,  Ramez Naam ,  Surajit Chaudhuri ,  Oliver Hurst-Hiller

Inventor： Stephen Lawler ,  Eric J. Horvitz ,  Joshua T. Goodman ,  Anoop Gupta ,  Christopher A. Meek ,  Eric D. Brill ,  Gary W. Flake ,  Ramez Naam ,  Surajit Chaudhuri ,  Oliver Hurst-Hiller

IPC: G06F17/30

CPC classification number: G06F17/30864 ,  G06F17/30592 ,  Y10S707/913

Abstract: A system that can analyze a multi-dimensional input thereafter establishing a search query based upon extracted features from the input. In a particular example, an image can be used as an input to a search mechanism. Pattern recognition and image analysis can be applied to the image thereafter establishing a search query that corresponds to features extracted from the image input. The system can also facilitate indexing multi-dimensional searchable items thereby making them available to be retrieved as results to a search query. More particularly, the system can employ text analysis, pattern and/or speech recognition mechanisms to extract features from searchable items. These extracted features can be employed to index the searchable items.

Abstract translation: 一种能够基于从输入中提取的特征来建立搜索查询的分析多维输入的系统。 在特定示例中，图像可以用作搜索机制的输入。 模式识别和图像分析可以应用于图像，然后建立对应于从图像输入提取的特征的搜索查询。 该系统还可以方便索引多维可搜索项目，从而使得它们可以作为结果被检索到搜索查询。 更具体地，系统可以采用文本分析，模式和/或语音识别机制来从可搜索项目中提取特征。 这些提取的特征可用于索引可搜索的项目。

公开(公告)号：US07293036B2

公开(公告)日：2007-11-06

申请号：US11008335

申请日：2004-12-08

Applicant: Surajit Chaudhuri ,  Ashish Kumar Gupta ,  Vivek Narasayya

Inventor： Surajit Chaudhuri ,  Ashish Kumar Gupta ,  Vivek Narasayya

IPC: G06F17/30

CPC classification number: G06F17/30536 ,  G06F17/30306 ,  G06F17/30312 ,  Y10S706/917 ,  Y10S707/99932 ,  Y10S707/99942 ,  Y10S707/99945

Abstract: Relational database applications such as index selection, histogram tuning, approximate query processing, and statistics selection have recognized the importance of leveraging workloads. Often these applications are presented with large workloads, i.e., a set of SQL DML statements, as input. A key factor affecting the scalability of such applications is the size of the workload. The invention concerns workload compression which helps improve the scalability of such applications. The exemplary embodiment is broadly applicable to a variety of workload-driven applications, while allowing for incorporation of application specific knowledge. The process is described in detail in the context of two workload-driven applications: index selection and approximate query processing.

Abstract translation: 诸如索引选择，直方图调整，近似查询处理和统计选择等关系数据库应用程序已经认识到利用工作负载的重要性。 通常，这些应用程序具有大的工作负载，即一组SQL DML语句作为输入。 影响这些应用程序可扩展性的关键因素是工作负载的大小。 本发明涉及工作负载压缩，这有助于提高这种应用的可扩展性。 该示例性实施例广泛地适用于各种工作负载驱动的应用，同时允许结合应用特定的知识。 该过程在两个工作负载驱动的应用程序的上下文中进行了详细描述：索引选择和近似查询处理。

公开(公告)号：US07281007B2

公开(公告)日：2007-10-09

申请号：US10935803

申请日：2004-09-08

Applicant: Surajit Chaudhuri ,  Vivek Narasayya ,  Gantam Das

Inventor： Surajit Chaudhuri ,  Vivek Narasayya ,  Gantam Das

IPC: G06F17/30

CPC classification number: G06F17/30536 ,  G06F17/30489 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99936 ,  Y10S707/99937 ,  Y10S707/99943 ,  Y10S707/99945

Abstract: A method for estimating the result of a query on a database having data records arranged in tables. The database has an expected workload that includes a set of queries that can be executed on the database. An expected workload is derived including a set of queries that can be executed on the database. A sample is constructed by selecting data records for inclusion in the sample in a manner that minimizes an estimation error when the data records are acted upon by a query in the expected workload to provide an expected workload to provide an expected result. The query accesses the sample and is executed on the sample, returning an estimated query result. The expected workload can be constructed by specifying a degree of overlap between records selected by queries in the given workload and records selected by queries in the expected workload.

Abstract translation: 一种用于估计具有以表格排列的数据记录的数据库的查询结果的方法。 数据库具有预期的工作负载，其中包括可在数据库上执行的一组查询。 导出预期的工作负载，包括可以在数据库上执行的一组查询。 通过在以下方式选择数据记录来构建样本：将数据记录在期望的工作负载中由查询作用在最小化估计误差的方式，以提供期望的工作量以提供期望的结果，来选择包含在样本中的数据记录。 查询访问样本并在样本上执行，返回估计的查询结果。 可以通过指定给定工作负载中的查询选择的记录与预期工作负载中的查询所选择的记录之间的重叠程度来构建预期的工作负载。

公开(公告)号：US20070198439A1

公开(公告)日：2007-08-23

申请号：US11357665

申请日：2006-02-17

Applicant: Kaushik Shriraghav ,  Surajit Chaudhuri ,  Nilesh Dalvi

Inventor： Kaushik Shriraghav ,  Surajit Chaudhuri ,  Nilesh Dalvi

IPC: G06F17/00

CPC classification number: G06F17/30469 ,  G06Q30/0283

Abstract: The claimed subject matter relates to incorporating a skyline operator within a relational database engine, and more particularly to a database engine that utilizes novel techniques to determine the lowest cost of generating the skyline produced by the skyline operator. The database engine receives queries and associated preferences and based on a cardinality estimate and a cost estimate an appropriate skyline generating technique is utilized to produce a skyline representative of the received queries and its associated preferences.

Abstract translation: 所要求保护的主题涉及在关系数据库引擎内并入天际线运算符，更具体地涉及利用新技术来确定由天际线运算符产生的天际线产生的最低成本的数据库引擎。 数据库引擎接收查询和相关联的偏好，并且基于基数估计和成本估计，使用适当的地平线生成技术来产生所接收的查询及其相关联的偏好的天际线代表。

公开(公告)号：US20070185851A1

公开(公告)日：2007-08-09

申请号：US11275782

申请日：2006-01-27

Applicant: Nicolas Bruno ,  Surajit Chaudhuri ,  Dilys Thomas

Inventor： Nicolas Bruno ,  Surajit Chaudhuri ,  Dilys Thomas

IPC: G06F17/30

CPC classification number: G06F17/30424 ,  G06F17/30595

Abstract: A query generation using cardinality constraints process including choosing a first set of parameters for a query, calculating an additional set of parameters based on the first set of parameters, executing the query using additional set of parameters, evaluating the cardinality error the additional set of parameters, and refining the additional set of parameters to meet the desired cardinality constraint. Creating a query and selecting parameters for the query to meet a desired cardinality constraint or set of cardinality constraints when the query is executed against a database may be difficult. A query generation using cardinality constraints process may create a set of parameters for a query which satisfies a desired cardinality constraint or set of cardinality constraints. An application of such a query generation using cardinality constraints process may be database component and code testing.

Abstract translation: 使用基数约束过程的查询生成，包括选择用于查询的第一组参数，基于第一组参数计算附加参数集合，使用附加参数集执行查询，评估基数误差附加参数集 ，并且提炼额外的一组参数以满足期望的基数约束。 创建查询并选择参数，以便在针对数据库执行查询时难以满足所需的基数约束或基数约束集合。 使用基数约束过程的查询生成可以为满足期望的基数约束或一组基数约束的查询创建一组参数。 使用基数约束过程的这种查询生成的应用可以是数据库组件和代码测试。

公开(公告)号：US07251648B2

公开(公告)日：2007-07-31

申请号：US10186027

申请日：2002-06-28

Applicant: Surajit Chaudhuri ,  Gautam Das ,  Aris Gionis

Inventor： Surajit Chaudhuri ,  Gautam Das ,  Aris Gionis

IPC: G06F17/30

CPC classification number: G06F17/3053 ,  Y10S707/99933 ,  Y10S707/99935

Abstract: A method for automatically ranking database records by relevance to a given query. A similarity function is derived from data in the database and/or queries in a workload. The derrived similarity function is applied to a given query and records it in the database to rank the records. The records are returned in a ranked order.

Abstract translation: 一种用于通过与给定查询相关的方式自动对数据库记录进行排序的方法。 相似度函数从数据库中的数据和/或工作负载中的查询中导出。 被引用的相似性函数被应用于给定的查询并将其记录在数据库中以对记录进行排序。 记录以排序顺序返回。

公开(公告)号：US07240044B2

公开(公告)日：2007-07-03

申请号：US10941113

申请日：2004-09-15

Applicant: Surajit Chaudhuri ,  Ashraf I Aboulnaga

Inventor： Surajit Chaudhuri ,  Ashraf I Aboulnaga

IPC: G06F17/30 ,  G06F7/00

CPC classification number: G06F17/30469 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935 ,  Y10S707/99936 ,  Y10S707/99943

Abstract: Database system query optimizers use several techniques such as histograms and sampling to estimate the result sizes of operators and sub-plans (operator trees) and the number of distinct values in their outputs. Instead of estimates, the invention uses the exact actual values of the result sizes and the number of distinct values in the outputs of sub-plans encountered by the optimizer. This is achieved by optimizing the query in phases. In each phase, newly encountered sub-plans are recorded for which result size and/or distinct value estimates are required. These sub-plans are executed at the end of the phase to determine their actual result sizes and the actual number of distinct values in their outputs. In subsequent phases, the optimizer uses these actual values when it encounters the same sub-plan again.

Abstract translation: 数据库系统查询优化器使用几种技术，如直方图和抽样来估计运算符和子计划（运算符树）的结果大小以及输出中不同值的数量。 代替估计，本发明使用优化器遇到的子计划的输出中的结果大小和不同值的确切实际值。 这是通过分阶段优化查询来实现的。 在每个阶段，记录新遇到的子计划，为此需要哪个结果大小和/或不同的价值估计值。 这些子计划将在阶段结束时执行，以确定其实际结果大小和其输出中不同值的实际数量。 在后续阶段，当它再次遇到相同的子计划时，优化器将使用这些实际值。

公开(公告)号：US07155459B2

公开(公告)日：2006-12-26

申请号：US10185999

申请日：2002-06-28

Applicant: Surajit Chaudhuri ,  Sanjay Agrawal ,  Vivek Narasayya

Inventor： Surajit Chaudhuri ,  Sanjay Agrawal ,  Vivek Narasayya

IPC: G06F12/12

CPC classification number: G06F17/30312

Abstract: A method is provided for tuning a database to recommend a set of physical design structures for the database that optimize database performance for a given workload given a total time bound that defines a maximum amount of time that can be spent tuning the database. A cumulative set of recommended structures is maintained and incrementally updated based on tuning that is performed in intervals over portions of the workload. The cumulative set of recommended structures is updated by tuning the database by examining a predetermined portion of the workload during a time slice that is a fraction of the total time bound. At the end of the time slice, a set of recommended structures has been enumerated that is based on the workload portions that have been examined thus far. The set of recommended structures is updated until all queries in the workload have been examined or until the time bound is reached.

Abstract translation: 提供了一种方法，用于调整数据库以为数据库推荐一组物理设计结构，以优化给定工作负载的数据库性能，因为总时间限制定义可用于调整数据库的最大时间量。 基于在部分工作负载上以间隔执行的调整，维护并推荐了一组累积的推荐结构。 通过在作为总时间限制的一部分的时间片内检查工作负载的预定部分来调整数据库来更新累积的推荐结构集合。 在时间片段结束时，已经列举了一组推荐的结构，这些结构基于迄今已经检查的工作负载部分。 建议结构的集合将被更新，直到工作负载中的所有查询已被检查或直到达到时间限制为止。