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

121. 发明授权

US5544355A Method and apparatus for query optimization in a relational database system having foreign functions 失效
标题翻译：具有外部功能的关系数据库系统中查询优化的方法和装置
公开(公告)号：US5544355A
公开(公告)日：1996-08-06
申请号：US77227
申请日：1993-06-14
申请人： Surajit Chaudhuri , Kyuseok Shim
发明人： Surajit Chaudhuri , Kyuseok Shim
IPC分类号： G06F12/00 , G06F17/30
CPC分类号： G06F17/30463 , Y10S707/99932
摘要： Database applications typically need to invoke foreign functions or to access data that is not stored in the database. The invention provides a comprehensive approach to cost-based optimization of relational queries in the presence of such foreign functions. The optimization takes into account semantic information about foreign functions using a declarative rule language (e.g., SQL) to express such semantics. Procedures for applying the rewrite rules and for generating the execution space of equivalent queries are described. Procedures to obtain an optimal plan from this enriched execution space are also described. Moreover, necessary extensions to the cost model that are needed in the presence of foreign functions are described.
摘要翻译：数据库应用程序通常需要调用外部函数或访问未存储在数据库中的数据。本发明提供了在存在这种外部功能的情况下关系查询的基于成本优化的综合方法。优化考虑到使用声明性规则语言（例如SQL）来表达这种语义的关于外部函数的语义信息。描述了应用重写规则和生成等效查询的执行空间的过程。还描述了从这个丰富的执行空间获得最佳计划的过程。此外，描述了在存在外部功能的情况下对成本模型的必要扩展。

122. 发明授权

US11202958B2 Developing implicit metadata for data stores 有权
公开(公告)号：US11202958B2
公开(公告)日：2021-12-21
申请号：US13444482
申请日：2012-04-11
申请人： John C. Platt , Surajit Chaudhuri , Lev Novik , Henricus Johannes Maria Meijer
发明人： John C. Platt , Surajit Chaudhuri , Lev Novik , Henricus Johannes Maria Meijer
IPC分类号： G06F16/90 , A63F13/20 , A63F13/50 , G06F16/907
摘要： A system enables metadata to be gathered about a data store beginning from the creation and generation of the data store, through subsequent use of the data store. This metadata can include keywords related to the data store and data appearing within the data store. Thus, keywords and other metadata can be generated without owner/creator intervention, with enough semantic meaning to make a discovery process associated with the data store much easier and efficient. Usage of or communication regarding a data store are monitored and keywords are extracted from the usage or communication. The keywords are then written to otherwise associated with metadata of the data store. During searching, keywords in the metadata are made available to be used to attempt to match query terms entered by a searcher.

123. 发明授权

US08745019B2 Robust discovery of entity synonyms using query logs 有权
标题翻译：使用查询日志强大发现实体同义词
公开(公告)号：US08745019B2
公开(公告)日：2014-06-03
申请号：US13487260
申请日：2012-06-04
申请人： Tao Cheng , Kaushik Chakrabarti , Surajit Chaudhuri , Dong Xin
发明人： Tao Cheng , Kaushik Chakrabarti , Surajit Chaudhuri , Dong Xin
IPC分类号： G06F17/30
CPC分类号： G06F17/30672
摘要： A similarity analysis framework is described herein which leverages two or more similarity analysis functions to generate synonyms for an entity reference string re. The functions are selected such that the synonyms that are generated by the framework satisfy a core set of synonym-related properties. The functions operate by leveraging query log data. One similarity analysis function takes into consideration the strength of similarity between a particular candidate string se and an entity reference string re even in the presence of sparse query log data, while another function takes into account the classes of se and re. The framework also provides indexing mechanisms that expedite its computations. The framework also provides a reduction module for converting long entity reference strings into shorter strings, where each shorter string (if found) contains a subset of the terms in its longer counterpart.
摘要翻译：本文描述了相似性分析框架，其利用两个或多个相似性分析功能来生成实体参考字符串re的同义词。选择这些功能使得由框架生成的同义词满足同义词相关属性的核心集合。这些功能通过利用查询日志数据进行操作。一个相似性分析功能考虑到即使在存在稀疏查询日志数据的情况下，特定候选字符串se和实体引用字符串之间的相似度的强度，而另一个函数考虑了se和re的类别。该框架还提供了加速其计算的索引机制。该框架还提供了一个缩减模块，用于将长实体引用字符串转换为较短的字符串，其中每个较短的字符串（如果找到）包含其较长对应项中的术语的子集。

124. 发明申请

US20130151504A1 QUERY PROGRESS ESTIMATION 审中-公开
标题翻译：查询进度估计
公开(公告)号：US20130151504A1
公开(公告)日：2013-06-13
申请号：US13315306
申请日：2011-12-09
申请人： Christian Konig , Bolin Ding , Surajit Chaudhuri , Vivek Narasayya
发明人： Christian Konig , Bolin Ding , Surajit Chaudhuri , Vivek Narasayya
IPC分类号： G06F17/30
CPC分类号： G06F16/245
摘要： The claimed subject matter provides a method for providing a progress estimate for a database query. The method includes determining static features of a query plan for the database query. The method also includes selecting an initial progress estimator based on the static features and a trained machine learning model. The model is trained using static features of a plurality of query plans, and dynamic features of the plurality of query plans. Further, the method includes determining dynamic features of the query plan for each of a plurality of candidate estimators. Additionally, the method includes selecting a revised progress estimator based on the static features, the dynamic features and a trained machine learning model for each of the candidate estimators. The method further includes producing the progress estimate based on the revised progress estimator.
摘要翻译：所要求保护的主题提供了一种用于提供数据库查询的进度估计的方法。该方法包括确定数据库查询的查询计划的静态特征。该方法还包括基于静态特征和经过训练的机器学习模型来选择初始进度估计器。使用多个查询计划的静态特征以及多个查询计划的动态特征来训练该模型。此外，该方法包括确定多个候选估计器中的每一个的查询计划的动态特征。另外，该方法包括基于静态特征，动态特征和针对每个候选估计器的经训练的机器学习模型来选择修正的进度估计器。该方法还包括基于修改的进度估计器产生进度估计。

125. 发明申请

US20120173500A1 PROGRESSIVE SPATIAL SEARCHING USING AUGMENTED STRUCTURES 有权
标题翻译：使用增强结构进行空间搜索
公开(公告)号：US20120173500A1
公开(公告)日：2012-07-05
申请号：US12981082
申请日：2010-12-29
申请人： Kaushik Chakrabarti , Surajit Chaudhuri
发明人： Kaushik Chakrabarti , Surajit Chaudhuri
IPC分类号： G06F17/30
CPC分类号： G06F17/3053 , G01C21/3611 , G01C21/3679 , G06F17/30091 , G06F17/30241 , G06F17/30864
摘要： A location associated with a user of a computing device and a prefix portion of an input string may be received as one or more successive characters of the input string are provided by the user via the computing device. A list of suggested items may be obtained based on a function of respective recommendation indicators and proximities of the items to the location in response to receiving the prefix portion, and based on partially traversing a character string search structure having a plurality of non-terminal nodes augmented with bound indicators associated with spatial regions. The list of suggested items and descriptive information associated with each suggested item may be returned to the user, in response to receiving the prefix portion, for rendering an image illustrating indicators associated with the list in a manner relative to the location, as the user provides each successive character of the input string.
摘要翻译：当用户通过计算设备提供输入串的一个或多个连续字符时，可以接收与计算设备的用户和输入字符串的前缀部分相关联的位置。可以基于各个推荐指标的功能和响应于接收前缀部分的到位置的项目的接近度，并且基于部分地遍历具有多个非终端节点的字符串搜索结构来获得所提出的项目的列表增加与空间区域相关联的绑定指标。与每个建议项目相关联的建议项目和描述性信息的列表可以响应于接收到前缀部分而返回给用户，用于以用户提供的方式呈现以相对于位置的方式示出与列表相关联的指示符的图像输入字符串的每个连续字符。

126. 发明授权

US08185519B2 Techniques for exact cardinality query optimization 有权
标题翻译：精确基数查询优化技术
公开(公告)号：US08185519B2
公开(公告)日：2012-05-22
申请号：US12404284
申请日：2009-03-14
申请人： Surajit Chaudhuri , Vivek Narasayya , Ravishankar Ramamurthy
发明人： Surajit Chaudhuri , Vivek Narasayya , Ravishankar Ramamurthy
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30463
摘要： 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.
摘要翻译：一种精确的基数查询优化系统和方法，用于优化具有多个表达式的查询，以获得查询的基本优化查询执行计划。系统和方法的实施例使用各种技术来缩短获得基数优化查询执行计划所需的时间，当所有基数是精确的时，其包含查询执行计划。该系统和方法的实施例包括利用查询执行反馈来获取查询的相关表达式的无序子集的覆盖查询技术，限制基数以确定处理是否可以在每个表达式之前终止的提前终止技术是以及表达式排序技术，其找到产生最大时间缩短以获得基数优化查询执行计划的表达式的排序。

127. 发明授权

US07930301B2 System and method for searching computer files and returning identified files and associated files 失效
标题翻译：用于搜索计算机文件并返回识别的文件和相关文件的系统和方法
公开(公告)号：US07930301B2
公开(公告)日：2011-04-19
申请号：US10403063
申请日：2003-03-31
申请人： Cezary Marcjan , Ryszard Kott , Surajit Chaudhuri , Lili Cheng
发明人： Cezary Marcjan , Ryszard Kott , Surajit Chaudhuri , Lili Cheng
IPC分类号： G06F7/00
CPC分类号： G06F17/30106
摘要： A search of an index database or another search method is conducted to identify preliminary results listing one or more selected computer objects having selected identifying information stored in an index database. In addition, one or more selected computer objects of the preliminary search results are correlated with one or more other computer objects that have associations with the selected computer objects of the preliminary search results. Integrated search results are then returned and include the preliminary search results and one or more other computer objects that have associations with the selected computer objects of the preliminary search results. The associations may be determined by a association system and represent relationships between computer files based upon user or other interactions between the objects. The associations between the objects may include similarities between them and their importance.
摘要翻译：执行索引数据库或另一搜索方法的搜索以识别列出存储在索引数据库中的具有所选择的识别信息的一个或多个所选计算机对象的初步结果。此外，初步搜索结果的一个或多个所选择的计算机对象与与初步搜索结果的所选择的计算机对象具有关联的一个或多个其他计算机对象相关联。然后返回集成搜索结果，并包括初步搜索结果以及与初步搜索结果的所选计算机对象相关联的一个或多个其他计算机对象。关联可以由关联系统确定，并且基于用户或对象之间的其他交互来表示计算机文件之间的关系。对象之间的关联可能包括它们之间的相似性及其重要性。

128. 发明授权

US07917514B2 Visual and multi-dimensional search 有权
标题翻译：可视和多维搜索
公开(公告)号：US07917514B2
公开(公告)日：2011-03-29
申请号：US11427305
申请日：2006-06-28
申请人： 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
发明人： 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分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30256 , G06F17/3002 , G06F17/30026 , G06F17/30038 , G06F17/30047 , G06F17/30864
摘要： 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.
摘要翻译：一种能够基于从输入中提取的特征来建立搜索查询的分析多维输入的系统。在特定示例中，图像可以用作搜索机制的输入。模式识别和图像分析可以应用于图像，然后建立对应于从图像输入提取的特征的搜索查询。该系统还可以方便索引多维可搜索项目，从而使得它们可以作为结果被检索到搜索查询。更具体地，系统可以采用文本分析，模式和/或语音识别机制来从可搜索项目中提取特征。这些提取的特征可用于索引可搜索的项目。

129. 发明申请

US20100318543A1 INTERACTIVE PHYSICAL DESIGN TUNING 有权
标题翻译：互动物理设计调谐
公开(公告)号：US20100318543A1
公开(公告)日：2010-12-16
申请号：US12484564
申请日：2009-06-15
申请人： Surajit Chaudhuri , Nicolas Bruno
发明人： Surajit Chaudhuri , Nicolas Bruno
IPC分类号： G06F17/30
CPC分类号： G06F9/45512 , G06F17/30306
摘要： 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.
摘要翻译：描述了一种用于提供物理数据库设计的交互式会话的架构，允许用户以灵活的方式轻松尝试不同的选项，识别问题并获得物理设计。还描述了基于.NET组件和对数据库管理系统（DBMS）的修改的实施例。

130. 发明申请

US20100042963A1 Constrained Physical Design Tuning 有权
标题翻译：约束物理设计调整
公开(公告)号：US20100042963A1
公开(公告)日：2010-02-18
申请号：US12191303
申请日：2008-08-13
申请人： Nicolas Bruno , Surajit Chaudhuri
发明人： Nicolas Bruno , Surajit Chaudhuri
IPC分类号： G06F17/50
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

热门服务

关于我们

友情链接

联系方式