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

1. 发明授权

US07310634B2 Manipulating schematized data in a database 有权
标题翻译：在数据库中操作图形化数据
公开(公告)号：US07310634B2
公开(公告)日：2007-12-18
申请号：US11049153
申请日：2005-02-02
申请人： Arthur Zwiegincew , Mark H. Lucovsky , Christian Kleinerman , Eugene N. Nonko , Shaun D. Pierce
发明人： Arthur Zwiegincew , Mark H. Lucovsky , Christian Kleinerman , Eugene N. Nonko , Shaun D. Pierce
IPC分类号： G06F17/30
CPC分类号： G06F17/30415 , G06F17/30917 , G06F17/30929 , Y10S707/99933 , Y10S707/99934 , Y10S707/99942 , Y10S707/99943
摘要： Methods, systems, and computer program products for accessing data where the data store provider is abstracted from both the data manipulation language used to access the data and the schema that describes the data. A received request structured in accordance with the data manipulation language is represented in an intermediate form. From the intermediate representation, a native request for any of one or more data store providers may be produced. Before being returned to the requestor, a native response from data store provider may be formatted so that it is structured in accordance with the data manipulation language used for the request. A given request received by one computer system may cause a procedure to be generated for accessing the data store provider. When a later request is received by second computer system, the previously generated stored procedure may be reused if applicable.
摘要翻译：用于访问数据存储提供者从用于访问数据的数据操作语言和描述数据的模式中抽取数据的方法，系统和计算机程序产品。根据数据操作语言构造的接收到的请求以中间形式表示。从中间表示可以产生对一个或多个数据存储提供者中的任何一个的本机请求。在返回给请求者之前，来自数据存储提供者的本地响应可以被格式化，使得根据用于该请求的数据操作语言被构造。一个计算机系统接收到的给定请求可能导致生成用于访问数据存储提供者的过程。当第二计算机系统接收到稍后的请求时，如果适用，可以重新使用先前生成的存储过程。

2. 发明授权

US06917935B2 Manipulating schematized data in a database 有权
标题翻译：在数据库中操作图形化数据
公开(公告)号：US06917935B2
公开(公告)日：2005-07-12
申请号：US10184223
申请日：2002-06-26
申请人： Arthur Zwiegincew , Mark H. Lucovsky , Christian Kleinerman , Eugene N. Nonko , Shaun D. Pierce
发明人： Arthur Zwiegincew , Mark H. Lucovsky , Christian Kleinerman , Eugene N. Nonko , Shaun D. Pierce
IPC分类号： G06F17/30 , G07F17/30
CPC分类号： G06F17/30415 , G06F17/30917 , G06F17/30929 , Y10S707/99933 , Y10S707/99934 , Y10S707/99942 , Y10S707/99943
摘要： Methods, systems, and computer program products for accessing data where the data store provider is abstracted from both the data manipulation language used to access the data and the schema that describes the data. A received request structured in accordance with the data manipulation language is represented in an intermediate form. From the intermediate representation, a native request for any of one or more data store providers may be produced. Before being returned to the requester, a native response from data store provider may be formatted so that it is structured in accordance with the data manipulation language used for the request. A given request received by one computer system may cause a procedure to be generated for accessing the data store provider. When a later request is received by second computer system, the previously generated stored procedure may be reused if applicable.
摘要翻译：用于访问数据存储提供者从用于访问数据的数据操作语言和描述数据的模式中抽取数据的方法，系统和计算机程序产品。根据数据操作语言构造的接收到的请求以中间形式表示。从中间表示可以产生对一个或多个数据存储提供者中的任何一个的本机请求。在返回到请求者之前，来自数据存储提供者的本地响应可以被格式化，使得它根据用于该请求的数据操作语言被构造。一个计算机系统接收到的给定请求可能导致生成用于访问数据存储提供者的过程。当第二计算机系统接收到稍后的请求时，如果适用，可以重新使用先前生成的存储过程。

3. 发明授权

US07283996B2 Converting expressions to execution plans 失效
标题翻译：将表达式转换为执行计划
公开(公告)号：US07283996B2
公开(公告)日：2007-10-16
申请号：US11050177
申请日：2005-02-02
申请人： Eugene N. Nonko , Mark H. Lucovsky , Arthur Zwiegincew , Shaun D. Pierce
发明人： Eugene N. Nonko , Mark H. Lucovsky , Arthur Zwiegincew , Shaun D. Pierce
IPC分类号： G06F17/30
CPC分类号： G06F17/30427 , G06F17/30442 , Y10S707/99931 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99945
摘要： Methods, systems, and computer program products for converting a single expression referencing multiple branches within a hierarchical schema into multiple expressions referencing a single branch of the hierarchical schema. The single expression includes expression components that identify branches within the hierarchical schema. Relative to a given branch, any branches referenced by a given expression component are identified. The identified branches are stored as new branches. If no branch is identified, the current branch may be removed as inconsistent. Storage for current branches is cleared, the new branches are copied to the current branches, and the process is repeated for each expression component. An expression component may include a predicate for determining which branches are referenced. The predicate may include predicate expressions that are converted to predicate branches and the predicate may include predicate operators. Predicate operators are combined with predicate branches to identify all branches referenced by the predicate.
摘要翻译：用于将引用分层模式中的多个分支的单个表达式转换为引用分层模式的单个分支的多个表达式的方法，系统和计算机程序产品。单个表达式包含标识分层模式中的分支的表达式组件。相对于给定的分支，给定表达式组件引用的任何分支都被识别。识别的分支存储为新分支。如果没有分支被识别，则当前分支可能被删除为不一致。清除当前分支的存储，将新分支复制到当前分支，并为每个表达组件重复进程。表达组件可以包括用于确定哪些分支被引用的谓词。谓词可以包括转换为谓词分支的谓词表达式，谓词可以包括谓词运算符。谓词运算符与谓词分支组合，以标识由谓词引用的所有分支。

4. 发明授权

US06862590B2 Converting expressions to execution plans 失效
标题翻译：将表达式转换为执行计划
公开(公告)号：US06862590B2
公开(公告)日：2005-03-01
申请号：US10158970
申请日：2002-05-30
申请人： Eugene N. Nonko , Mark H. Lucovsky , Arthur Zwiegincew , Shaun D. Pierce
发明人： Eugene N. Nonko , Mark H. Lucovsky , Arthur Zwiegincew , Shaun D. Pierce
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30427 , G06F17/30442 , Y10S707/99931 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99945
摘要： Methods, systems, and computer program products for converting a single expression referencing multiple branches within a hierarchical schema into multiple expressions referencing a single branch of the hierarchical schema. The single expression includes expression components that identify branches within the hierarchical schema. Relative to a given branch, any branches referenced by a given expression component are identified. The identified branches are stored as new branches. If no branch is identified, the current branch may be removed as inconsistent. Storage for current branches is cleared, the new branches are copied to the current branches, and the process is repeated for each expression component. An expression component may include a predicate for determining which branches are referenced. The predicate may include predicate expressions that are converted to predicate branches and the predicate may include predicate operators. Predicate operators are combined with predicate branches to identify all branches referenced by the predicate.
摘要翻译：用于将引用分层模式中的多个分支的单个表达式转换为引用分层模式的单个分支的多个表达式的方法，系统和计算机程序产品。单个表达式包含标识分层模式中的分支的表达式组件。相对于给定的分支，给定表达式组件引用的任何分支都被识别。识别的分支存储为新分支。如果没有分支被识别，则当前分支可能被删除为不一致。清除当前分支的存储，将新分支复制到当前分支，并为每个表达组件重复进程。表达组件可以包括用于确定哪些分支被引用的谓词。谓词可以包括转换为谓词分支的谓词表达式，谓词可以包括谓词运算符。谓词运算符与谓词分支组合，以标识由谓词引用的所有分支。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式