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

1. 发明申请

WO2007082845A2 QUERY EVALUATION USING ANCESTOR INFORMATION 审中-公开
标题翻译： QUERY评估使用ANCESTOR信息
公开(公告)号：WO2007082845A2
公开(公告)日：2007-07-26
申请号：PCT/EP2007/050292
申请日：2007-01-12
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION , IBM UNITED KINGDOM LIMITED , JOSIFOVSKI, Vanja , TING, Edison, Lao
发明人： JOSIFOVSKI, Vanja , TING, Edison, Lao
IPC分类号： G06F17/30
CPC分类号： G06F17/272 , G06F17/30424 , G06F17/30433 , G06F17/30929 , G06F17/30938 , Y10S707/99933
摘要： Provided are techniques for processing a query. A query is received, wherein the query is formed by one or more paths, and wherein each path includes one or more steps. A hierarchical document including one or more document nodes is received. While processing the query and traversing the hierarchical document, one or more extraction entries are constructed, wherein each extraction entry includes a step instance match candidate identifying a document node and a step instance ancestor path for the document node, and one or more tuples are constructed using the one or more extraction entries by associating the step instance match candidate from one of the one or more extraction entries with the step instance match candidate from at least one of the one or more other extraction entries.
摘要翻译：提供了用于处理查询的技术。接收查询，其中查询由一个或多个路径形成，并且其中每个路径包括一个或多个步骤。接收包括一个或多个文档节点的分层文档。在处理查询和遍历分级文档时，构建一个或多个提取条目，其中每个提取条目包括标识文档节点的步骤实例匹配候选和文档节点的步骤实例祖先路径，并且构建一个或多个元组通过将来自一个或多个提取条目之一的步骤实例匹配候选与来自一个或多个其他提取条目中的至少一个的步骤实例匹配候选相关联来使用一个或多个提取条目。

2. 发明申请

WO2006134502A1 ACCESS TO FRAGMENTED DATABASE SYSTEM 审中-公开
标题翻译：访问被破解的数据库系统
公开(公告)号：WO2006134502A1
公开(公告)日：2006-12-21
申请号：PCT/IB2006/050722
申请日：2006-03-08
申请人： NOKIA CORPORATION , EINAMO, Kari
发明人： EINAMO, Kari
IPC分类号： G06F17/30
CPC分类号： G06F17/30433 , G06F17/30575
摘要： A distributed database system returns a token which an application may use in consecutive requests to the distributed database system to by-pass a fragmentation layer or distribution functionality of the distributed database system.
摘要翻译：分布式数据库系统返回令牌，应用程序可以在连续请求中使用分布式数据库系统来绕过分布式数据库系统的分段层或分发功能。

3. 发明申请

WO2005006153A2 SQL CODE GENERATION FOR HETEROGENEOUS ENVIRONMENT 审中-公开
标题翻译：异构环境的SQL代码生成
公开(公告)号：WO2005006153A2
公开(公告)日：2005-01-20
申请号：PCT/US2004/023168
申请日：2004-07-07
申请人： NETEZZA CORPORATION , ZANE, Barry, M. , BALLARD, James, P. , HINSHAW, Foster, D. , YERABOTHU, Premanand , KIRKPATRICK, Dana, A.
发明人： ZANE, Barry, M. , BALLARD, James, P. , HINSHAW, Foster, D. , YERABOTHU, Premanand , KIRKPATRICK, Dana, A.
IPC分类号： G06F
CPC分类号： G06F17/30474 , G06F8/30 , G06F17/30433 , G06F17/30471 , G06F17/30498 , G06F17/30545 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99942
摘要： This invention relates generally to a system for processing database queries, and more particularly to a method for generating high level language or machine code to implement query execution plans. In one preferred embodiment, the method begins by receiving a subject query, and then forming an execution plan corresponding to the subject query. The execution plan will typically have a sequence of component snippets or pieces and corresponding processes for implementing the pieces. For at least one piece in the plan, the process then (a) generates source code using different code generation techniques as a function of expected runtime processing machine types; and then (b) compiles the generated source code to form machine executable code for implementing the subject query. As a result, the query executed directly as machine executable code thereby avoiding runtime interpretation of the pieces in the execution plan.
摘要翻译：本发明一般涉及用于处理数据库查询的系统，更具体地说，涉及一种用于生成高级语言或机器代码来实现查询执行计划的方法。在一个优选实施例中，该方法开始于接收主题查询，然后形成对应于对象查询的执行计划。执行计划通常将具有一系列组件片段或片段以及用于实现片段的相应过程。对于计划中的至少一个，过程然后（a）使用不同的代码生成技术生成源代码作为预期的运行时处理机器类型的函数; 然后（b）编译生成的源代码以形成用于实现主题查询的机器可执行代码。因此，查询直接作为机器可执行代码执行，从而避免了执行计划中的程序段的运行时解释。

4. 发明申请

WO2011014214A1 SELECTIVITY-BASED OPTIMIZED-QUERY-PLAN CACHING 审中-公开
标题翻译：基于选择性的优化查询计划缓存
公开(公告)号：WO2011014214A1
公开(公告)日：2011-02-03
申请号：PCT/US2009/067849
申请日：2009-12-14
申请人： HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P. , AL-OMARI, Awny, K. , CHEN, Qifan , REYES, Tom, C. , WEHRMEISTER, Robert, M. , EZZAT, Ahmed, K.
发明人： AL-OMARI, Awny, K. , CHEN, Qifan , REYES, Tom, C. , WEHRMEISTER, Robert, M. , EZZAT, Ahmed, K.
IPC分类号： G06F17/30 , G06F17/00
CPC分类号： G06F17/30433 , G06F17/30463
摘要： Embodiments of the present invention partition optimized query plans into equivalence groups (1016), each comprising one or more equivalence classes (1020, 1022). Each equivalence group corresponds to a particular compiled, normalized, and parameterized query plan prior to optimization. Each equivalence class within an equivalence group corresponds to a different query plan corresponding to the particular compiled, normalized, and parameterized query plan (1024) represented by the equivalence group (1016) that has been optimized with respect to the selectivity of one or more predicate clauses of the query that is compiled to produce the particular compiled, normalized, and parameterized query plan. Optimized query plans are cached according to their respective equivalence groups and equivalence classes. When a query, similar to a query already compiled, optimized, and cached, is subsequently received and compiled, a selectivity for a predicate of the compiled query is computed (1150), allowing the database management system to retrieve a cached query plan (1172) optimized for a similar query with similar selectivity.
摘要翻译：本发明的实施例将优化的查询计划划分为等价组（1016），每个包括一个或多个等价类（1020,1022）。每个等价组对应于优化之前的特定编译，归一化和参数化查询计划。等价组中的每个等价类对应于对应于由相对于一个或多个谓词的选择性优化的等价组（1016）表示的特定编译，归一化和参数化查询计划（1024）的不同查询计划编译生成特定编译，归一化和参数化查询计划的查询的子句。优化的查询计划根据各自的等价组和等价类进行缓存。当查询（类似于已编译，优化和高速缓存的查询）随后被接收和编译时，计算对编译查询的谓词的选择性（1150），允许数据库管理系统检索缓存的查询计划（1172 ）针对具有相似选择性的类似查询进行了优化。

5. 发明申请

WO2007137309A8 METHOD FOR CONTROLLING A RELATIONAL DATABASE SYSTEM 审中-公开
标题翻译：一种用于控制关系型数据库系统
公开(公告)号：WO2007137309A8
公开(公告)日：2008-12-11
申请号：PCT/AT2007000060
申请日：2007-02-06
申请人： MEDIAREIF MOESTL & REIF KOMMUN , MOESTL MATTHIAS
发明人： MOESTL MATTHIAS
IPC分类号： G06F17/30
CPC分类号： G06F17/30404 , G06F17/30433 , G06F17/30436 , G06F17/30587
摘要： The invention relates to a relational database system, wherein a request statement which is to be serviced and which comprises key words is initially analysed using a recursive transition network (RTN) and is converted into control commands. Said method comprises the following steps: the RTN is defined in a presetting step by forming RTN modules which are independent from one another, by means of an internal, oriented decision graph and optionally at least one recursive call function; one reference group, which is independent from the RTN modules and the elements thereof referring to the remaining decision graphs released from the first decision graph thereof, is formed; a reference execution step is used and the remaining decision graph that can prescribe the recursive call function, is transversed and an optimum access plan for the relational database system is generated.
摘要翻译：一种用于控制一个关系数据库系统，其特征在于，它是由键词的abzuarbeitendes查询语句，最初使用递归转移网络（RTN）进行分析，并转换成控制命令，包括以下步骤的方法：定义在预设的步骤通过形成独立RTN的RTN 积木，每个具有内，导向决策图，和任选的至少一种递归调用功能; 形成独立的基准组的RTN积木的主体，所述元件，其的指解放从其第一位置决定残留决策图; 施加参考执行步骤以及使所述残余决策图，这可能需要递归调用功能; 产生针对关系数据库系统的优化的访问计划。

6. 发明申请

WO2007082845A3 QUERY EVALUATION USING ANCESTOR INFORMATION 审中-公开
标题翻译：使用ANCESTOR信息查询评估
公开(公告)号：WO2007082845A3
公开(公告)日：2007-11-01
申请号：PCT/EP2007050292
申请日：2007-01-12
申请人： IBM , IBM UK , JOSIFOVSKI VANJA , TING EDISON LAO
发明人： JOSIFOVSKI VANJA , TING EDISON LAO
IPC分类号： G06F17/30
CPC分类号： G06F17/272 , G06F17/30424 , G06F17/30433 , G06F17/30929 , G06F17/30938 , Y10S707/99933
摘要： Provided are techniques for processing a query. A query is received, wherein the query is formed by one or more paths, and wherein each path includes one or more steps. A hierarchical document including one or more document nodes is received. While processing the query and traversing the hierarchical document, one or more extraction entries are constructed, wherein each extraction entry includes a step instance match candidate identifying a document node and a step instance ancestor path for the document node, and one or more tuples are constructed using the one or more extraction entries by associating the step instance match candidate from one of the one or more extraction entries with the step instance match candidate from at least one of the one or more other extraction entries.
摘要翻译：提供了用于处理查询的技术。接收到查询，其中查询由一个或多个路径形成，并且其中每个路径包括一个或多个步骤。接收包括一个或多个文档节点的分层文档。在处理查询并遍历分层文档时，构建一个或多个提取条目，其中每个提取条目包括标识文档节点的步骤实例匹配候选和文档节点的步骤实例祖先路径，并且构造一个或多个元组通过将所述一个或多个提取条目中的一个提取条目的所述步骤实例匹配候选项与所述一个或多个其他提取条目中的至少一个提取条目与所述步骤实例匹配候选相关联来使用所述一个或多个提取条目。

7. 发明申请

WO00039709A1 QUERY PROCESSING METHOD 审中-公开
标题翻译：查询处理方法
公开(公告)号：WO00039709A1
公开(公告)日：2000-07-06
申请号：PCT/FR1999/003294
申请日：1999-12-27
IPC分类号： G06F12/00 , G06F13/00 , G06F17/30
CPC分类号： G06F17/30433 , Y10S707/99934
摘要： The invention concerns a method for processing a query. The method for processing queries and result between a client and a plurality of heterogeneous data sources by an adaptor device (1) specific to each source, with predetermined architecture, comprises the following steps performed independently: receiving a query (71) transmitted by the client application; setting up en internal representation (73, 74) of the query with the adaptor; using said internal representation of the query to rewrite the query in a format comprehensible by the source; transmitting the translated query (75) to the source (7), producing a filter object (52) and initialising at least a chain of filters (46) consisting of one or several filter components (45, 44, 43, 42); recovering with the filter object (52) the results derived from the source to transmit them and filtering them through the chain (46) of filter components; producing a reply object (22) to transfer the results derived from the result transforming module to the client application.
摘要翻译：本发明涉及一种处理查询的方法。通过具有预定体系结构的特定于每个源的适配器设备（1）来处理客户机和多个异构数据源之间的查询和结果的方法包括独立执行的以下步骤：接收客户端发送的查询（71）应用; 使用适配器设置查询的内部表示（73,74）; 使用查询的内部表示，以源所容易理解的格式重写查询; 将所述翻译的查询（75）传送到所述源（7），产生过滤器对象（52）并且初始化至少一个由一个或多个过滤器部件（45,44,43,42）组成的过滤器链（46）; 用过滤器对象（52）恢复来自源的结果以将其传送并通过过滤器部件的链（46）进行过滤; 产生用于将从结果转换模块导出的结果传送到客户端应用的回复对象（22）。

8. 发明申请

WO2017065886A1 CACHE OPTIMIZATION FOR DATA PREPARATION 审中-公开
标题翻译：数据准备的缓存优化
公开(公告)号：WO2017065886A1
公开(公告)日：2017-04-20
申请号：PCT/US2016/049312
申请日：2016-08-29
申请人： PAXATA, INC.
发明人： BREWSTER, Dave , TSO, Victor, Tze-Yeuan
IPC分类号： G01R31/3183 , G06F9/44 , G06F9/45 , G06F11/22 , G06F15/00 , G06F17/30
CPC分类号： G06F17/30345 , G06F17/30433 , G06F17/30477 , G06F17/30554
摘要： Cache optimization for data preparation includes: generating a data traversal program that represents a result of a set of sequenced data preparation operations performed on one or more sets of data, wherein the data traversal program indicates how to assemble one or more affected columns in the one or more sets of data to derive the result; in response to receiving a specification of the set of sequenced operations to be performed on the one or more sets of data, accessing the data traversal program that represents the result or a stored copy of the data traversal program that represents the result; assembling the one or more affected columns in the one or more sets of data according to the data traversal program to re-generate the result; and outputting the result.
摘要翻译：用于数据准备的高速缓存优化包括：生成数据遍历程序，该数据遍历程序表示对一个或多个数据集执行的一组有序数据准备操作的结果，其中数据遍历程序指示如何组装一组或多组数据中的一个或多个受影响的列以得出结果; 响应于接收到对所述一个或多个数据集执行的所述一组有序操作的指定，访问表示所述结果的所述数据遍历程序或表示所述结果的所述数据遍历程序的存储副本; 根据所述数据遍历程序将所述一个或多个受影响的列组装在所述一个或多个数据集合中以重新生成所述结果; 并输出结果。

9. 发明申请

WO2016197130A1 ASSET COMMUNICATION HUB 审中-公开
标题翻译：资产通信总局
公开(公告)号：WO2016197130A1
公开(公告)日：2016-12-08
申请号：PCT/US2016/036064
申请日：2016-06-06
申请人： CENTRIQ TECHNOLOGY, INC.
发明人： ALI, Shubber , SHEPPARD, James
IPC分类号： G06F17/30 , G06Q10/08 , G06Q50/16
CPC分类号： G06F17/30893 , G06F17/30433 , G06Q10/087
摘要： Disclosed herein are system, method, and computer program product embodiments for establishing communication channels related to assets. An embodiment enables users of home assets such as appliances to share content related to that asset through a centralized clearinghouse of asset content. Aggregated content reduces redundant searches across sources by many users looking for the same content. New data pathways from user to users, manufacturers, and various third parties are established through the connections created in relation to assets.
摘要翻译：本文公开了用于建立与资产相关的通信信道的系统，方法和计算机程序产品实施例。一个实施方式使诸如家电的家庭资产的用户能够通过资产内容的集中式交换所分享与该资产相关的内容。聚合内容减少了许多用户寻找相同内容的跨源资源的冗余搜索。通过与资产相关联的连接，建立了从用户到制造商和各种第三方的新数据路径。

10. 发明申请

WO2015035160A1 MECHANISM FOR OPTIMIZING PARALLEL EXECUTION OF QUERIES ON SYMMETRIC RESOURCES 审中-公开
标题翻译：优化对等资源查询并行执行机制
公开(公告)号：WO2015035160A1
公开(公告)日：2015-03-12
申请号：PCT/US2014/054286
申请日：2014-09-05
申请人： HUAWEI TECHNOLOGIES CO., LTD. , FUTUREWEI TECHNOLOGIES, INC.
发明人： LIU, Yanchen , MORTAZAVI, Masood , CHEN, Mengmeng , CAO, Fang
IPC分类号： G06F17/30
CPC分类号： G06F17/30442 , G06F17/30306 , G06F17/30433 , G06F17/30469 , G06F17/30474
摘要： A method that comprises receiving a logical execution plan for a database query corresponding to a plurality of tables of the database. wherein the logical execution plan comprises one or more operators, receiving an operator cost for each of the operators in the logical execution plan, computing a first accumulated processing cost for a first of the tables based on the logical execution plan, operator selectivity, and operator costs corresponding to the first table, computing a second accumulated processing cost for a second of the tables based on the logical execution plan, operator selectivity, and operator costs corresponding to the second table, comparing the first accumulated processing cost and the second accumulated processing cost to determine a table with the highest accumulated processing cost, and responsive to comparing the accumulated processing costs, computing a physical execution plan that requires partitioning the table with the highest accumulated processing cost.
摘要翻译：一种方法，包括接收与数据库的多个表相对应的数据库查询的逻辑执行计划。其中所述逻辑执行计划包括一个或多个运算符，在所述逻辑执行计划中接收每个运算符的运算符成本，基于所述逻辑执行计划，运算符选择性和运算符计算所述第一表中的第一累积处理成本对应于第一表的成本，基于与第二表相对应的逻辑执行计划，操作员选择性和操作者成本计算第二表的第二累积处理成本，比较第一累积处理成本和第二累积处理成本确定具有最高累积处理成本的表，并且响应于比较累积的处理成本，计算需要以最高的累积处理成本划分表的物理执行计划。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式