公开(公告)号：US11573935B2

公开(公告)日：2023-02-07

申请号：US15469879

申请日：2017-03-27

Applicant: International Business Machines Corporation

Inventor： Marcelo Arenas ,  Gonzalo Diaz ,  Achille Fokoue ,  Anastasios Kementsietsidis ,  Kavitha Srinivas

IPC: G06F16/21 ,  G06F16/28 ,  G06F16/22 ,  G06F16/901 ,  G06F16/31

Abstract: A schema for a dataset is identified by identifying a dataset comprising data and relationships between data pairs. An original schema is identified for the dataset. This original schema comprises an organizational structure. An initial fit between the dataset and the original schema is determined. The initial fit quantifying a conformity of the data in the dataset to the organizational structure of the original schema. A plurality of additional schemas are identified. Each additional schema is a distinct organizational schema. The dataset is partitioned into a plurality of subsets. Each subset comprises a modified fit quantifying a modified conformity of subset data in each subset to one of the original schema and the additional schemas. The modified fit is greater than the original fit.

公开(公告)号：US10949464B2

公开(公告)日：2021-03-16

申请号：US15078931

申请日：2016-03-23

Applicant: International Business Machines Corporation

Inventor： Mihaela Ancuta Bornea ,  Julian Timothy Dolby ,  Achille Belly Fokoue-Nkoutche ,  Anastasios Kementsietsidis ,  Kavitha Srinivas

IPC: G06F16/21 ,  G06F16/901

Abstract: A system for identifying a schema for storing graph data includes a database containing a graph dataset of data and relationships between data pairs and a list of storage methods that each are a distinct structural arrangement of the data and relationships from the graph data set. An analyzer module collects statistics for the graph dataset, and a data classification module uses the collected statistics to calculate metrics describing the data and relationships in the graph dataset, uses the calculated metrics to group the data and relationships into a plurality of graph dataset subsets and associates each graph dataset subset with one of the plurality of storage methods. The resulting group of storage methods associated with the plurality of graph dataset subsets includes a unique storage method for each graph dataset subset. The data and relationships in each graph dataset subset are arranged in accordance with associated storage methods.

公开(公告)号：US09785673B2

公开(公告)日：2017-10-10

申请号：US15196237

申请日：2016-06-29

Applicant: International Business Machines Corporation

Inventor： Mihaela A. Bornea ,  Julian Dolby ,  Achille B. Fokoue-Nkoutche ,  Anastasios Kementsietsidis ,  Kavitha Srinivas

IPC: G06F17/30 ,  G06F7/00

CPC classification number: G06F17/30469 ,  G06F17/30442 ,  G06F17/30477 ,  G06F17/3053 ,  G06F17/30935 ,  G06F17/30958

Abstract: Systems and methods for optimizing a query, and more particularly, systems and methods for finding optimal plans for graph queries by casting the task of finding the optimal plan as an integer programming (ILP) problem. A method for optimizing a query, comprises building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern, determining a plurality of flows of query variables between the plurality of components, and determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query.

公开(公告)号：US20170154052A1

公开(公告)日：2017-06-01

申请号：US14954664

申请日：2015-11-30

Applicant: International Business Machines Corporation

Inventor： Oktie Hassanzadeh ,  Anastasios Kementsietsidis

IPC: G06F17/30

CPC classification number: G06F16/35 ,  G06F16/215

Abstract: An apparatus and method of identifying semantically related records, including receiving input data from an input device, splitting the input data into a plurality of clusters according to semantic relationship, each of the clusters including a plurality of source terms and a plurality of target terms, transforming each of the plurality of clusters based on the transformation which includes tokenization of the plurality of clusters, for each of the plurality of clusters that are transformed, finding relatedness scores of a plurality of semantic relatedness measures with the plurality of target terms, building a vector of similarity scores for each of the plurality of target terms, and for each of the plurality of source terms, selecting a predetermined number of the plurality of target terms according to the similarity scores.

公开(公告)号：US09323864B2

公开(公告)日：2016-04-26

申请号：US13967031

申请日：2013-08-14

Applicant: International Business Machines Corporation

Inventor： Mihaela Ancuta Bornea ,  Julian Timothy Dolby ,  Achille Belly Fokoue-Nkoutche ,  Anastasios Kementsietsidis ,  Kavitha Srinivas

IPC: G06F17/30

CPC classification number: G06F17/30958 ,  G06F17/30292

Abstract: A system for identifying a schema for storing graph data includes a database containing a graph dataset of data and relationships between data pairs and a list of storage methods that each are a distinct structural arrangement of the data and relationships from the graph data set. An analyzer module collects statistics for the graph dataset, and a data classification module uses the collected statistics to calculate metrics describing the data and relationships in the graph dataset, uses the calculated metrics to group the data and relationships into a plurality of graph dataset subsets and. associates each graph dataset subset with one of the plurality of storage methods. The resulting group of storage methods associated with the plurality of graph dataset subsets includes a unique storage method for each graph dataset subset. The data and relationships in each graph dataset subset are arranged in accordance with associated storage methods.

Abstract translation: 用于识别用于存储图形数据的模式的系统包括数据库，该数据库包含数据的图形数据集和数据对之间的关​​系以及存储方法的列表，每个存储方法是与图形数据集的数据和关系的不同结构布置。 分析器模块收集图形数据集的统计信息，数据分类模块使用收集的统计信息来计算描述图形数据集中的数据和关系的度量，使用计算的度量将数据和关系分组为多个图形数据集子集，以及 。 将每个图形数据集子集与多个存储方法之一相关联。 与多个图形数据集子集相关联的所得到的存储方法组包括用于每个图形数据集子集的唯一存储方法。 每个图形数据集子集中的数据和关系按照相关的存储方法进行排列。

公开(公告)号：US20150213089A1

公开(公告)日：2015-07-30

申请号：US14680705

申请日：2015-04-07

Applicant: International Business Machines Corporation

Inventor： Mihaela Ancuta Bornea ,  Julian Timothy Dolby ,  Anastasios Kementsietsidis ,  Kavitha Srinivas

IPC: G06F17/30

CPC classification number: G06F17/30442 ,  G06F17/3043 ,  G06F17/30463 ,  G06F17/30466 ,  G06F17/30657 ,  G06F17/30958

Abstract: A semantic query over an RDF database is received with RDF database statistics and access methods for evaluating triple patterns in the query. The semantic query is expressed as a parse tree containing triple patterns and logical relationships among the triple patterns. The parse tree and access methods create a data flow graph containing a plurality of triple pattern and access method pair nodes connected by a plurality of edges, and an optimal flow tree through the data flow graph is determined such that costs are minimized and all triple patterns in the semantic query are contained in the optimal flow tree. A structure independent execution tree defining a sequence of evaluation through the optimal flow tree is created and is transformed into a database structure dependent query plan. This is used to create an SQL query that is used to evaluate the semantic query over the RDF database.

Abstract translation: 接收RDF数据库的语义查询，RDF数据库统计和访问方法用于评估查询中的三重模式。 语义查询表示为包含三重模式之间的三重模式和逻辑关系的解析树。 解析树和访问方法创建包含通过多个边缘连接的多个三重模式和访问方法对节点的数据流图，并且确定通过数据流图的最佳流树，使得成本最小化，并且所有三重模式 在语义查询中包含在最优流树中。 创建通过最优流树定义评估序列的结构独立执行树，并将其转换为依赖于数据库结构的查询计划。 这用于创建一个SQL查询，用于评估RDF数据库中的语义查询。

公开(公告)号：US08977650B2

公开(公告)日：2015-03-10

申请号：US13683057

申请日：2012-11-21

Applicant: International Business Machines Corporation

Inventor： Songyun Duan ,  Achille Belly Fokoue-Nkoutche ,  Anastasios Kementsietsidis ,  Wangchao Le ,  Feifei Li ,  Kavitha Srinivas

IPC: G06F17/30

CPC classification number: G06F17/30292

Abstract: Keyword searching is used to explore and search large Resource Description Framework datasets having unknown or constantly changing structures. A succinct and effective summarization is built from the underlying resource description framework data. Given a keyword query, the summarization lends significant pruning powers to exploratory keyword searches and leads to much better efficiency compared to previous work. The summarization returns exact results and can be updated incrementally and efficiently.

公开(公告)号：US10387496B2

公开(公告)日：2019-08-20

申请号：US14718147

申请日：2015-05-21

Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION

Inventor： Achille B. Fokoue-Nkoutche ,  Gang Hu ,  Anastasios Kementsietsidis ,  Kavitha Srinivas ,  Wen B. Sun ,  Guo Tong Xie

IPC: G06F16/22 ,  G06F16/901 ,  G06F16/28 ,  G06F16/2452

Abstract: Embodiments include methods, systems and computer program products for storing graph data for a directed graph in a relational database. Aspects include creating a plurality of relational tables for the graph data, using a processor on a computer, the plurality of relational tables including adjacency tables and attribute tables. Each row of the attribute tables is dedicated to a subject of the graph data in the dataset and stores a JavaScript Object Notation (JSON) object corresponding to the subject. Each row of the adjacency tables includes a hashtable containing properties and values of the subject for that row.

公开(公告)号：US10031922B2

公开(公告)日：2018-07-24

申请号：US14796776

申请日：2015-07-10

Applicant: International Business Machines Corporation

Inventor： Achille B. Fokoue-Nkoutche ,  Anastasios Kementsietsidis ,  Spyros Kotoulas ,  Muhammad Mustafa Rafique

IPC: G06F17/30

Abstract: A method for query evaluation comprises receiving a query over a set of distributed data sources, decomposing the query into a set of sub-queries of the query, evaluating each sub-query in the set of sub-queries with respect to each data source in the set of distributed data sources, wherein evaluating comprises determining which data sources in the set of distributed data sources are capable of answering each sub-query and at what cost, computing a set of distributed plans by composing one or more of the sub-queries in one or more of the data sources, evaluating each plan in the set of distributed plans, selecting a sub-set of plans from the set of distributed plans to be executed for responding to the query, executing the selected sub-set of plans, and returning results of the query.

公开(公告)号：US10025795B2

公开(公告)日：2018-07-17

申请号：US14666837

申请日：2015-03-24

Applicant: International Business Machines Corporation

Inventor： Achille B. Fokoue-Nkoutche ,  Anastasios Kementsietsidis ,  Spyros Kotoulas ,  Muhammad Mustafa Rafique

IPC: G06F17/30

Abstract: A method for query evaluation comprises receiving a query over a set of distributed data sources, decomposing the query into a set of sub-queries of the query, evaluating each sub-query in the set of sub-queries with respect to each data source in the set of distributed data sources, wherein evaluating comprises determining which data sources in the set of distributed data sources are capable of answering each sub-query and at what cost, computing a set of distributed plans by composing one or more of the sub-queries in one or more of the data sources, evaluating each plan in the set of distributed plans, selecting a sub-set of plans from the set of distributed plans to be executed for responding to the query, executing the selected sub-set of plans, and returning results of the query.