会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明授权
    • Indexing mechanism for efficient node-aware full-text search over XML
    • 基于XML的高效节点感知全文检索的索引机制
    • US08219563B2
    • 2012-07-10
    • US12346327
    • 2008-12-30
    • Thomas BabyZhen Hua LiuWesley Lin
    • Thomas BabyZhen Hua LiuWesley Lin
    • G06F17/30
    • G06F17/30911
    • Techniques are provided for searching within a collection of XML documents. A relational table in an XML index stores an entry for each node of a set of nodes in the collection. Each entry of the relational table stores an order key and a path identifier along with the atomized value of the node. An index on the atomized value provides a mechanism to perform a node-aware full-text search. Instead of storing the atomized value in the table, a virtual column may be created to represent, for each node, the atomized value of the node. Alternately, each entry of the relational table stores an order key and a path identifier along with, for simple nodes, the atomized value, and for complex nodes, a null value. For a complex node with a descendant text node, a separate entry is stored for the descendant text node in the relational table.
    • 提供了在XML文档集合内进行搜索的技术。 XML索引中的关系表存储集合中一组节点的每个节点的条目。 关系表的每个条目存储订单密钥和路径标识符以及节点的雾化值。 雾化值上的索引提供了执行节点感知全文搜索的机制。 不用在表中存储雾化值,而是可以创建一个虚拟列,以便为每个节点表示节点的雾化值。 或者,关系表的每个条目存储订单密钥和路径标识符,对于简单节点,存在雾化值,对于复杂节点存储空值。 对于具有后代文本节点的复杂节点,为关系表中的后代文本节点存储单独的条目。
    • 12. 发明申请
    • Techniques for Optimizing SQL Statements Using User-Defined Indexes with Auxiliary Properties
    • 使用具有辅助属性的用户定义索引优化SQL语句的技术
    • US20090030874A1
    • 2009-01-29
    • US12027918
    • 2008-02-07
    • Dinesh DasWesley LinSeema Sundara
    • Dinesh DasWesley LinSeema Sundara
    • G06F7/06
    • G06F17/30463G06F17/30312G06F17/30471
    • In one embodiment, a database server registers one or more functions included in a user-defined index that includes one or more auxiliary properties. The database server receives a query that specifies one or more parameters. A query optimizer generates a plurality of execution plans for evaluating the query. The query optimizer estimates a plurality of total costs respectively associated with the plurality of execution plans, where estimating a particular total cost associated with a particular execution plan comprises: invoking the one or more functions with one or more function arguments based on the one or more parameters; receiving one or more index costs that are associated with using the one or more auxiliary properties of the user-defined index to evaluate the query; and determining the particular total cost based on the one or more index costs. From the plurality of execution plans, the query optimizer selects an optimal execution plan that is associated with an optimal total cost of the plurality of total costs.
    • 在一个实施例中,数据库服务器注册包括在包括一个或多个辅助属性的用户定义索引中的一个或多个功能。 数据库服务器接收一个指定一个或多个参数的查询。 查询优化器生成用于评估查询的多个执行计划。 查询优化器估计与多个执行计划分别相关联的多个总成本,其中估计与特定执行计划相关联的特定总成本包括:基于一个或多个参数调用具有一个或多个函数参数的一个或多个函数 参数; 接收与使用所述用户定义的索引的所述一个或多个辅助属性相关联的一个或多个索引成本来评估所述查询; 以及基于所述一个或多个索引成本确定所述特定总成本。 从多个执行计划中,查询优化器选择与多个总成本的最佳总成本相关联的最优执行计划。
    • 16. 发明授权
    • Techniques for optimizing SQL statements using user-defined indexes with auxiliary properties
    • 使用具有辅助属性的用户定义索引优化SQL语句的技术
    • US07925647B2
    • 2011-04-12
    • US12027918
    • 2008-02-07
    • Dinesh DasWesley LinSeema Sundara
    • Dinesh DasWesley LinSeema Sundara
    • G06F17/30
    • G06F17/30463G06F17/30312G06F17/30471
    • In one embodiment, a database server registers one or more functions included in a user-defined index that includes one or more auxiliary properties. The database server receives a query that specifies one or more parameters. A query optimizer generates a plurality of execution plans for evaluating the query. The query optimizer estimates a plurality of total costs respectively associated with the plurality of execution plans, where estimating a particular total cost associated with a particular execution plan comprises: invoking the one or more functions with one or more function arguments based on the one or more parameters; receiving one or more index costs that are associated with using the one or more auxiliary properties of the user-defined index to evaluate the query; and determining the particular total cost based on the one or more index costs. From the plurality of execution plans, the query optimizer selects an optimal execution plan that is associated with an optimal total cost of the plurality of total costs.
    • 在一个实施例中,数据库服务器注册包括在包括一个或多个辅助属性的用户定义索引中的一个或多个功能。 数据库服务器接收一个指定一个或多个参数的查询。 查询优化器生成用于评估查询的多个执行计划。 查询优化器估计与多个执行计划分别相关联的多个总成本,其中估计与特定执行计划相关联的特定总成本包括:基于一个或多个参数调用具有一个或多个函数参数的一个或多个函数 参数; 接收与使用所述用户定义的索引的所述一个或多个辅助属性相关联的一个或多个索引成本来评估所述查询; 以及基于所述一个或多个索引成本确定所述特定总成本。 从多个执行计划中,查询优化器选择与多个总成本的最佳总成本相关联的最优执行计划。
    • 17. 发明申请
    • Indexing Strategy With Improved DML Performance and Space Usage for Node-Aware Full-Text Search Over XML
    • 具有改进的DML性能的索引策略和用于节点感知的XML文档的全文搜索的空间使用
    • US20100185683A1
    • 2010-07-22
    • US12346393
    • 2008-12-30
    • Thomas BabyZhen Hua LiuWesley Lin
    • Thomas BabyZhen Hua LiuWesley Lin
    • G06F7/06G06F17/30
    • G06F17/30911
    • Techniques are provided for searching within a collection of XML documents. A relational table stores an entry for each node of a set of nodes in a collection of XML documents. Each entry of the relational table stores an order key and a path identifier along with the atomized value of the node. Instead of storing the atomized value in a full-text index, a virtual column can be created to represent, for each node, the atomized value of the node. Alternately, each entry of the relational table stores an order key and a path identifier along with, for simple nodes, the atomized value, and for complex nodes, a null value. For a complex node with a descendant text node, a separate entry is stored for the descendant text node in the relational table.
    • 提供了在XML文档集合内进行搜索的技术。 关系表存储XML文档集合中的一组节点的每个节点的条目。 关系表的每个条目存储订单密钥和路径标识符以及节点的雾化值。 不必将全部文本索引中的雾化值存储起来,可以创建虚拟列,以便为每个节点表示节点的雾化值。 或者,关系表的每个条目存储订单密钥和路径标识符,对于简单节点,存在雾化值,对于复杂节点存储空值。 对于具有后代文本节点的复杂节点,为关系表中的后代文本节点存储单独的条目。
    • 20. 发明申请
    • Indexing Mechanism for Efficient Node-Aware Full-Text Search Over XML
    • 用于高效节点感知的索引机制通过XML进行全文搜索
    • US20100169354A1
    • 2010-07-01
    • US12346327
    • 2008-12-30
    • Thomas BabyZhen Hua LiuWesley Lin
    • Thomas BabyZhen Hua LiuWesley Lin
    • G06F7/06G06F17/30
    • G06F17/30911
    • Techniques are provided for searching within a collection of XML documents. A relational table in an XML index stores an entry for each node of a set of nodes in the collection. Each entry of the relational table stores an order key and a path identifier along with the atomized value of the node. An index on the atomized value provides a mechanism to perform a node-aware full-text search. Instead of storing the atomized value in the table, a virtual column may be created to represent, for each node, the atomized value of the node. Alternately, each entry of the relational table stores an order key and a path identifier along with, for simple nodes, the atomized value, and for complex nodes, a null value. For a complex node with a descendant text node, a separate entry is stored for the descendant text node in the relational table.
    • 提供了在XML文档集合内进行搜索的技术。 XML索引中的关系表存储集合中一组节点的每个节点的条目。 关系表的每个条目存储订单密钥和路径标识符以及节点的雾化值。 雾化值上的索引提供了执行节点感知全文搜索的机制。 不用在表中存储雾化值,而是可以创建一个虚拟列,以便为每个节点表示节点的雾化值。 或者,关系表的每个条目存储订单密钥和路径标识符,对于简单节点,存在雾化值,对于复杂节点存储空值。 对于具有后代文本节点的复杂节点,为关系表中的后代文本节点存储单独的条目。