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

1. 发明公开

EP3274875A1 SYSTEM AND METHOD FOR QUERYING DATA SOURCES 有权
标题翻译：用于查询数据源的系统和方法
公开(公告)号：EP3274875A1
公开(公告)日：2018-01-31
申请号：EP16767601.4
申请日：2016-03-24
申请人： Caswil Corporation
发明人： KHUONG, Sophal , SAVOIE, Patrick
IPC分类号： G06F17/30
CPC分类号： G06F17/30451 , G06F17/30457 , G06F17/30516 , G06F17/3053 , G06F17/30554 , G06F17/30566
摘要： There is described a method and system for obtaining results from one or more data sources without the need to extract, transform and load the data into a database prior to performing a query. The data may retain its original format and remain in its initial location, and selective access to the data is provided using dynamically generated query statements. Multiple data sources may be accessed concurrently, each data source having its own format for stored data. Query statements are generated to obtain data (query results) from the various data sources by defining data sources, target fields, and parameters to be used for a given query. The statements comprise predefined operations that are applied recursively in order to transform (and sometimes aggregate) the data from the data sources into query results. Query statements and query results may be saved for later use.

2. 发明公开

EP3019985A1 SALIENT SAMPLING FOR QUERY SIZE ESTIMATION 审中-公开
标题翻译：用于查询规模估计的显着抽样
公开(公告)号：EP3019985A1
公开(公告)日：2016-05-18
申请号：EP14822444.7
申请日：2014-06-26
申请人： Logicblox, Inc.
发明人： VELDHUIZEN, Todd L.
IPC分类号： G06F17/30
CPC分类号： G06F17/30469 , G06F17/30339 , G06F17/30442 , G06F17/30451
摘要： Salient sampling for query size estimation includes identifying two or more columns in a database table that have corresponding columns in one or more other tables. One or more hash functions are applied to domains of each of the identified columns. A first hash function is applied to a domain of the first column and a second hash function to a domain of the second column. A subset of the rows in the database table is selected. The selecting includes selecting rows in the database table where results of the first hash function meet a first numeric threshold and selecting rows in the database table where results of the second hash function meet a second numeric threshold. A sample database table corresponding to the database table is created. The sample database table includes the selected subset of the rows in the database table.
摘要翻译：用于查询大小估计的突出采样包括识别数据库表中具有一个或多个其他表中的对应列的两个或更多列。一个或多个散列函数被应用于每个识别列的域。第一个散列函数应用于第一列的域，第二个散列函数应用于第二列的域。数据库表中的行的子集被选中。该选择包括选择数据库表中的行，其中第一散列函数的结果符合第一数字阈值并且选择数据库表中的第二散列函数的结果符合第二数字阈值的行。创建与数据库表相对应的示例数据库表。示例数据库表包含数据库表中行的选定子集。

3. 发明公开

EP2901319A2 TACTICAL QUERY TO CONTINUOUS QUERY CONVERSION 审中-公开
标题翻译：战术查询在连续查询转换
公开(公告)号：EP2901319A2
公开(公告)日：2015-08-05
申请号：EP13776641.6
申请日：2013-09-26
申请人： Oracle International Corporation
发明人： HSIAO, Eric , SHARMA, Vishal , SANTOS, Adriano Covello , GUPTA, Rahul
IPC分类号： G06F17/30
CPC分类号： G06F17/30516 , B29D30/0681 , B29D2030/0682 , B32B27/08 , B32B27/34 , B60C1/0008 , B60C5/14 , G06F17/30389 , G06F17/30424 , G06F17/30442 , G06F17/30451 , G06F17/30457 , G06F17/30477 , G06F17/30483 , G06F17/30498 , G06F17/30548 , G06F17/30551 , G06F17/30554 , G06F17/30557 , G06F17/30616 , G06F17/30864 , G06F17/30958
摘要： Techniques for implementing mechanisms for chaining continuous queries are provided. In some examples, results of a first continuous query may be stored in a data object. For example, the first continuous query may be configured to process business event data and store the results in the data object. Additionally, a second continuous query may then be processed based at least in part on the results stored in the data object.

4. 发明公开

EP2839394A1 METHODS OF QUERYING A RELATIONAL DATABASE 审中-公开
标题翻译： VERFAHREN ZUR ABFRAGE EINER RELATEALEN DATENBANK
公开(公告)号：EP2839394A1
公开(公告)日：2015-02-25
申请号：EP13718212.7
申请日：2013-04-17
申请人： Dataline Software Ltd
发明人： BLEACH, Adrian
IPC分类号： G06F17/30
CPC分类号： G06F17/30595 , G06F17/30424 , G06F17/30451 , G06F17/30498 , G06F17/30554
摘要： A computer implemented method of obtaining a dataset which answers a main query from a relational database comprises providing a first real result table and one or more further real result tables. The first real result table contains a first dataset obtained from the database which answers a first subquery that forms part of the main query, and the or each further real result table contains a respective further dataset obtained from the database which answers a respective further subquery that forms part of the main query. A dataset is obtained from the first and one or more further real result tables which answers the main query. The computer implemented method obtains a dataset which answers a main query in a reliable and consistent manner.
摘要翻译：获得从关系数据库回答主要查询的数据集的计算机实现方法包括提供第一实际结果表和一个或多个其他实际结果表。第一个真实结果表包含从数据库获得的第一个数据集，该第一数据集回答构成主查询的一部分的第一个子查询，并且该或每个另外的真实结果表包含从数据库获取的相应的另外的数据集，该数据集回答相应的另外的子查询，构成主要查询的一部分。从第一个和一个或多个其他实际结果表中获得数据集，这些实际结果表回答主要查询。计算机实现的方法获得以可靠和一致的方式回答主要查询的数据集。

5. 发明公开

EP2778967A1 Low latency query engine for apache hadoop 审中-公开
标题翻译： Anfragemaschine mit niedriger Latenz Apache Hadoop
公开(公告)号：EP2778967A1
公开(公告)日：2014-09-17
申请号：EP14157984.7
申请日：2014-03-06
申请人： Cloudera, Inc.
发明人： Kornacker, Marcel , Erickson, Justin , Li, Nong , Kuff, Lenni , Robinson, Henry Noel , Choi, Alan , Behm, Alex
IPC分类号： G06F17/30
CPC分类号： G06F17/30466 , G06F17/30442 , G06F17/30451 , G06F17/30463 , G06F17/30545 , G06F17/30569
摘要： A low latency query engine for Apache Hadoop that provides real-time or near real-time, ad hoc query capability, while completing batch-processing of MapReduce. In one embodiment, the low latency query engine comprises a daemon that is installed on data nodes in a Hadoop cluster for handling query requests and all internal requests related to query execution. In a further embodiment, the low latency query engine comprises a daemon for providing name service and metadata distribution. The low latency query engine receives a query request via client, turns the request into collections of plan fragments and coordinates parallel and optimized execution of the plan fragments on remote daemons to generate results at a much faster speed than existing batch-oriented processing frameworks.
摘要翻译：用于Apache Hadoop的低延迟查询引擎，可在完成MapReduce的批处理时提供实时或近乎实时的即席查询功能。在一个实施例中，低延迟查询引擎包括安装在Hadoop集群中的数据节点上的守护程序，用于处理查询请求和与查询执行相关的所有内部请求。在进一步的实施例中，低延迟查询引擎包括用于提供名称服务和元数据分发的守护进程。低延迟查询引擎通过客户端接收查询请求，将请求转换为计划片段的集合，并协调远程守护程序上的计划片段的并行和优化执行，以比现有的面向批处理框架更快的速度生成结果。

6. 发明公开

EP2665000A3 Processing queries in a computer network using business intelligence tools 审中-公开
标题翻译：使用商业智能工具在计算机网络处理请求
公开(公告)号：EP2665000A3
公开(公告)日：2014-06-11
申请号：EP13002331.0
申请日：2013-04-30
申请人： Business Objects Software Ltd.
发明人： Lutter, Steffen , Xue, Xiaohui , Gopalakrishnan, Mythili , Snowdon, Peter
IPC分类号： G06F17/30
CPC分类号： G06F17/30433 , G06F17/30451 , G06F17/30477 , G06F17/30545
摘要： A method for querying an Open Data Protocol ("opendata") opendata provider includes receiving a relational database query, parsing the relational database query, creating an execution plan, transmitting an opendata query to the opendata provider, transforming a response into a relational format, and providing the transformed response in reply to the relational database query. The method further includes mapping content of an opendata entity data model to a relational model catalog, and processing a portion of the execution plan by an opendata driver implemented at the server. The method can further include the server retrieving document metadata from the opendata provider, building an internal model of the document metadata, and responding to a metadata request. A system for implementing the method and a non-transitory computer readable medium are also disclosed.

7. 发明公开

EP2812816A1 INTERACTIVE CONTENT SEARCH USING COMPARISONS 审中-公开
标题翻译：互动内容搜索使用对比
公开(公告)号：EP2812816A1
公开(公告)日：2014-12-17
申请号：EP13707481.1
申请日：2013-02-06
申请人： Thomson Licensing
发明人： MASSOULIE, Laurent , IOANNIDIS, Efstratios
IPC分类号： G06F17/30
CPC分类号： G06F17/30451 , G06F17/30017 , G06F17/30244
摘要： In interactive content search through comparisons, a search for a target object in a database is performed by finding the object most similar to the target from a small list of objects. A new object list is then presented based on the earlier selections. This process is repeated until the target is included in the list presented, at which point the search terminates. A solution to the interactive content search problem is provided under the scenario of
heterogeneous demand, where target objects are selected from a non-uniform probability distribution. It has been assumed that objects are embedded in a
doubling metric space which is fully observable to the search algorithm. Based on these assumptions, an efficient comparison-based search method is provided whose cost in terms of the number of queries can be bounded by the doubling constant of the embedding
c , and the entropy of demand distribution,
H . More precisely, the present principles show that the average search costs scales
C
F
= O(c
5
H) , which improves upon the previously best known bound and is order optimal for constant
c .

8. 发明公开

EP2784697A1 Graph database query handling method and apparatus 审中-公开
标题翻译： Verfahren und Vorrichtung zur Handhabung von Graphdatenbankabfragen
公开(公告)号：EP2784697A1
公开(公告)日：2014-10-01
申请号：EP13161804.3
申请日：2013-03-28
申请人： FUJITSU LIMITED
发明人： Nuno, Carvalho , Hu, Bo
IPC分类号： G06F17/30
CPC分类号： G06F17/30424 , G06F17/30436 , G06F17/30451 , G06F17/30469 , G06F17/30545
摘要： Embodiments include a querying method for a database of graph data encoded as triples, the triples each comprising values of three triple elements and being stored on a plurality of storage servers, the method comprising: a dividing step comprising dividing a query into a plurality of result criteria, the result criteria comprising a plurality of triple patterns which some or all query results must match, each triple pattern is composed of three triple pattern elements each corresponding to a different one of the three triple elements; each triple pattern element being either: a single value triple pattern element specifying a single value of the corresponding triple element which triples must have to match the triple pattern; or a variable value triple pattern element specifying an ID of a variable, the ID being attributed to values of the corresponding triple elements of triples matching the triple pattern. The method further comprises a sub-query forming step comprising, forming one or more sub-queries each comprising two or more triple patterns having the same single value triple pattern element or specifying the same ID of a variable as a variable value triple pattern element; a sub-query issuing step comprising issuing each formed sub-query to each of the plurality of storage servers; and a query result preparing step comprising receiving triples satisfying at least one formed sub-query as sub-query results from the plurality of storage servers and using the sub-query results to prepare query results as a response to the query.
摘要翻译：实施例包括用于编码为三元组的图形数据的数据库的查询方法，每个包括三个三元素的值并且存储在多个存储服务器上的三元组，所述方法包括：分割步骤，包括将查询分成多个结果标准，结果标准包括一些或全部查询结果必须匹配的多个三重图案，每个三重图案由三个三重图案元素组成，每个三个图案元素对应于三个三元素中的不同一个; 每个三重图案元素是：单值三重图案元素，其指定三元组必须与三重图案匹配的相应三重元素的单个值; 或指定变量的ID的变量值三重图案元素，该ID被归因于与三重图案匹配的三元组的相应三元组元素的值。该方法还包括一个子查询形成步骤，包括：形成一个或多个子查询，每个子查询包括具有相同单值三重图案元素的两个或多个三重图案，或者指定与变量值三重图案元素相同的变量ID; 子查询发布步骤，包括向所述多个存储服务器中的每个存储服务器发出每个形成的子查询; 以及查询结果准备步骤，包括从所述多个存储服务器接收满足至少一个形成的子查询的三元组作为子查询结果，并且使用所述子查询结果来准备作为对所述查询的响应的查询结果。

9. 发明公开

EP2665000A2 Processing queries in a computer network using business intelligence tools 审中-公开
标题翻译：使用商业智能工具在计算机网络处理请求
公开(公告)号：EP2665000A2
公开(公告)日：2013-11-20
申请号：EP13002331.0
申请日：2013-04-30
申请人： Business Objects Software Ltd.
发明人： Lutter, Steffen , Xue, Xiaohui , Gopalakrishnan, Mythili , Snowdon, Peter
IPC分类号： G06F17/30
CPC分类号： G06F17/30433 , G06F17/30451 , G06F17/30477 , G06F17/30545
摘要： A method for querying an Open Data Protocol ("opendata") opendata provider includes receiving a relational database query, parsing the relational database query, creating an execution plan, transmitting an opendata query to the opendata provider, transforming a response into a relational format, and providing the transformed response in reply to the relational database query. The method further includes mapping content of an opendata entity data model to a relational model catalog, and processing a portion of the execution plan by an opendata driver implemented at the server. The method can further include the server retrieving document metadata from the opendata provider, building an internal model of the document metadata, and responding to a metadata request. A system for implementing the method and a non-transitory computer readable medium are also disclosed.
摘要翻译：一种用于查询在开放式数据协议方法（“打开数据”）的开放数据提供者包括接收一个关系数据库查询，解析所述关系数据库查询中，在执行计划创建，发送开放数据查询到打开数据提供者，转化成关系格式的响应，并提供回复到关系数据库的查询变换的响应。该方法包括通过在所述服务器处实现的开放数据驱动器打开的数据实体的数据模型的另外的内容映射到关系模型目录，以及处理执行计划的一部分。该方法可以包括在服务器从打开的数据提供者取回此外文档元数据，建立在文档元数据的内部模型，并响应请求的元数据。因此，一个用于实现该方法和非瞬时计算机可读介质的系统是游离缺失盘。

10. 发明公开

EP1208475A4 SYSTEM FOR MAINTAINING PRECOMPUTED VIEWS 审中-公开
标题翻译： SYSTEM ZUR ERHALTUNG VON PRECOMPUTERISIERTER SICHT
公开(公告)号：EP1208475A4
公开(公告)日：2006-07-05
申请号：EP00960169
申请日：2000-07-19
申请人： IBM
发明人： BUNGER CRAIG , COLBY LATHA S , COLE RICHARD L , JOHNSON GALT , MCKENNA WILLIAM J , MULAGUND GOPAL B , WILHITE DAVID G JR
IPC分类号： G06F17/30
CPC分类号： G06F17/30457 , G06F17/30451 , Y10S707/99932 , Y10S707/99933 , Y10S707/99938 , Y10S707/99952 , Y10S707/99953
摘要： A system and a method maintain a precomputed view (20) corresponding to detail data in a database server (12) by: determining a maintenance plan to refresh the precomputed view when detail data is changed; integrating the maintenance plan with a query execution plan (18) in the database server (12); and executing the query execution plan.
摘要翻译：一种系统和方法通过以下步骤来维护与数据库服务器（12）中的细节数据相对应的预先计算的视图（20）：确定维护计划以在细节数据改变时刷新预先计算的视图; 将维护计划与数据库服务器（12）中的查询执行计划（18）相集成; 并执行查询执行计划。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式