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

1. 发明授权

US07386541B2 System and method for compiling an extensible markup language based query 有权
标题翻译：用于编译可扩展标记语言的查询的系统和方法
公开(公告)号：US07386541B2
公开(公告)日：2008-06-10
申请号：US10803283
申请日：2004-03-18
申请人： Shankar Pal , Istvan Cseri , Oliver Seeliger , Gideon Schaller , Adrian Baras , Wei Yu , Denis Churin , Peter Kukol
发明人： Shankar Pal , Istvan Cseri , Oliver Seeliger , Gideon Schaller , Adrian Baras , Wei Yu , Denis Churin , Peter Kukol
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30932 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99942 , Y10S707/99943
摘要： An extensible markup language (XML) expression included in a query is parsed to yield an abstract syntax tree. The abstract syntax tree is then transformed into a unified tree including XML algebra operations. The unified tree is then converted into a relational tree including enhanced relational algebra operations. The relational tree is then forwarded to a query processor for optimization and execution of the query at the query processor.
摘要翻译：解析包含在查询中的可扩展标记语言（XML）表达式以生成抽象语法树。然后将抽象语法树转换为包含XML代数操作的统一树。然后将统一树转换成关系树，包括增强的关系代数运算。然后将关系树转发到查询处理器，以在查询处理器处优化和执行查询。

2. 发明申请

US20050210002A1 System and method for compiling an extensible markup language based query 有权
标题翻译：用于编译可扩展标记语言的查询的系统和方法
公开(公告)号：US20050210002A1
公开(公告)日：2005-09-22
申请号：US10803283
申请日：2004-03-18
申请人： Shankar Pal , Istvan Cseri , Oliver Seeliger , Gideon Schaller , Adrian Baras , Wei Yu , Denis Churin , Peter Kukol
发明人： Shankar Pal , Istvan Cseri , Oliver Seeliger , Gideon Schaller , Adrian Baras , Wei Yu , Denis Churin , Peter Kukol
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30932 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99942 , Y10S707/99943
摘要： An extensible markup language (XML) expression included in a query is parsed to yield an abstract syntax tree. The abstract syntax tree is then transformed into a unified tree including XML algebra operations. The unified tree is then converted into a relational tree including enhanced relational algebra operations. The relational tree is then forwarded to a query processor for optimization and execution of the query at the query processor.
摘要翻译：解析包含在查询中的可扩展标记语言（XML）表达式以生成抽象语法树。然后将抽象语法树转换为包含XML代数操作的统一树。然后将统一树转换成关系树，包括增强的关系代数运算。然后将关系树转发到查询处理器，以在查询处理器处优化和执行查询。

3. 发明申请

US20050091188A1 Indexing XML datatype content system and method 有权
标题翻译：索引XML数据类型内容系统和方法
公开(公告)号：US20050091188A1
公开(公告)日：2005-04-28
申请号：US10693750
申请日：2003-10-24
申请人： Shankar Pal , Istvan Cseri , Gideon Schaller , Oliver Seeliger , Denis Altudov , Denis Churin , Sameer Verkhedkar
发明人： Shankar Pal , Istvan Cseri , Gideon Schaller , Oliver Seeliger , Denis Altudov , Denis Churin , Sameer Verkhedkar
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30911 , Y10S707/99942 , Y10S707/99944
摘要： Storing and querying XML data in a primary table or document utilizes an index of XML data and includes creating a primary table structure, creating a primary XML index commensurate with the primary table structure, populating the primary table and the primary XML index, and running a query on the XML data in a primary table by utilizing the XML index. The XML index can be implemented as a node table. The node table may have a B+-tree structure and be populated by shredding the XML values in the primary table. The XML data may be stored as binary large objects in an XML column of the primary table. Secondary XML indexes may be created to assist in the search and retrieval of XML data stored in the primary table. Both the primary XML index and the secondary XML index tables may be created using data definition language statements.
摘要翻译：在主表或文档中存储和查询XML数据使用XML数据索引，包括创建主表结构，创建与主表结构相称的主XML索引，填充主表和主XML索引，并运行通过利用XML索引对主表中的XML数据进行查询。 XML索引可以实现为节点表。节点表可以具有B + SUPERTree结构，并且通过对主表中的XML值进行粉碎来填充。 XML数据可以作为二进制大对象存储在主表的XML列中。可以创建辅助XML索引以帮助搜索和检索存储在主表中的XML数据。主XML索引和辅助XML索引表都可以使用数据定义语言语句创建。

4. 发明申请

US20050177551A1 Systems and methods for the implementation of unordered and ordered collections in a data store 有权
标题翻译：在数据存储中实现无序和有序集合的系统和方法
公开(公告)号：US20050177551A1
公开(公告)日：2005-08-11
申请号：US11027416
申请日：2004-12-30
申请人： Balaji Rathakrishnan , Beysim Sezgin , Denis Altudov , Jose Blakeley , Oliver Seeliger , Ramachandran Venkatesh , Wei Yu , Dragan Tomic , Denis Churin , Bruno Denuit , Conor Cunningham , Stefano Stefani
发明人： Balaji Rathakrishnan , Beysim Sezgin , Denis Altudov , Jose Blakeley , Oliver Seeliger , Ramachandran Venkatesh , Wei Yu , Dragan Tomic , Denis Churin , Bruno Denuit , Conor Cunningham , Stefano Stefani
IPC分类号： G06F17/30
CPC分类号： G06F17/30595 , G06F17/30607 , Y10S707/99934
摘要： Several embodiments of the present invention are directed to systems and methods for extending the UDT framework of an extended relational data store (ERDS) to include support for unordered collections (multisets) and ordered collection (lists). More specifically, several embodiments of the present invention use an UDT infrastructure, CLR generics, and a new UNNEST operator to create and utilize a special type abstraction for collections that is simultaneously a scalar and a relation. As a scalar, this collection type can be processed by all parts of the data store engine that understand scalars (including but not limited to the client stack) and, as a relation, this collection type is queriable like any other type of relation.
摘要翻译：本发明的几个实施例涉及用于扩展扩展关系数据存储（ERDS）的UDT框架以包括对无序集合（多集）和有序集合（列表）的支持的系统和方法。更具体地，本发明的几个实施例使用UDT基础设施，CLR泛型和新的UNNEST运算符来创建并利用同时是标量和关系的集合的特殊类型抽象。作为一个标量，这种集合类型可以由数据存储引擎的所有部分进行处理，这些数据存储引擎能够理解标量（包括但不限于客户端堆栈），作为一种关系，该集合类型可以像任何其他类型的关系一样被查询。

5. 发明申请

US20070005632A1 Method for efficient maintenance of XML indexes 失效
标题翻译：有效维护XML索引的方法
公开(公告)号：US20070005632A1
公开(公告)日：2007-01-04
申请号：US11171769
申请日：2005-06-30
申请人： Stefano Stefani , Denis Churin , Istvan Cseri
发明人： Stefano Stefani , Denis Churin , Istvan Cseri
IPC分类号： G06F7/00
CPC分类号： G06F17/30911 , G06F17/30336 , Y10S707/99933 , Y10S707/99952
摘要： An update to a primary table is received. The primary table is read to determine the set of rows to be updated. The primary table is updated and XML objects stored in XML columns are overwritten according to the update. A pre-update node table comprising the nodes corresponding to the updated rows is created from an XML index table corresponding to the primary table. A post-update node table is created by shedding the updated XML objects. The post-update table and the pre-update table are merged according to their node identifiers. The resulting merged table can be inspected to determine which nodes have been, added, deleted, or updated. Based on this inspection, the necessary additions and deletions can be efficiently made to the XML index table.
摘要翻译：接收到主表的更新。读取主表以确定要更新的行集。更新主表，并根据更新覆盖存储在XML列中的XML对象。包括与更新的行相对应的节点的预更新节点表从与主表对应的XML索引表创建。通过删除更新的XML对象来创建更新后节点表。后更新表和更新前的表根据其节点标识符进行合并。可以检查产生的合并表以确定哪些节点已被添加，删除或更新。基于此检查，可以有效地对XML索引表进行必要的添加和删除。

6. 发明授权

US07437371B2 Systems and methods for the implementation of unordered and ordered collections in a data store 有权
标题翻译：在数据存储中实现无序和有序集合的系统和方法
公开(公告)号：US07437371B2
公开(公告)日：2008-10-14
申请号：US11027416
申请日：2004-12-30
申请人： Balaji Rathakrishnan , Beysim Sezgin , Denis Y. Altudov , Jose A. Blakeley , Oliver Nicholas Seeliger , Ramachandran Venkatesh , Wei Yu , Dragan Tomic , Denis Churin , Bruno H. M. Denuit , Conor J. Cunningham , Stefano Stefani
发明人： Balaji Rathakrishnan , Beysim Sezgin , Denis Y. Altudov , Jose A. Blakeley , Oliver Nicholas Seeliger , Ramachandran Venkatesh , Wei Yu , Dragan Tomic , Denis Churin , Bruno H. M. Denuit , Conor J. Cunningham , Stefano Stefani
IPC分类号： G06F17/00
CPC分类号： G06F17/30595 , G06F17/30607 , Y10S707/99934
摘要： Several embodiments of the present invention are directed to systems and methods for extending the UDT framework of an extended relational data store (ERDS) to include support for unordered collections (multisets) and ordered collection (lists). More specifically, several embodiments of the present invention use an UDT infrastructure, CLR generics, and a new UNNEST operator to create and utilize a special type abstraction for collections that is simultaneously a scalar and a relation. As a scalar, this collection type can be processed by all parts of the data store engine that understand scalars (including but not limited to the client stack) and, as a relation, this collection type is queriable like any other type of relation.
摘要翻译：本发明的几个实施例涉及用于扩展扩展关系数据存储（ERDS）的UDT框架以包括对无序集合（多集）和有序集合（列表）的支持的系统和方法。更具体地，本发明的几个实施例使用UDT基础设施，CLR泛型和新的UNNEST运算符来创建并利用同时是标量和关系的集合的特殊类型抽象。作为一个标量，这种集合类型可以由数据存储引擎的所有部分进行处理，这些数据存储引擎能够理解标量（包括但不限于客户端堆栈），作为一种关系，该集合类型可以像任何其他类型的关系一样被查询。

7. 发明授权

US07853603B2 User-defined relevance ranking for search 有权
标题翻译：用户定义的搜索相关性排名
公开(公告)号：US07853603B2
公开(公告)日：2010-12-14
申请号：US11805380
申请日：2007-05-23
申请人： Denis Churin , Jingwei Lu , Nimish Khanolkar , Sundaram Narayanan , Tapas Nayak , Feng Tian
发明人： Denis Churin , Jingwei Lu , Nimish Khanolkar , Sundaram Narayanan , Tapas Nayak , Feng Tian
IPC分类号： G05F17/30
CPC分类号： G06F17/30678 , G06F17/3053
摘要： Detailed herein is a technology which, among other things, allows a search engine to utilize a user-defined relevance function. In one approach to the technology, a method of applying a user-defined relevance function is described. In this approach, a complex search query is decomposed into a simple operator. The simple operator is associated with the user-defined relevance function. A document which matches the search query is retrieved, and a rank is calculated for the document, using the user-defined relevance function.
摘要翻译：本文详细描述了一种技术，其特征在于允许搜索引擎利用用户定义的相关性功能。在技术的一种方法中，描述了应用用户定义的相关性功能的方法。在这种方法中，复杂的搜索查询被分解成一个简单的运算符。简单的运算符与用户定义的相关函数相关联。检索与搜索查询匹配的文档，并且使用用户定义的相关性函数为文档计算等级。

8. 发明申请

US20080294620A1 User-defined relevance ranking for search 有权
标题翻译：用户定义的搜索相关性排名
公开(公告)号：US20080294620A1
公开(公告)日：2008-11-27
申请号：US11805380
申请日：2007-05-23
申请人： Denis Churin , Jingwei Lu , Nimish Khanolkar , Sundaram Narayanan , Tapas Nayak , Feng Tian
发明人： Denis Churin , Jingwei Lu , Nimish Khanolkar , Sundaram Narayanan , Tapas Nayak , Feng Tian
IPC分类号： G06F17/30
CPC分类号： G06F17/30678 , G06F17/3053
摘要： Detailed herein is a technology which, among other things, allows a search engine to utilize a user-defined relevance function. In one approach to the technology, a method of applying a user-defined relevance function is described. In this approach, a complex search query is decomposed into a simple operator. The simple operator is associated with the user-defined relevance function. A document which matches the search query is retrieved, and a rank is calculated for the document, using the user-defined relevance function.
摘要翻译：本文详细描述了一种技术，其特征在于允许搜索引擎利用用户定义的相关性功能。在技术的一种方法中，描述了应用用户定义的相关性功能的方法。在这种方法中，复杂的搜索查询被分解成一个简单的运算符。简单的运算符与用户定义的相关函数相关联。检索与搜索查询匹配的文档，并且使用用户定义的相关性函数为文档计算等级。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式