专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

91. 发明申请

US20080183644A1 LIGHTWEIGHT PHYSICAL DESIGN ALERTER 有权
标题翻译：轻型物理设计报警器
公开(公告)号：US20080183644A1
公开(公告)日：2008-07-31
申请号：US11669782
申请日：2007-01-31
申请人： Nicolas Bruno , Surajit Chaudhuri
发明人： Nicolas Bruno , Surajit Chaudhuri
IPC分类号： G06F15/18 , G06F12/00 , G06F13/00
CPC分类号： G06F17/30306
摘要： A lightweight physical design alerter can analyze a workload and determine whether a comprehensive tuning session would result in a configuration improvement over the current configuration. The alerter provides a low-overhead procedure that can run during normal operation of a database management system and produce a notification if a current configuration is less than optimal. The alerter can report lower and upper bounds on the improvements that could be obtained if a comprehensive tuning tool is launched. A lower bound can be justified by generating feasible configurations. The disclosed embodiments can be extended to query updates, materialized views, and other physical design features (e.g., partitioning).
摘要翻译：轻量级物理设计报警器可以分析工作负载并确定综合调优会话是否会导致配置改进超过当前配置。报警器提供了一个低开销的过程，可以在数据库管理系统的正常操作期间运行，并在当前配置不太适合的情况下产生通知。报警器可以报告如果启动综合调整工具可以获得的改进的上下限。可以通过生成可行的配置来证明下限。所公开的实施例可以扩展到查询更新，物化视图和其他物理设计特征（例如，分区）。

92. 发明授权

US07363289B2 Method and apparatus for exploiting statistics on query expressions for optimization 有权
标题翻译：利用查询表达式进行统计优化的方法和装置
公开(公告)号：US07363289B2
公开(公告)日：2008-04-22
申请号：US11177598
申请日：2005-07-07
申请人： Surajit Chaudhuri , Nicolas Bruno
发明人： Surajit Chaudhuri , Nicolas Bruno
IPC分类号： G06F17/30
CPC分类号： G06F17/30463 , G06F17/30536 , Y10S707/99932 , Y10S707/99933 , Y10S707/99942 , Y10S707/99943 , Y10S707/99944 , Y10S707/99945
摘要： A method for evaluating a user query on a relational database having records stored therein, a workload made up of a set of queries that have been executed on the database, and a query optimizer that generates a query execution plan for the user query. Each query plan includes a plurality of intermediate query plan components that verify a subset of records from the database meeting query criteria. The method accesses the query plan and a set of stored intermediate statistics for records verified by query components, such as histograms that summarize the cardinality of the records that verify the query component. The method forms a transformed query plan based on the selected intermediate statistics (possibly by rewriting the query plan) and estimates the cardinality of the transformed query plan to arrive at a more accurate cardinality estimate for the query. If additional intermediate statistics are necessary, a pool of intermediate statistics may be generated based on the queries in the workload by evaluating the benefit of a given statistic over the workload and adding intermediate statistics to the pool that provide relatively great benefit.
摘要翻译：一种用于评估具有存储在其中的记录的关系数据库的用户查询的方法，由在数据库上执行的一组查询组成的工作负载以及生成用户查询的查询执行计划的查询优化器。每个查询计划包括多个中间查询计划组件，其从数据库会议查询条件验证记录的子集。该方法访问查询计划和一组存储的中间统计信息，用于查询组件验证的记录，例如总结验证查询组件的记录的基数的直方图。该方法基于所选择的中间统计（可能通过重写查询计划）形成转换的查询计划，并且估计转换后的查询计划的基数以得到查询的更准确的基数估计。如果需要额外的中间统计数据，则可以根据工作负载中的查询生成中间统计数据池，方法是评估给定统计量对工作负载的好处，并将中间统计信息添加到提供相对较大收益的池中。

93. 发明授权

US06356891B1 Identifying indexes on materialized views for database workload 有权
标题翻译：识别数据库工作负载的物化视图的索引
公开(公告)号：US06356891B1
公开(公告)日：2002-03-12
申请号：US09629412
申请日：2000-08-01
申请人： Sanjay Agrawal , Surajit Chaudhuri , Vivek R. Narasayya
发明人： Sanjay Agrawal , Surajit Chaudhuri , Vivek R. Narasayya
IPC分类号： G06F1730
CPC分类号： G06F17/30336 , Y10S707/99932 , Y10S707/99933 , Y10S707/99935
摘要： An index and materialized view selection wizard produces a fast and reasonable recommendation for a configuration of indexes, materialized views, and indexes on materialized views which are beneficial given a specified workload for a given database and database server. Candidate materialized views and indexes are obtained, and a joint enumeration of the combined materialized views and indexes is performed to obtain a recommended configuration. The configuration includes indexes, materialized views and indexes on materialized views. Candidate materialized views are obtained by first determining subsets of tables are referenced in queries in the workload and then finding interesting table subsets. Next, interesting subsets are considered on a per query basis to determine which are syntactically relevant for a query. Materialized views which are likely to be used for the workload are then generated along with a set of merged materialized views. Clustered indexes and non-clustered indexes on materialized views are then generated. The indexes, materialized views and indexes on materialized views are then enumerated together to form the recommended configuration.
摘要翻译：索引和物化视图选择向导可以为物理视图的索引，物化视图和索引配置提供快速合理的建议，这对给定数据库和数据库服务器的指定工作负载是有益的。获取候选物化视图和索引，并执行组合实例化视图和索引的联合枚举，以获得推荐的配置。配置包括物化视图的索引，物化视图和索引。通过首先确定表中的子集在工作负载中的查询中引用并且然后找到有趣的表子集来获得候选物化视图。接下来，在每个查询的基础上考虑有趣的子集，以确定哪个在查询语法上相关。可能用于工作负载的物化视图随同一组合并物化视图一起生成。然后生成物化视图上的聚簇索引和非聚集索引。然后将物化视图的索引，物化视图和索引列在一起以形成推荐的配置。

94. 发明授权

US06266658B1 Index tuner for given workload 有权
标题翻译：索引调谐器用于给定的工作负载
公开(公告)号：US06266658B1
公开(公告)日：2001-07-24
申请号：US09553070
申请日：2000-04-20
申请人： Atul Adya , Sanjay Agrawal , Surajit Chaudhuri , Vivek R. Narasayya
发明人： Atul Adya , Sanjay Agrawal , Surajit Chaudhuri , Vivek R. Narasayya
IPC分类号： G06F1730
CPC分类号： G06F17/30312 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99935
摘要： An index tuning wizard produces a fast and reasonable recommendation identifying database indexes to use given a specified workload. A query optimizer is used to determine the expected usefulness of potential indexes for the specified workload by taking cost of queries in the workload into account. A cost based pruning of indexes is then performed to provide an intermediate set of proposed indexes. Indexes having most benefit based on storage constraints are then selected. The optimizer is then used again, and further pruning is done on a benefits basis. An index is not recommended unless it has a significant impact on the workload.
摘要翻译：索引调整向导会产生一个快速合理的建议，用于标识在指定工作负载下使用的数据库索引。查询优化器用于通过考虑工作负载中的查询成本来确定指定工作负载的潜在索引的预期有用性。然后执行索引的基于成本的修剪以提供提出的索引的中间集合。然后选择基于存储约束最有利的索引。然后，优化器再次被使用，并且进一步修剪是在有益的基础上进行的。不建议使用索引，除非它对工作负载有重大影响。

95. 发明授权

US09317544B2 Integrated fuzzy joins in database management systems 有权
标题翻译：在数据库管理系统中集成模糊连接
公开(公告)号：US09317544B2
公开(公告)日：2016-04-19
申请号：US13253315
申请日：2011-10-05
申请人： Kris Ganjam , Vivek Ravindranath Narasayya , Raghav Kaushik , Arvind Arasu , Surajit Chaudhuri
发明人： Kris Ganjam , Vivek Ravindranath Narasayya , Raghav Kaushik , Arvind Arasu , Surajit Chaudhuri
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30303 , G06F17/30533
摘要： 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.
摘要翻译：集成在数据库系统中的模糊连接系统在两个数据集的记录之间生成模糊连接。模糊连接系统包括一个用于生成数据记录令牌的标记器和一个用于为令牌找到变换的变压器。模糊连接系统调用在数据库系统的运行时层内运行的签名生成器，以基于令牌及其变换生成用于数据记录的签名。随后，等连接操作将来自两个数据集的记录与至少一个相等的签名相连。在数据库系统的运行时层内运行的相似度计算器使用所连接的记录的令牌信息来计算相似性度量。如果任何两个记录的相似性度量高于阈值，则模糊连接系统在这两个记录之间生成模糊连接。

96. 发明授权

US09171081B2 Entity augmentation service from latent relational data 有权
标题翻译：潜在关系数据的实体增强服务
公开(公告)号：US09171081B2
公开(公告)日：2015-10-27
申请号：US13413179
申请日：2012-03-06
申请人： Kris K. Ganjam , Kaushik Chakrabarti , Mohamed A. Yakout , Surajit Chaudhuri
发明人： Kris K. Ganjam , Kaushik Chakrabarti , Mohamed A. Yakout , Surajit Chaudhuri
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30864 , G06F17/30539 , G06F2216/03
摘要： The subject disclosure is directed towards providing data for augmenting an entity-attribute-related task. Pre-processing is preformed on entity-attribute tables extracted from the web, e.g., to provide indexes that are accessible to find data that completes augmentation tasks. The indexes are based on both direct mappings and indirect mappings between tables. Example augmentation tasks include queries for augmented data based on an attribute name or examples, or finding synonyms for augmentation. An online query is efficiently processed by accessing the indexes to return augmented data related to the task.
摘要翻译：主题公开旨在提供用于增强实体属性相关任务的数据。在从网络提取的实体属性表上执行预处理，例如，提供可访问以查找完成扩充任务的数据的索引。索引基于表之间的直接映射和间接映射。示例增强任务包括基于属性名称或示例的增强数据查询，或查找用于扩充的同义词。通过访问索引以返回与任务相关的扩充数据，可以有效地处理在线查询。

97. 发明授权

US08983954B2 Finding data in connected corpuses using examples 有权
标题翻译：使用示例查找连接的语料库中的数据
公开(公告)号：US08983954B2
公开(公告)日：2015-03-17
申请号：US13443681
申请日：2012-04-10
申请人： John C. Platt , Surajit Chaudhuri , Lev Novik , Henricus Johannes Maria Meijer , Efim Hudis , Kunal Mukerjee , Christopher Alan Hays
发明人： John C. Platt , Surajit Chaudhuri , Lev Novik , Henricus Johannes Maria Meijer , Efim Hudis , Kunal Mukerjee , Christopher Alan Hays
IPC分类号： G06F17/30
CPC分类号： G06F17/30758 , G06F17/30303 , G06F17/30395 , G06F17/3053 , G06F17/30539 , G06F17/30595 , G06F17/30722 , G06F17/30867
摘要： In one embodiment, datasets are stored in a catalog. The datasets are enriched by establishing relationships among the domains in different datasets. A user searches for relevant datasets by providing examples of the domains of interest. The system identifies datasets corresponding to the user-provided examples. The system them identifies connected subsets of the datasets that are directly linked or indirectly linked through other domains. The user provides known relationship examples to filter the connected subsets and to identify the connected subsets that are most relevant to the user's query. The selected connected subsets may be further analyzed by business intelligence/analytics to create pivot tables or to process the data.
摘要翻译：在一个实施例中，数据集存储在目录中。通过在不同数据集中建立域之间的关系来丰富数据集。用户通过提供感兴趣的域的示例来搜索相关的数据集。系统识别与用户提供的示例对应的数据集。系统识别通过其他域直接链接或间接链接的数据集的连接子集。用户提供已知的关系示例来过滤连接的子集并识别与用户查询最相关的连接的子集。可以通过商业智能/分析进一步分析所选择的连接子集以创建枢轴表或处理数据。

98. 发明申请

US20130132381A1 TAGGING ENTITIES WITH DESCRIPTIVE PHRASES 有权
标题翻译：用描述性标签标签实体
公开(公告)号：US20130132381A1
公开(公告)日：2013-05-23
申请号：US13298349
申请日：2011-11-17
申请人： Kaushik Chakrabarti , Surajit Chaudhuri , Tao Cheng
发明人： Kaushik Chakrabarti , Surajit Chaudhuri , Tao Cheng
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , G06F17/30277
摘要： A plurality of description phrases associated with a first domain may be determined, based on an analysis of a first plurality of documents to determine co-occurrences of the description phrases with one or more name labels associated with the first domain. An entity associated with the first domain may be obtained. An analysis of a second plurality of documents may be initiated to identify co-occurrences of mentions of the obtained entity and one or more of the plurality of description phrases, and contexts associated with each of the co-occurrences of the mentions and description phrases, in each one of the second plurality of documents. A description tag association between the obtained entity and one of the description phrases may be determined, based on an analysis of the identified contexts.
摘要翻译：可以基于第一多个文档的分析来确定与第一域相关联的多个描述短语，以确定描述短语与与第一域相关联的一个或多个名称标签的共同出现。可以获得与第一域相关联的实体。可以启动对第二多个文档的分析，以识别获得的实体的提及和多个描述短语中的一个或多个以及与提及和描述短语的共同出现中的每一个相关联的上下文，在第二多个文档的每一个中。可以基于对所识别的上下文的分析来确定获得的实体与描述短语之一之间的描述标签关联。

99. 发明授权

US08249336B2 Learning string transformations from examples 有权
标题翻译：从示例中学习字符串变换
公开(公告)号：US08249336B2
公开(公告)日：2012-08-21
申请号：US12492311
申请日：2009-08-14
申请人： Arvind Arasu , Surajit Chaudhuri , Shriraghav Kaushik
发明人： Arvind Arasu , Surajit Chaudhuri , Shriraghav Kaushik
IPC分类号： G06K9/00
CPC分类号： G06F17/2765
摘要： Techniques are described to leverage a set of sample or example matched pairs of strings to learn string transformation rules, which may be used to match data records that are semantically equivalent. In one embodiment, matched pairs of input strings are accessed. For a set of matched pairs, a set of one or more string transformation rules are learned. A transformation rule may include two strings determined to be semantically equivalent. The transformation rules are used to determine whether a first and second string match each other.
摘要翻译：描述技术来利用一组样本或示例匹配的字符串对来学习字符串转换规则，其可以用于匹配语义等同的数据记录。在一个实施例中，访问匹配的输入串对。对于一组匹配的对，学习一组或多个字符串转换规则。转换规则可以包括确定为在语义上相等的两个字符串。变换规则用于确定第一个和第二个字符串是否彼此匹配。

100. 发明授权

US08140548B2 Constrained physical design tuning 有权
标题翻译：约束物理设计调谐
公开(公告)号：US08140548B2
公开(公告)日：2012-03-20
申请号：US12191303
申请日：2008-08-13
申请人： Nicolas Bruno , Surajit Chaudhuri
发明人： Nicolas Bruno , Surajit Chaudhuri
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30312
摘要： Described is a constraint language and related technology by which complex constraints may be used in selecting configurations for use in physical database design tuning. The complex constraint (or constraints) is processed, e.g., in a search framework, to determine and output at least one configuration that meets the constraint, e.g., a best configuration found before a stopping condition is met. The search framework processes a current configuration into candidate configurations, including by searching for candidate configurations from a current configuration based upon a complex constraint, iteratively evaluating a search space until a stopping condition is satisfied, using transformation rules to generate new candidate configurations, and selecting a best candidate configuration. Transformation rules and pruning rules are applied to efficiently perform the search. Constraints may be specified as assertions that need to be satisfied, or as soft assertions that come close to satisfying the constraint.
摘要翻译：描述了一种约束语言和相关技术，通过该约束语言和相关技术，复杂约束可用于选择用于物理数据库设计调优的配置。复杂约束（或约束）例如在搜索框架中被处理，以确定和输出满足约束的至少一个配置，例如在满足停止条件之前找到的最佳配置。搜索框架将当前配置处理成候选配置，包括通过基于复杂约束从当前配置中搜索候选配置，迭代地评估搜索空间直到停止条件满足，使用转换规则来生成新的候选配置，以及选择最佳候选人配置。应用变换规则和修剪规则来有效地执行搜索。约束可以被指定为需要满足的断言，或者是接近满足约束的软断言。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式