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

1. 发明公开

EP3274867A1 OPTIMIZE QUERY BASED ON UNIQUE ATTRIBUTE 审中-公开
标题翻译：基于唯一属性的优化查询
公开(公告)号：EP3274867A1
公开(公告)日：2018-01-31
申请号：EP15887945.2
申请日：2015-03-27
申请人： Entit Software LLC
发明人： OPPENHEIMER, Kahlil Bre , DAVE, Jaimin M
IPC分类号： G06F17/30
CPC分类号： G06F17/30474 , G06F17/30442 , G06F17/30466
摘要： Example implementations relate to optimized queries based on unique attributes. For example, a computing device may include a processor. The processor may receive a query and identify at least one unique attribute based on at least one operation specified in the query or based on an attribute property associated with at least one relational table relevant to the query, the attribute property indicating uniqueness. The processor may modify a data structure representing the query, the data structure having nodes each associated with a respective relational table and the data structure modified to specify a subset of the nodes that are associated with the at least one unique attribute. The processor may optimize the query based on the data structure modified to specify the subset.

2. 发明公开

EP3159815A1 DATABASE HIERARCHY-INDEPENDENT DATA DRILLING 审中-公开
标题翻译：数据库级别独立的数据钻取
公开(公告)号：EP3159815A1
公开(公告)日：2017-04-26
申请号：EP16197450.6
申请日：2013-06-30
申请人： Pilab S.A.
发明人： PIECKO, Krystian
IPC分类号： G06F17/30
CPC分类号： G06F17/30466 , G06F17/30572
摘要： A computer implemented method for database hierarchy-independent data drilling obviating a need for hard-coded database queries, the method comprising: (a) accessing a database comprising: (1) a first data structure comprising definitions of at least two data sets, wherein a definition of a data set comprises a unique data set identifier and a set name, and wherein a start data set and an end data set of the at least two data sets are logically related by a logical path, (2) a second data structure comprising definitions of relations of the at least two data sets, wherein a definition of a relation comprises a unique identifier of the relation, and (3) a third data structure comprising definitions of set relations between the at least two data sets, wherein a definition of a set relation associates a relation, from the second data structure, with two data sets from the first data structure; (b) selecting a set identifier of the start data set using the first data structure; (c) setting the set identifier of the start data set as a current data drilling state; (d) finding a second data set related to the current data drilling state by identifying a second set identifier related to the first set identifier using the third data structure; (e) identifying a relation between the current data drilling state and the second data set using the definitions of the relations in the second data structure; and (f) determining if the second data set is the end data set.
摘要翻译：一种用于独立于数据库层次结构的数据钻取的计算机实现的方法，避免了对硬编码数据库查询的需要，该方法包括：（a）访问数据库，该数据库包括：（1）包括至少两个数据集的定义的第一数据结构，其中数据集的定义包括唯一数据集标识符和集合名称，并且其中所述至少两个数据集的开始数据集和结束数据集在逻辑上通过逻辑路径相关，（2）第二数据结构包括所述至少两个数据集的关系的定义，其中关系的定义包括所述关系的唯一标识符，以及（3）包括所述至少两个数据集之间的集合关系的定义的第三数据结构，其中定义集合关系的关系与来自第二数据结构的关系与来自第一数据结构的两个数据集关联; （b）使用第一数据结构选择起始数据集的集合标识符; （c）将所述起始数据组的设置标识符设置为当前数据钻取状态; （d）通过使用所述第三数据结构识别与所述第一组标识符相关的第二组标识符来找到与所述当前数据钻取状态相关的第二数据组; （e）使用第二数据结构中的关系的定义来识别当前数据钻取状态与第二数据集之间的关系; 和（f）确定第二数据集是否是结束数据集。

3. 发明公开

EP3061003A1 ALGORITHM TO APPLY A PREDICATE TO DATA SETS 无效
标题翻译：算法使用上记录的谓词
公开(公告)号：EP3061003A1
公开(公告)日：2016-08-31
申请号：EP14793038.2
申请日：2014-10-21
申请人： Brytlyt Limited
发明人： HEYNS, Richard
IPC分类号： G06F17/30
CPC分类号： G06F17/30598 , G06F17/18 , G06F17/30466 , G06F17/30522
摘要： The present invention relates to a method and apparatus for analysing a pair of data sets with respect to a predicate, the predicate having a predicate criterion, each data set comprising one or more elements sorted according to the predicate criterion. The invention comprises recursive partitioning of the data sets in a parallel manner across multiple computing cores until a base case is reached. The invention is particularly suited for carrying out join, filter and sort operations on large data sets within database management systems.

4. 发明公开

EP2738699A3 Unification of search and analytics 有权转让
标题翻译：搜索和分析协会
公开(公告)号：EP2738699A3
公开(公告)日：2016-06-29
申请号：EP13195155.0
申请日：2013-11-29
申请人： SAP SE
发明人： Buchmann, Daniel , Porscha, Waldemar , Pesarese, Marco , Michels, Frank , Kresser, Florian , Munkel, Christian , Kresser, Florian
IPC分类号： G06F17/30
CPC分类号： G06F17/30466 , G06F17/30572
摘要： A system includes reception of a request conforming to a modeled query and join filter criteria, the request comprising a first subrequest associated with a search attribute view and a second subrequest associated with an analytical view, definition of a join between the search attribute view and the analytical view based on one or more view attributes of the search attribute view, and filtering of a result set associated with the first subrequest based on the join and on the join filter criteria.

5. 发明公开

EP2852903A4 EFFICIENT TOP-DOWN HIERARCHICAL JOIN ON A HIERARCHICALLY CLUSTERED DATA STREAM 有权转让
标题翻译：高效TOP-DOWN阶层连接的分层简明数据流
公开(公告)号：EP2852903A4
公开(公告)日：2016-03-09
申请号：EP13794028
申请日：2013-04-24
申请人： GOOGLE INC
发明人： SAMWEL BART , WHIPKEY CHAD
IPC分类号： G06F17/30
CPC分类号： G06F17/30424 , G06F17/30466 , G06F17/30589
摘要： An apparatus for conducting a hierarchical join on a hierarchically clustered data stream is disclosed. The apparatus may include a memory storing query conditions that each determine whether a Structured Query Language query is suitable for performing a non-buffering read operation on a hierarchical data storage. A processor in communication with the memory may be configured to receive a Structured Query Language (“SQL”) query from a client device and evaluate the SQL query for one or more of the query conditions stored in the memory. When the processor determines that the SQL query satisfies one or more of the query conditions, the processor may then perform a non-buffering read operation on the hierarchical data storage to obtain a hierarchically clustered data stream. The hierarchically clustered data stream may be evaluated to obtain a plurality of record results, which may be transmitted to the client device.

6. 发明公开

EP2790115A1 Accès à une base de données relationnelle par détermination automatique de jointures optimales 审中-公开
标题翻译：最佳的自动测定通过访问关系数据库连接
公开(公告)号：EP2790115A1
公开(公告)日：2014-10-15
申请号：EP14163331.3
申请日：2014-04-03
申请人： BULL SAS
发明人： Ficet, Aline , Doucerain, Cyril
IPC分类号： G06F17/30
CPC分类号： G06F17/30466
摘要： L'invention concerne un procédé pour permettre un accès par un utilisateur à une base de données relationnelle consistant à effectuer des jointures entre tables et comportant :
Une première étape (E1) de détermination d'un sous-ensemble de tables;
Une deuxième étape (E2) de détermination des combinaisons ordonnées possibles parmi ce sous-ensemble ; et
Pour chaque chacune desdites combinaisons, une troisième étape constituée de
une première sous-étape (E3a) de détermination d'une première jointure entre la première table et une quelconque des autres tables;
une seconde sous-étape (E3b) itérative de détermination d'une jointure entre une table non encore jointe et une quelconque des tables déjà jointes de la combinaison
Une quatrième étape (E4) consistant à sélectionner une combinaison parmi les combinaisons en fonction d'un critère à minimiser, et à réaliser effectivement les jointures déterminées pour cette combinaison.

7. 发明公开

EP2608070A1 Hybrid database table stored as both row and column store 审中-公开
标题翻译： Hybriddatenbanktabelle，die reihen- und spaltenorientiert gespeichert ist
公开(公告)号：EP2608070A1
公开(公告)日：2013-06-26
申请号：EP12006518.0
申请日：2012-09-17
申请人： SAP AG
发明人： Yoon, Yongsik , Jeong, Chanho , Lee, Juchang , Song, Chang Bin , Kwon, Yong Sik , Cha, Sang Kyun
IPC分类号： G06F17/30
CPC分类号： G06F17/30345 , G06F17/30312 , G06F17/30339 , G06F17/30442 , G06F17/30466 , G06F17/30477 , G06F17/30584 , G06F17/30867
摘要： A hybrid database table is stored as both a row and a column store. One or more techniques may be employed alone or in combination to enhance performance of the hybrid table by regulating access to, and/or the size of, the processing-intensive column store data. In a technique, processing of queries on the hybrid table are optimized by searching the column store data only after an initial search of row store data fails to return a result.
摘要翻译：混合数据库表存储为行和列存储。可以单独使用或组合使用一种或多种技术，以通过调节处理密集型列存储数据的访问和/或大小来增强混合表的性能。在一种技术中，通过在行存储数据的初始搜索不能返回结果之后搜索列存储数据来优化对混合表的查询的处理。

8. 发明公开

EP1938212A4 METHODS AND SYSTEMS FOR JOINING DATABASE TABLES USING INDEXING DATA STRUCTURES 审中-公开
标题翻译： VERFAHREN UND SYSTEME ZUMVERKNÜPFENVON DATENBANKTABELLEN UNTER VERWENDUNG VON INDIZIERUNGSDATENSTRUKTUREN
公开(公告)号：EP1938212A4
公开(公告)日：2008-10-08
申请号：EP06761055
申请日：2006-06-14
申请人： EL-SABBAGH ALAN
发明人： EL-SABBAGH ALAN
IPC分类号： G06F17/30
CPC分类号： G06F17/30327 , G06F17/30466 , Y10S707/99933
摘要： A method for identifying joined rows in a database comprising a plurality of tables. The method comprises selecting a group of tables directly or indirectly joined with each other, selecting an order of the group based on relationships among the tables, generating an intermediate data structure which identifies the group of tables, a number of virtual tables equal to one less than the number of tables in the group, and an indication of an adjacent table, and a common table and key for at least some of the group of tables and the virtual tables, generating indexing data structures for the group of tables and virtual tables, and, inserting information from rows of the group of tables into the indexing data structures using the intermediate data structure. The indexing data structure for one virtual table indicates which of the rows of the tables have common data elements.
摘要翻译：一种用于识别包括多个表的数据库中的连接行的方法。该方法包括选择彼此直接或间接连接的一组表格，基于表格之间的关系来选择组的顺序，生成标识该组表格的中间数据结构，等于少于一个的虚拟表格的数量比该组中的表的数量以及相邻表的指示以及用于该组表和虚拟表中的至少一些表的公共表和关键字，以及使用中间数据结构将来自该组表的行的信息插入到索引数据结构中。一个虚拟表的索引数据结构指示哪些表中的行具有共同的数据元素。

9. 发明授权

EP0875838B1 Cardinality-based join ordering 失效
标题翻译：基于存储在记录的化合物的表订单数
公开(公告)号：EP0875838B1
公开(公告)日：2007-08-01
申请号：EP98303480.2
申请日：1998-05-05
申请人： International Business Machines Corporation
发明人： Krishna, Murali M.
IPC分类号： G06F17/00 , G06F17/30
CPC分类号： G06F17/30466 , Y10S707/99932

10. 发明公开

EP1659509A3 Adaptive processing of top-k queries in nested-structure arbitrary mark-up language such as XML 审中-公开
标题翻译：与嵌套结构为XML的标记语言的top-k查询自适应处理
公开(公告)号：EP1659509A3
公开(公告)日：2007-05-30
申请号：EP05270034.1
申请日：2005-08-02
申请人： AT&T Corp.
发明人： Amer-Yahia, Sihem , Koudas, Nikolaos , Marian-Guerrier, Amelie , Srivastava, Divesh
IPC分类号： G06F17/30
CPC分类号： G06F17/30466 , G06F17/3053 , G06F17/30938
摘要： A method of adaptively evaluating a top- k query involves (1204) forming a servers having respective server queues storing candidate answers, processing the candidate answers, and (1232) providing a top- k set as a query evaluation. Processing includes adaptively choosing a winning server to whose queue a current candidate answer should be sent; sending the current candidate answer to the winning server's queue; adaptively choosing a next candidate answer to process from the winning server's queue; computing a join between the current candidate answer and next candidate answers at the winning server, so as to produce a new current candidate answer; and updating the top- k set with the new current candidate answer only if a score of the new current candidate answer exceeds a score of a top- k answer in a top- k set. A method of calculating scores for candidate answers is also provided.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式