Virtual cursors for XML joins
    1.
    发明申请
    Virtual cursors for XML joins 有权
    XML连接的虚拟游标

    公开(公告)号:US20070112813A1

    公开(公告)日:2007-05-17

    申请号:US11270784

    申请日:2005-11-08

    IPC分类号: G06F7/00

    CPC分类号: G06F17/30935

    摘要: A system, method, and computer program product to improve XML query processing efficiency with virtual cursors. Structural joins are a fundamental operation in XML query processing, and substantial work exists on index-based algorithms for executing them. Two well-known index features—path indices and ancestor information—are combined in a novel way to replace at least some of the physical index cursors in a structural join with virtual cursors. The position of a virtual cursor is derived from the path and ancestor information of a physical cursor. Virtual cursors can be easily incorporated into existing structural join algorithms. By eliminating index I/O and the processing cost of handling physical inverted lists, virtual cursors can improve the performance of holistic path queries by an order of magnitude or more.

    摘要翻译: 一种使用虚拟游标来提高XML查询处理效率的系统,方法和计算机程序产品。 结构连接是XML查询处理中的基本操作,并且基于索引的算法存在大量工作来执行它们。 两个众所周知的索引特征 - 路径索引和祖先信息 - 以一种新颖的方式组合,以用至少一些物理索引光标替换虚拟光标的结构连接。 虚拟光标的位置是从物理光标的路径和祖先信息导出的。 虚拟光标可以很容易地并入到现有的结构连接算法中。 通过消除索引I / O和处理物理反转列表的处理成本,虚拟游标可以将整体路径查询的性能提高一个数量级或更多。

    Adaptive Evaluation of Text Search Queries With Blackbox Scoring Functions
    5.
    发明申请
    Adaptive Evaluation of Text Search Queries With Blackbox Scoring Functions 失效
    使用Blackbox评分函数自适应评估文本搜索查询

    公开(公告)号:US20070150467A1

    公开(公告)日:2007-06-28

    申请号:US11561949

    申请日:2006-11-21

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30672

    摘要: Disclosed is an evaluation technique for text search with black-box scoring functions, where it is unnecessary for the evaluation engine to maintain details of the scoring function. Included is a description of a system for dealing with blackbox searching, proofs of correctness, as well experimental evidence showing that the performance of the technique is comparable in efficiency to those techniques used in custom-built engines.

    摘要翻译: 公开了一种用于具有黑匣子评分功能的文本搜索的评估技术,其中评估引擎不需要保持评分功能的细节。 包括处理黑箱搜索的系统的描述,正确性的证明,以及实验证据表明该技术的性能与定制引擎中使用的技术的效率相当。

    Virtual cursors for XML joins
    6.
    发明授权
    Virtual cursors for XML joins 有权
    XML连接的虚拟游标

    公开(公告)号:US07685138B2

    公开(公告)日:2010-03-23

    申请号:US11270784

    申请日:2005-11-08

    IPC分类号: G06F17/30 G06F7/00

    CPC分类号: G06F17/30935

    摘要: A system, method, and computer program product to improve XML query processing efficiency with virtual cursors. Structural joins are a fundamental operation in XML query processing, and substantial work exists on index-based algorithms for executing them. Two well-known index features—path indices and ancestor information—are combined in a novel way to replace at least some of the physical index cursors in a structural join with virtual cursors. The position of a virtual cursor is derived from the path and ancestor information of a physical cursor. Virtual cursors can be easily incorporated into existing structural join algorithms. By eliminating index I/O and the processing cost of handling physical inverted lists, virtual cursors can improve the performance of holistic path queries by an order of magnitude or more.

    摘要翻译: 一种使用虚拟游标来提高XML查询处理效率的系统,方法和计算机程序产品。 结构连接是XML查询处理中的基本操作,并且基于索引的算法存在大量工作来执行它们。 两个众所周知的索引特征 - 路径索引和祖先信息 - 以一种新颖的方式组合,以用至少一些物理索引光标替换虚拟光标的结构连接。 虚拟光标的位置是从物理光标的路径和祖先信息导出的。 虚拟光标可以很容易地并入到现有的结构连接算法中。 通过消除索引I / O和处理物理反转列表的处理成本,虚拟游标可以将整体路径查询的性能提高一个数量级或更多。

    Method for cataloging, filtering, and relevance ranking frame-based hierarchical information structures
    8.
    发明授权
    Method for cataloging, filtering, and relevance ranking frame-based hierarchical information structures 有权
    编目,过滤和相关性排序基于帧的层次信息结构的方法

    公开(公告)号:US06334131B2

    公开(公告)日:2001-12-25

    申请号:US09143733

    申请日:1998-08-29

    IPC分类号: G06F1730

    摘要: A method for cataloging, filtering and ranking information, as for example, World Wide Web pages of the Internet. The method is preferably implemented in computer software and features steps for enabling a user to interactively create an information database including preferred information elements such as preferred-authority World Wide Web pages. The method includes steps for enabling a user to interactively create a frame-based, hierarchical organizational structure for the information elements, and steps for identifying and automatically filtering and ranking by relevance, information elements, such as World Wide Web pages for populating the structure, to form, for example, a searchable, World Wide Web page database. Additionally, the method features steps for enabling a user to interactively define a frame-based, hierarchical information structure for cataloging information, identifying a preliminary population of information elements for a particular hierarchical category arranged as a frame, based upon the respective frame attributes, and thereafter, expanding the information population to include related information, and subsequently, automatically filtering and ranking the information based upon relevance, and then populating the hierarchical structure with a definable portion of the filtered, ranked information elements.

    摘要翻译: 用于对信息进行编目,过滤和排序的方法,例如互联网的万维网页面。 该方法优选地在计算机软件中实现,并且特征步骤用于使得用户能够交互地创建包括诸如优选权威万维网页面之类的优选信息元素的信息数据库。 该方法包括使用户能够交互地创建用于信息元素的基于帧的分层组织结构的步骤,以及用于识别和自动过滤和排序相关性的步骤,诸如用于填充结构的万维网页面的信息元素, 以形成例如可搜索的万维网页数据库。 另外,该方法具有以下步骤:使得用户能够交互地定义用于编目信息的基于帧的分层信息结构,基于相应的帧属性来识别为排列为帧的特定分级类别的信息元素的初步总体,以及 此后,扩展信息群体以包括相关信息,随后基于相关性自动过滤和排序信息,然后用经过排序的信息元素的可定义部分填充分层结构。

    KNOWLEDGE-BASED DATA MINING SYSTEM
    9.
    发明申请
    KNOWLEDGE-BASED DATA MINING SYSTEM 审中-公开
    基于知识的数据挖掘系统

    公开(公告)号:US20120259890A1

    公开(公告)日:2012-10-11

    申请号:US13526424

    申请日:2012-06-18

    IPC分类号: G06F17/30

    CPC分类号: G06F16/951 G06F2216/03

    摘要: In a data mining system, data is gathered into a data store using, e.g., a Web crawler. The data is classified into entities. Data miners use rules to process the entities and append respective keys to the entities representing characteristics of the entities as derived from rules embodied in the miners. With these keys, characteristics of entities as defined by disparate expert authors of the data miners are identified for use in responding to complex data requests from customers.

    摘要翻译: 在数据挖掘系统中,使用例如Web爬行器将数据收集到数据存储中。 数据分为实体。 数据挖掘者使用规则来处理实体,并将相应的密钥附加到代表矿工特征的实体的实体。 利用这些密钥,确定数据挖掘者的不同专家作者定义的实体的特征用于响应客户的复杂数据请求。