-
公开(公告)号：US08214402B2
公开(公告)日：2012-07-03
申请号：US12484564
申请日：2009-06-15
Applicant: Nicolas Bruno , Surajit Chaudhuri
Inventor： Nicolas Bruno , Surajit Chaudhuri
IPC: G06F17/30
CPC classification number: G06F9/45512 , G06F17/30306
Abstract: An architecture for providing interactive sessions for physical database design is described, allowing users to readily try different options, identify problems, and obtain physical designs in a flexible way. Embodiments based on a .NET assembly and modifications to a database management system (DBMS) are also described.
Abstract translation: 描述了一种用于提供物理数据库设计的交互式会话的架构，允许用户以灵活的方式轻松尝试不同的选项，识别问题并获得物理设计。 还描述了基于.NET组件和对数据库管理系统（DBMS）的修改的实施例。
-
公开(公告)号：US20100299367A1
公开(公告)日：2010-11-25
申请号：US12469399
申请日：2009-05-20
Applicant: Kaushik Chakrabarti , Surajit Chaudhuri , Venkatesh Ganti
Inventor： Kaushik Chakrabarti , Surajit Chaudhuri , Venkatesh Ganti
IPC: G06F17/30
CPC classification number: G06F16/24578 , G06F16/245 , G06F16/24535 , G06F16/24539 , G06F16/248 , G06F16/43
Abstract: A keyword search is executed on a view of a database based on a Boolean keyword query. The view includes multiple text columns, and the keyword search is executed on each of the multiple text columns in the view. The output results from the keyword search on each of the text columns include tuple identifiers of one or more relevant tuples and a relevancy score for ranking the results of the keyword query.
Abstract translation: 在基于布尔关键字查询的数据库视图上执行关键字搜索。 该视图包括多个文本列，并且在视图中的每个多个文本列上执行关键字搜索。 每个文本列上的关键字搜索的输出结果包括一个或多个相关元组的元组标识符和用于对关键字查询的结果进行排名的相关分数。
-
公开(公告)号：US07707207B2
公开(公告)日：2010-04-27
申请号：US11357665
申请日：2006-02-17
Applicant: Kaushik Shriraghav , Surajit Chaudhuri , Nilesh N. Dalvi
Inventor： Kaushik Shriraghav , Surajit Chaudhuri , Nilesh N. Dalvi
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: 所要求保护的主题涉及在关系数据库引擎内并入天际线运算符，更具体地涉及利用新技术来确定由天际线运算符产生的天际线产生的最低成本的数据库引擎。 数据库引擎接收查询和相关联的偏好，并且基于基数估计和成本估计，利用适当的地平线生成技术来产生所接收的查询及其相关联的偏好的天际线。
-
54.发明授权公开(公告)号：US07685145B2
公开(公告)日：2010-03-23
申请号：US11391649
申请日：2006-03-28
Applicant: Nicolas Bruno , Surajit Chaudhuri
Inventor： Nicolas Bruno , Surajit Chaudhuri
CPC classification number: G06F17/30312 , Y10S707/99942
Abstract: Various embodiments are disclosed relating to database configuration refinement. In an example embodiment, a method is provided that may include determining a size limitation for a database configuration, determining a workload of the database configuration, and making a determination that a size of the database configuration is greater than a size limit. The method may also include applying either a merge process or a reduction process to decrease the size of the database configuration. The merge process may merge a first index/view with a second index/view to produce a merged index/view, for example. The reduction process may delete a first portion of a first view to produce a reduced view.
Abstract translation: 公开了关于数据库配置细化的各种实施例。 在示例实施例中，提供了一种方法，其可以包括确定数据库配置的大小限制，确定数据库配置的工作负载，以及确定数据库配置的大小大于大小限制。 该方法还可以包括应用合并过程或缩减过程来减小数据库配置的大小。 例如，合并进程可以将第一索引/视图与第二索引/视图合并以产生合并的索引/视图。 缩小处理可以删除第一视图的第一部分以产生缩小视图。
-
公开(公告)号：US07567949B2
公开(公告)日：2009-07-28
申请号：US10238175
申请日：2002-09-10
Applicant: Surajit Chaudhuri , Rajeev Motwani , Vivek Narasayya
Inventor： Surajit Chaudhuri , Rajeev Motwani , Vivek Narasayya
CPC classification number: G06F17/30536 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
Abstract: A database server supports weighted and unweighted sampling of records or tuples in accordance with desired sampling semantics such as with replacement (WR), without replacement (WoR), or independent coin flips (CF) semantics, for example. The database server may perform such sampling sequentially not only to sample non-materialized records, such as those produced as a stream by a pipeline in a query tree for example, but also to sample records, whether materialized or not, in a single pass. The database server also supports sampling over a join of two relations of records or tuples without requiring the computation of the full join and without requiring the materialization of both relations and/or indexes on the join attribute values of both relations.
Abstract translation: 数据库服务器根据期望的抽样语义（例如替换（WR），无替换（WoR）或独立硬币翻转（CF））语义支持对记录或元组进行加权和未加权采样。 数据库服务器可以顺序地执行这样的采样，以便例如非查询记录例如在查询树中由流水线生成的非实体记录，但是也可以在一次通过中对采样记录（无论是否实现）进行采样。 数据库服务器还支持对两个记录或元组关系的连接进行抽样，而不需要计算完整连接，而不需要在关系的连接属性值上实现关系和/或索引。
-
Patent Agency Ranking
公开(公告)号：US20090094086A1
公开(公告)日：2009-04-09
申请号：US11866417
申请日：2007-10-03
Applicant: Nicolas Bruno , Vivek R. Narasayya , Surajit Chaudhuri
Inventor： Nicolas Bruno , Vivek R. Narasayya , Surajit Chaudhuri
CPC classification number: G06Q10/00 , G06Q10/06311
Abstract: Assignment algorithm for automatically making assignments between documents and document reviewers for a review process. If the automated assignments need adjusting, a coordinator can manually refine the assignment(s). The assignment algorithm facilitates the automated assignment process based on inputs related to a constraint and/or a preference. The constraints and preferences include, but are not limited to, a conflict of interest, a minimum number of reviews, a maximum number of submissions, a partial assignment, bidding preferences, and health metrics. Once the assignments have been made, histograms can be generated that present an overview of certain health metrics, further allowing refinement of the assignment process.
Abstract translation: 分配算法用于自动进行文档和文档审阅者之间的分配以进行审核。 如果自动分配需要调整，协调员可以手动优化任务。 分配算法有助于基于与约束和/或偏好相关的输入的自动分配过程。 限制和偏好包括但不限于利益冲突，最小审查次数，最大提交数量，部分分配，出价偏好和健康度量。 一旦作出了分配，就可以生成直方图，显示某些健康指标的概述，进一步允许改进分配过程。
-
公开(公告)号：US07516149B2
公开(公告)日：2009-04-07
申请号：US10929514
申请日：2004-08-30
Applicant: Rajeev Motwani , Surajit Chaudhuri , Venkatesh Ganti
Inventor： Rajeev Motwani , Surajit Chaudhuri , Venkatesh Ganti
CPC classification number: G06F17/30303 , Y10S707/99932 , Y10S707/99933 , Y10S707/99937 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945
Abstract: At least one implementation, described herein, detects fuzzy duplicates and eliminates such duplicates. Fuzzy duplicates are multiple, seemingly distinct tuples (i.e., records) in a database that represent the same real-world entity or phenomenon.
Abstract translation: 本文描述的至少一个实施例检测模糊重复并消除这种重复。 模糊重复是代表相同的真实世界实体或现象的数据库中的多个看似独特的元组（即，记录）。
-
公开(公告)号：US20090083214A1
公开(公告)日：2009-03-26
申请号：US11858920
申请日：2007-09-21
Applicant: Arnd C. Konig , Surajit Chaudhuri , Kenneth Church , Liying Sui
Inventor： Arnd C. Konig , Surajit Chaudhuri , Kenneth Church , Liying Sui
IPC: G06F17/30
CPC classification number: G06F16/3331 , G06F16/313
Abstract: Index structures and query processing framework that enforces a given threshold on the overhead of computing conjunctive keyword queries. This includes a keyword processing algorithm, logic to determine which indexes to materialize, and a probabilistic approach to reducing the overhead for determining which indexes to build. The index structures leverage the fact that the frequency distribution of natural-language text follows a power law. Given a document collection, a set of indexes is proposed for materialization so that the time for intersecting keywords does not exceed a given threshold Δ. When considering the associated space requirement, the additional indexes are limited. Materialization of such a set of indexes for reasonable values of Δ (e.g., the time required to scan 20% of the largest inverted index), at least for a collection of short documents is distributed by the power law.
Abstract translation: 索引结构和查询处理框架，其对计算关键词查询的开销执行给定的阈值。 这包括关键字处理算法，确定要实现哪些索引的逻辑，以及减少用于确定构建哪些索引的开销的概率方法。 指数结构利用了自然语言文本的频率分布遵循幂律的事实。 给定文档集合，提出了一组索引用于实现，以便关键字相交的时间不超过给定的阈值Delta。 在考虑相关空间需求时，附加指标有限。 对于合理的Delta值（例如，扫描20％的最大倒排指数所需的时间），至少对于短文件的收集，这种一组索引的实现是通过权力法分配的。
-
公开(公告)号：US07493316B2
公开(公告)日：2009-02-17
申请号：US11296036
申请日：2005-12-07
Applicant: Surajit Chaudhuri , Vivek R. Narasayya , Rajeev Motwani , Mayur D. Datar
Inventor： Surajit Chaudhuri , Vivek R. Narasayya , Rajeev Motwani , Mayur D. Datar
IPC: G06F17/30
CPC classification number: G06F17/30536 , G06F17/30489 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99942
Abstract: A method of estimating results of a database query, the results are estimated by performing a sampling of weighted tuples in a database based on a probability of usage of tuples required in executing a workload. A probability is associated with each tuple sampled. An aggregate is computed over values in each sampled tuple while multiplying by the inverses of the probabilities associated with each tuple sampled.
Abstract translation: 一种估计数据库查询结果的方法，通过基于在执行工作负载中所需的元组的使用概率对数据库中的加权元组进行抽样来估计结果。 每个元组采样的概率相关。 根据每个采样元组中的值计算聚合，同时乘以与每个元组采样相关联的概率的反转。
-
公开(公告)号：US07483918B2
公开(公告)日：2009-01-27
申请号：US10914901
申请日：2004-08-10
Applicant: Surajit Chaudhuri , Arnd Christian Konig , Vivek R. Narasayya
Inventor： Surajit Chaudhuri , Arnd Christian Konig , Vivek R. Narasayya
IPC: G06F7/00
CPC classification number: G06F17/30312 , Y10S707/99933 , Y10S707/99945 , Y10S707/99948
Abstract: A monitoring component of a database server collects a subset of a query workload along with related statistics. A remote index tuning component uses the workload subset and related statistics to determine a physical design that minimizes the cost of executing queries in the workload subset while ensuring that queries omitted from the subset do not degrade in performance.
Abstract translation: 数据库服务器的监视组件收集查询工作负载的一部分以及相关统计信息。 远程索引调整组件使用工作负载子集和相关统计信息来确定最小化在工作负载子集中执行查询的成本的物理设计，同时确保从子集中省略的查询不会降低性能。
-
-
-
-
-
-
-
-
-
Search Results
186
records
(took 0.032 seconds)
