公开(公告)号：US20130346464A1

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

申请号：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: G06F15/16

CPC classification number: 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.

Abstract translation: 本文描述了一种数据服务系统，其处理来自至少一个网络可访问系统（例如搜索系统）的原始数据资产以产生处理的数据资产。 企业应用程序可以利用已处理的数据资产来执行各种环境特定任务。 在一个实现中，数据服务系统可以生成以下任何一种：供企业应用使用的同义词资源，为与实体相关联的指定术语提供同义词; 增加资源供企业应用用于提供指定种子信息的补充信息; 以及企业应用程序为指定的术语提供拼写信息的拼写纠正资源等。

公开(公告)号：US20130297655A1

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

申请号：US13461785

申请日：2012-05-02

Applicant: Vivek Ravindranath Narasayya ,  Feng Li ,  Surajit Chaudhuri

Inventor： Vivek Ravindranath Narasayya ,  Feng Li ,  Surajit Chaudhuri

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30575 ,  G06F11/3457 ,  H04L41/5003 ,  H04L41/5009

Abstract: Various technologies described herein pertain to evaluating service provider compliance with terms of a performance service level agreement (SLA) for a tenant in a multi-tenant database system. The terms of the performance SLA can set a performance criterion as though a level of a resource of hardware of the multi-tenant database system is dedicated to the tenant. An actual performance metric of the resource can be tracked for a workload of the tenant. Further, a baseline performance metric of the resource can be determined for the workload of the tenant. The baseline performance metric can be based on a simulation as though the level of the resource as set in the performance SLA is dedicated to the workload of the tenant. Moreover, the actual performance metric can be compared with the baseline performance metric to evaluate compliance with the performance SLA.

Abstract translation: 本文描述的各种技术涉及评估服务提供商遵守多租户数据库系统中租户的性能服务级别协议（SLA）的条款。 性能SLA的术语可以设置性能标准，就像多租户数据库系统的硬件资源的级别是专门用于租户一样。 可以为租户的工作负载跟踪资源的实际性能指标。 此外，可以为租户的工作量确定资源的基准绩效指标。 基准性能度量可以基于模拟，就像在性能SLA中设置的资源的级别专用于租户的工作量一样。 此外，可以将实际绩效指标与基准绩效指标进行比较，以评估是否符合绩效SLA。

公开(公告)号：US20130275434A1

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

申请号：US13444482

申请日：2012-04-11

Applicant: John C. Platt ,  Surajit Chaudhuri ,  Lev Novik ,  Henricus Johannes Maria Meijer

Inventor： John C. Platt ,  Surajit Chaudhuri ,  Lev Novik ,  Henricus Johannes Maria Meijer

IPC: G06F17/30

Abstract: 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.

Abstract translation: 系统通过后续使用数据存储，可以从数据存储的创建和生成开始收集关于数据存储的元数据。 该元数据可以包括与数据存储相关的关键字和数据存储中出现的数据。 因此，关键字和其他元数据可以在没有所有者/创建者干预的情况下生成，具有足够的语义意义，使得与数据存储相关联的发现过程更容易和高效。 对数据存储的使用或通信进行监控，并从使用或通信中提取关键字。 然后将关键字写入与数据存储的元数据相关联。 在搜索期间，元数据中的关键字可用于尝试匹配搜索者输入的查询词。

公开(公告)号：US20130268531A1

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

申请号：US13443681

申请日：2012-04-10

Applicant: John C. Platt ,  Surajit Chaudhuri ,  Lev Novik ,  Henricus Johannes Maria Meijer ,  Efim Hudis ,  Kunal Mukerjee ,  Christopher Alan Hays

Inventor： John C. Platt ,  Surajit Chaudhuri ,  Lev Novik ,  Henricus Johannes Maria Meijer ,  Efim Hudis ,  Kunal Mukerjee ,  Christopher Alan Hays

IPC: G06F17/30

CPC classification number: G06F17/30758 ,  G06F17/30303 ,  G06F17/30395 ,  G06F17/3053 ,  G06F17/30539 ,  G06F17/30595 ,  G06F17/30722 ,  G06F17/30867

Abstract: 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.

公开(公告)号：US20130238621A1

公开(公告)日：2013-09-12

申请号：US13413179

申请日：2012-03-06

Applicant: Kris K. Ganjam ,  Kaushik Chakrabarti ,  Mohamed A. Yakout ,  Surajit Chaudhuri

Inventor： Kris K. Ganjam ,  Kaushik Chakrabarti ,  Mohamed A. Yakout ,  Surajit Chaudhuri

IPC: G06F17/30

CPC classification number: G06F17/30864 ,  G06F17/30539 ,  G06F2216/03

Abstract: 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.

Abstract translation: 主题公开旨在提供用于增强实体属性相关任务的数据。 在从网络提取的实体属性表上执行预处理，例如，提供可访问以查找完成扩充任务的数据的索引。 索引基于表之间的直接映射和间接映射。 示例增强任务包括基于属性名称或示例的增强数据查询，或查找用于扩充的同义词。 通过访问索引以返回与任务相关的扩充数据，可以有效地处理在线查询。

公开(公告)号：US08533203B2

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

申请号：US12478120

申请日：2009-06-04

Applicant: Surajit Chaudhuri ,  Venkatesh Ganti ,  Dong Xin

Inventor： Surajit Chaudhuri ,  Venkatesh Ganti ,  Dong Xin

IPC: G06F17/30 ,  G06F7/00

CPC classification number: G06F17/2795 ,  G06F17/278

Abstract: Identifying synonyms of entities using a collection of documents is disclosed herein. In some aspects, a document from a collection of documents may be analyzed to identify hit sequences that include one or more tokens (e.g., words, number, etc.). The hit sequences may then be used to generate discriminating token sets (DTS's) that are subsets of both the hit sequences and the entity names. The DTS's are matched with corresponding entity names, and then used to create DTS phrases by selecting adjacent text in the document that is proximate to the DTS. The DTS phrases may be analyzed to determine whether the corresponding DTS is synonyms of the entity name. In various aspects, the tokens of an associated entity name that are present in the DTS phrases are used to generate a score for the DTS. When the score at least reaches a threshold, the DTS may be designated as a synonym. A list of synonyms may be generated for each entity name.

Abstract translation: 本文公开了使用文档集合识别实体的同义词。 在一些方面，可以分析来自文档集合的文档以识别包括一个或多个令牌（例如，单词，数字等）的命中序列。 然后可以使用命中序列来生成作为命中序列和实体名称的子集的识别令牌集（DTS's）。 DTS与相应的实体名称相匹配，然后用于通过选择靠近DTS的文档中的相邻文本来创建DTS短语。 可以分析DTS短语以确定对应的DTS是否是实体名称的同义词。 在各方面，使用存在于DTS短语中的关联实体名称的令牌来产生DTS的得分。 当分数至少达到阈值时，DTS可以被指定为同义词。 可以为每个实体名称生成同义词列表。

公开(公告)号：US20130232129A1

公开(公告)日：2013-09-05

申请号：US13487260

申请日：2012-06-04

Applicant: Tao Cheng ,  Kaushik Chakrabarti ,  Surajit Chaudhuri ,  Dong Xin

Inventor： Tao Cheng ,  Kaushik Chakrabarti ,  Surajit Chaudhuri ,  Dong Xin

IPC: G06F17/30

CPC classification number: G06F17/30672

Abstract: 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.

Abstract translation: 本文描述了相似性分析框架，其利用两个或多个相似性分析功能来生成实体参考字符串re的同义词。 选择这些功能使得由框架生成的同义词满足同义词相关属性的核心集合。 这些功能通过利用查询日志数据进行操作。 一个相似性分析功能考虑到即使在存在稀疏查询日志数据的情况下，特定候选字符串se和实体引用字符串之间的相似度的强度，而另一个函数考虑了se和re的类别。 该框架还提供了加速其计算的索引机制。 该框架还提供了一个缩减模块，用于将长实体引用字符串转换为较短的字符串，其中每个较短的字符串（如果找到）包含其较长对应项中的术语的子集。

公开(公告)号：US08195655B2

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

申请号：US11758024

申请日：2007-06-05

Applicant: Sanjay Agrawal ,  Kaushik Chakrabarti ,  Surajit Chaudhuri ,  Venkatesh Ganti

Inventor： Sanjay Agrawal ,  Kaushik Chakrabarti ,  Surajit Chaudhuri ,  Venkatesh Ganti

IPC: G06F17/30

CPC classification number: G06F17/278 ,  G06F17/30864

Abstract: Architecture for finding related entities for web search queries. An extraction component takes a document as input and outputs all the mentions (or occurrences) of named entities such as names of people, organizations, locations, and products in the document, as well as entity metadata. An indexing component takes a document identifier (docID) and the set of mentions of named entities and, stores and indexes the information for retrieval. A document-based search component takes a keyword query and returns the docIDs of the top documents matching with the query. A retrieval component takes a docID as input, accesses the information stored by the indexing component and returns the set of mentions of named entities in the document. This information is then passed to an entity scoring and thresholding component that computes an aggregate score of each entity and selects the entities to return to the user.

Abstract translation: 用于查找网络搜索查询的相关实体的架构。 提取组件将文档作为输入并输出所有实体的所有提及（或出现），例如文档中的人员，组织，位置和产品的名称以及实体元数据。 索引组件采用文档标识符（docID）和命名实体的提及集合，并存储和索引信息进行检索。 基于文档的搜索组件接受关键字查询，并返回与查询匹配的顶级文档的docID。 检索组件将docID作为输入，访问由索引组件存储的信息，并返回文档中命名实体的提及集。 然后将该信息传递给实体计分和阈值组件，该组件计算每个实体的聚合分数，并选择要返回给用户的实体。

公开(公告)号：US08150790B2

公开(公告)日：2012-04-03

申请号：US11669782

申请日：2007-01-31

Applicant: Nicolas Bruno ,  Surajit Chaudhuri

Inventor： Nicolas Bruno ,  Surajit Chaudhuri

IPC: G06N5/02

CPC classification number: G06F17/30306

Abstract: 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).

Abstract translation: 轻量级物理设计报警器可以分析工作负载并确定综合调优会话是否会导致配置改进超过当前配置。 报警器提供了一个低开销的过程，可以在数据库管理系统的正常操作期间运行，并在当前配置不太适合的情况下产生通知。 报警器可以报告如果启动综合调整工具可以获得的改进的上下限。 可以通过生成可行的配置来证明下限。 所公开的实施例可以扩展到查询更新，物化视图和其他物理设计特征（例如，分区）。

公开(公告)号：US20110320446A1

公开(公告)日：2011-12-29

申请号：US12823124

申请日：2010-06-25

Applicant: Kaushik Chakrabarti ,  Surajit Chaudhuri ,  Venkatesh Ganti

Inventor： Kaushik Chakrabarti ,  Surajit Chaudhuri ,  Venkatesh Ganti

IPC: G06F17/30

CPC classification number: G06F16/90335

Abstract: This patent application relates to interval-based information retrieval (IR) search techniques for efficiently and correctly answering keyword search queries. In some embodiments, a range of information-containing blocks for a search query can be identified. Each of these blocks, and thus the range, can include document identifiers that identify individual corresponding documents that contain a term found in the search query. From the range, a subrange(s) having a smaller number of blocks than the range can be selected. This can be accomplished without decompressing the blocks by partitioning the range into intervals and evaluating the intervals. The smaller number of blocks in the subranges(s) can then be decompressed and processed to identify a doc ID(s) and thus document(s) that satisfies the query.

Abstract translation: 该专利申请涉及用于有效和正确地回答关键词搜索查询的基于间隔的信息检索（IR）搜索技术。 在一些实施例中，可以识别用于搜索查询的一系列含有信息的块。 这些块中的每个以及因此的范围可以包括识别包含在搜索查询中找到的术语的各个对应文档的文档标识符。 从该范围可以选择具有比该范围少的块数量的子范围。 这可以在不通过将范围划分成间隔并且评估间隔来解压缩块的情况下实现。 然后可以解压缩和处理子范围中较小数量的块，以识别文档ID，从而识别符合查询的文档。