Providing context aware search adaptively
    1.
    发明授权
    Providing context aware search adaptively 有权
    自适应地提供上下文感知搜索

    公开(公告)号:US08447785B2

    公开(公告)日:2013-05-21

    申请号:US12792659

    申请日:2010-06-02

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30929

    摘要: A method, computing device, and a non-transitory computer-readable medium is provided for facilitating a context-aware search on documents stored in an unstructured database column. The database server determines whether a document stored in an unstructured database object is marked up according to a recognized markup language. Documents that conform to the markup language are indexed with value-to-node mappings and node-to-physical-location mappings to provide a context-aware search of marked up nodes within the documents. Documents that do not conform to the markup language are indexed with value-to-document mappings to provide a full-text search of the documents. The database server evaluates a context-aware search against documents that conform to the markup language within the unstructured column without requiring the user identify the documents as XML documents and store the documents in an XMLType structured column.

    摘要翻译: 提供了一种方法,计算设备和非暂时计算机可读介质,用于便于对存储在非结构化数据库列中的文档的上下文感知搜索。 数据库服务器确定存储在非结构化数据库对象中的文档是否根据识别的标记语言进行标记。 符合标记语言的文档使用值到节点映射和节点到物理位置映射进行索引,以提供文档中标记节点的上下文感知搜索。 不符合标记语言的文档使用值到文档的映射进行索引,以提供文档的全文搜索。 数据库服务器根据非结构化列中符合标记语言的文档评估上下文感知搜索,而不需要用户将文档标识为XML文档,并将文档存储在XMLType结构化列中。

    PROVIDING CONTEXT AWARE SEARCH ADAPTIVELY
    2.
    发明申请
    PROVIDING CONTEXT AWARE SEARCH ADAPTIVELY 有权
    提供背景知识搜索自适应

    公开(公告)号:US20110302189A1

    公开(公告)日:2011-12-08

    申请号:US12792659

    申请日:2010-06-02

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30929

    摘要: A method, computing device, and a non-transitory computer-readable medium is provided for facilitating a context-aware search on documents stored in an unstructured database column. The database server determines whether a document stored in an unstructured database object is marked up according to a recognized markup language. Documents that conform to the markup language are indexed with value-to-node mappings and node-to-physical-location mappings to provide a context-aware search of marked up nodes within the documents. Documents that do not conform to the markup language are indexed with value-to-document mappings to provide a full-text search of the documents. The database server evaluates a context-aware search against documents that conform to the markup language within the unstructured column without requiring the user identify the documents as XML documents and store the documents in an XMLType structured column.

    摘要翻译: 提供了一种方法,计算设备和非暂时计算机可读介质,用于便于对存储在非结构化数据库列中的文档的上下文感知搜索。 数据库服务器确定存储在非结构化数据库对象中的文档是否根据识别的标记语言进行标记。 符合标记语言的文档使用值到节点映射和节点到物理位置映射进行索引,以提供文档中标记节点的上下文感知搜索。 不符合标记语言的文档使用值到文档的映射进行索引,以提供文档的全文搜索。 数据库服务器根据非结构化列中符合标记语言的文档评估上下文感知搜索,而不需要用户将文档标识为XML文档,并将文档存储在XMLType结构化列中。

    Searching backward to speed up query
    3.
    发明授权
    Searching backward to speed up query 有权
    向后搜索以加快查询速度

    公开(公告)号:US08566343B2

    公开(公告)日:2013-10-22

    申请号:US12871869

    申请日:2010-08-30

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30539

    摘要: A method, computing device, and a non-transitory computer-readable medium are provided for performing a context-aware search by finding a set of nodes that are mapped to a given text or other value and, for each node in the set of nodes, performing a reverse path lookup to determine whether the node satisfies a given context. The query processor performs the reverse path lookup for a node by traversing up a node tree away from the node, using a stored mapping from the node to a parent of the node. Using mappings from nodes to parent nodes, the node tree is traversed backwards from the node up to distant ancestor nodes through parent nodes. An optimizer instructs the query processor to perform a value-based portion of the search before a path-based portion of the search based on value distribution statistics and path distribution statistics.

    摘要翻译: 提供了一种方法,计算设备和非暂时计算机可读介质,用于通过找到映射到给定文本或其他值的节点集合来执行上下文感知搜索,并且对于节点集合中的每个节点 ,执行反向路径查找以确定节点是否满足给定的上下文。 查询处理器通过使用存储的从节点到节点的父节点的映射来遍历节点之外的节点树来执行对节点的反向路径查找。 使用从节点到父节点的映射,节点树通过父节点从节点向后穿过远处的祖先节点。 优化器指示查询处理器在基于值分布统计和路径分布统计的基于路径的搜索部分之前执行搜索的基于值的部分。

    SEARCHING BACKWARD TO SPEED UP QUERY
    4.
    发明申请
    SEARCHING BACKWARD TO SPEED UP QUERY 有权
    搜索向后速度查询

    公开(公告)号:US20110302198A1

    公开(公告)日:2011-12-08

    申请号:US12871869

    申请日:2010-08-30

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30539

    摘要: A method, computing device, and a non-transitory computer-readable medium are provided for performing a context-aware search by finding a set of nodes that are mapped to a given text or other value and, for each node in the set of nodes, performing a reverse path lookup to determine whether the node satisfies a given context. The query processor performs the reverse path lookup for a node by traversing up a node tree away from the node, using a stored mapping from the node to a parent of the node. Using mappings from nodes to parent nodes, the node tree is traversed backwards from the node up to distant ancestor nodes through parent nodes. An optimizer instructs the query processor to perform a value-based portion of the search before a path-based portion of the search based on value distribution statistics and path distribution statistics.

    摘要翻译: 提供了一种方法,计算设备和非暂时计算机可读介质,用于通过找到映射到给定文本或其他值的节点集合来执行上下文感知搜索,并且对于节点集合中的每个节点 ,执行反向路径查找以确定节点是否满足给定的上下文。 查询处理器通过使用存储的从节点到节点的父节点的映射来遍历节点之外的节点树来执行对节点的反向路径查找。 使用从节点到父节点的映射,节点树通过父节点从节点向后穿过远处的祖先节点。 优化器指示查询处理器在基于值分布统计和路径分布统计的基于路径的搜索部分之前执行搜索的基于值的部分。

    Efficient evaluation of XQuery and XPath full text extension
    5.
    发明授权
    Efficient evaluation of XQuery and XPath full text extension 有权
    高效评估XQuery和XPath全文扩展

    公开(公告)号:US08312030B2

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

    申请号:US12388249

    申请日:2009-02-18

    IPC分类号: G06F17/30 G06F7/00

    CPC分类号: G06F17/30929

    摘要: Techniques are provided for efficiently evaluating XML queries that conform to an extension of an XML language (e.g., XQuery or XPath). The extension allows XML queries to have full-text search capabilities. Such an XML query is compiled to generate a tree of nodes that correspond to one or more conditions in the full-text portion of the query. In one technique, the amount of memory for the execution state of the tree is determined at compile time and allocated only once throughout execution of the query. In another technique, to ensure at most a single scan of a document, all the words or phrases in the full-text portion of an XML query are located before any of the other conditions in the full-text portion are evaluated. In another technique, the elements of the full-text portion of an XML query are analyzed to determine, based at least in part on cost, which evaluation strategy, of a plurality of evaluation strategies, should be employed.

    摘要翻译: 提供了有效评估符合XML语言(例如,XQuery或XPath)的扩展的XML查询的技术。 该扩展允许XML查询具有全文搜索功能。 编译这样的XML查询以生成与查询的全文部分中的一个或多个条件相对应的节点树。 在一种技术中,树的执行状态的内存量在编译时确定,并且在执行查询时只分配一次。 在另一种技术中,为了确保文档的单次扫描,XML查询的全文部分中的所有单词或短语位于全文部分中的任何其他条件之前。 在另一技术中,分析XML查询的全文部分的元素,至少部分地基于成本来确定应当采用多个评估策略的哪个评估策略。

    EFFICIENT EVALUATION OF XQUERY AND XPATH FULL TEXT EXTENSION
    6.
    发明申请
    EFFICIENT EVALUATION OF XQUERY AND XPATH FULL TEXT EXTENSION 有权
    XQUERY和XPATH全文扩展的有效评估

    公开(公告)号:US20100211560A1

    公开(公告)日:2010-08-19

    申请号:US12388249

    申请日:2009-02-18

    IPC分类号: G06F17/30 G06F12/02 G06F7/00

    CPC分类号: G06F17/30929

    摘要: Techniques are provided for efficiently evaluating XML queries that conform to an extension of an XML language (e.g., XQuery or XPath). The extension allows XML queries to have full-text search capabilities. Such an XML query is compiled to generate a tree of nodes that correspond to one or more conditions in the full-text portion of the query. In one technique, the amount of memory for the execution state of the tree is determined at compile time and allocated only once throughout execution of the query. In another technique, to ensure at most a single scan of a document, all the words or phrases in the full-text portion of an XML query are located before any of the other conditions in the full-text portion are evaluated. In another technique, the elements of the full-text portion of an XML query are analyzed to determine, based at least in part on cost, which evaluation strategy, of a plurality of evaluation strategies, should be employed.

    摘要翻译: 提供了有效评估符合XML语言(例如,XQuery或XPath)的扩展的XML查询的技术。 该扩展允许XML查询具有全文搜索功能。 编译这样的XML查询以生成与查询的全文部分中的一个或多个条件相对应的节点树。 在一种技术中,树的执行状态的内存量在编译时确定,并且在执行查询时只分配一次。 在另一种技术中,为了确保文档的单次扫描,XML查询的全文部分中的所有单词或短语位于全文部分中的任何其他条件之前。 在另一技术中,分析XML查询的全文部分的元素,至少部分地基于成本来确定应当采用多个评估策略的哪个评估策略。

    EFFICIENT XML TREE INDEXING STRUCTURE OVER XML CONTENT
    7.
    发明申请
    EFFICIENT XML TREE INDEXING STRUCTURE OVER XML CONTENT 审中-公开
    有效的XML树在XML内容中引用结构

    公开(公告)号:US20140067819A1

    公开(公告)日:2014-03-06

    申请号:US13604402

    申请日:2012-09-05

    IPC分类号: G06F17/30

    CPC分类号: G06F16/83

    摘要: A method and apparatus are provided for building and using a persistent XML tree index for navigating an XML document. The XML tree index is stored separately from the XML document content, and thus is able to optimize performance through the use of fixed-sized index entries. The XML document hierarchy need not be constructed in volatile memory, so creating and using the XML tree index scales even for large documents. To evaluate a path expression including descendent or ancestral syntax, navigation links can be read from persistent storage and used directly to find the nodes specified in the path expression. The use of an abstract navigational interface allows applications to be written that are independent of the storage implementation of the index and the content. Thus, the XML tree index can index documents stored at least in a database, a persistent file system, or as a sequence of in memory.

    摘要翻译: 提供了一种用于构建和使用用于导航XML文档的持久XML树索引的方法和装置。 XML树索引与XML文档内容分开存储,因此能够通过使用固定大小的索引条目来优化性能。 XML文档层次结构不需要在易失性存储器中构建,因此创建和使用XML树索引即使对于大型文档也会进行缩放。 要评估包含后代或祖先语法的路径表达式,导航链接可以从持久存储读取,并直接用于查找路径表达式中指定的节点。 使用抽象导航界面允许写入独立于索引和内容的存储实现的应用程序。 因此,XML树索引可以索引至少存储在数据库中的文档,持久文件系统或作为内存中的序列。

    Efficient XML tree indexing structure over XML content
    8.
    发明授权
    Efficient XML tree indexing structure over XML content 有权
    XML内容上高效的XML树索引结构

    公开(公告)号:US08266151B2

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

    申请号:US12610047

    申请日:2009-10-30

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F17/30911

    摘要: A method and apparatus are provided for building and using a persistent XML tree index for navigating an XML document. The XML tree index is stored separately from the XML document content, and thus is able to optimize performance through the use of fixed-sized index entries. The XML document hierarchy need not be constructed in volatile memory, so creating and using the XML tree index scales even for large documents. To evaluate a path expression including descendent or ancestral syntax, navigation links can be read from persistent storage and used directly to find the nodes specified in the path expression. The use of an abstract navigational interface allows applications to be written that are independent of the storage implementation of the index and the content. Thus, the XML tree index can index documents stored at least in a database, a persistent file system, or as a sequence of in memory.

    摘要翻译: 提供了一种用于构建和使用用于导航XML文档的持久XML树索引的方法和装置。 XML树索引与XML文档内容分开存储,因此能够通过使用固定大小的索引条目来优化性能。 XML文档层次结构不需要在易失性存储器中构建,因此创建和使用XML树索引即使对于大型文档也会进行缩放。 要评估包含后代或祖先语法的路径表达式,导航链接可以从持久存储读取,并直接用于查找路径表达式中指定的节点。 使用抽象导航界面允许写入独立于索引和内容的存储实现的应用程序。 因此,XML树索引可以索引至少存储在数据库中的文档,持久文件系统或作为内存中的序列。

    Efficient XML Tree Indexing Structure Over XML Content
    9.
    发明申请
    Efficient XML Tree Indexing Structure Over XML Content 有权
    XML内容上的高效XML树索引结构

    公开(公告)号:US20110106811A1

    公开(公告)日:2011-05-05

    申请号:US12610047

    申请日:2009-10-30

    IPC分类号: G06F7/00 G06F17/00

    CPC分类号: G06F17/30911

    摘要: A method and apparatus are provided for building and using a persistent XML tree index for navigating an XML document. The XML tree index is stored separately from the XML document content, and thus is able to optimize performance through the use of fixed-sized index entries. The XML document hierarchy need not be constructed in volatile memory, so creating and using the XML tree index scales even for large documents. To evaluate a path expression including descendent or ancestral syntax, navigation links can be read from persistent storage and used directly to find the nodes specified in the path expression. The use of an abstract navigational interface allows applications to be written that are independent of the storage implementation of the index and the content. Thus, the XML tree index can index documents stored at least in a database, a persistent file system, or as a sequence of in memory.

    摘要翻译: 提供了一种用于构建和使用用于导航XML文档的持久XML树索引的方法和装置。 XML树索引与XML文档内容分开存储,因此能够通过使用固定大小的索引条目来优化性能。 XML文档层次结构不需要在易失性存储器中构建,因此创建和使用XML树索引即使对于大型文档也会进行缩放。 要评估包含后代或祖先语法的路径表达式,导航链接可以从持久存储读取,并直接用于查找路径表达式中指定的节点。 使用抽象导航界面允许写入独立于索引和内容的存储实现的应用程序。 因此,XML树索引可以索引至少存储在数据库中的文档,持久文件系统或作为内存中的序列。

    Efficient XML tree indexing structure over XML content

    公开(公告)号:US10698953B2

    公开(公告)日:2020-06-30

    申请号:US13604402

    申请日:2012-09-05

    IPC分类号: G06F7/00 G06F17/30 G06F16/83

    摘要: A method and apparatus are provided for building and using a persistent XML tree index for navigating an XML document. The XML tree index is stored separately from the XML document content, and thus is able to optimize performance through the use of fixed-sized index entries. The XML document hierarchy need not be constructed in volatile memory, so creating and using the XML tree index scales even for large documents. To evaluate a path expression including descendent or ancestral syntax, navigation links can be read from persistent storage and used directly to find the nodes specified in the path expression. The use of an abstract navigational interface allows applications to be written that are independent of the storage implementation of the index and the content. Thus, the XML tree index can index documents stored at least in a database, a persistent file system, or as a sequence of in memory.