公开(公告)号：US20160342628A1

公开(公告)日：2016-11-24

申请号：US14718411

申请日：2015-05-21

Applicant: Oracle International Corporation

Inventor： Oskar Van Rest ,  Raghavan Raman ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F17/30

CPC classification number: G06F16/835 ,  G06F16/832

Abstract: Techniques herein are for query editing with semantic analysis of a query based on information extracted from a tuple graph. In an embodiment, a computerized method involves processing a dataset to extract an extracted schema that describes types and relationships that occur within the dataset. The dataset is not associated with a schema that is not contained in the dataset. The dataset has a graph of tuples. During an incremental parse, an abstract syntax tree (AST) that represents a query is modified. The extracted schema and the dataset are used to perform semantic analysis on the AST. In an embodiment, the tuples are resource description framework (RDF) triples. In an embodiment, the RDF triples include RDF schema statements. Extracting an extracted schema involves processing RDF schema statements. In an embodiment, the query is a SPARQL query and semantic analysis includes error alerting and code completion.

Abstract translation: 本文中的技术用于基于从元组图提取的信息对查询进行语义分析的查询编辑。 在一个实施例中，计算机化方法涉及处理数据集以提取描述在数据集内发生的类型和关系的提取的模式。 数据集不与数据集中不包含的模式相关联。 数据集有一个元组图。 在增量解析过程中，修改了一个表示查询的抽象语法树（AST）。 提取的模式和数据集用于对AST执行语义分析。 在一个实施例中，元组是资源描述框架（RDF）三元组。 在一个实施例中，RDF三元组包括RDF模式语句。 提取提取的模式涉及处理RDF模式语句。 在一个实施例中，查询是SPARQL查询，语义分析包括错误警报和代码完成。

公开(公告)号：US09928310B2

公开(公告)日：2018-03-27

申请号：US14461184

申请日：2014-08-15

Applicant: Oracle International Corporation

Inventor： Raghavan Raman ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F17/30

CPC classification number: G06F17/30958 ,  G06F17/30979

Abstract: Techniques for identifying, in a target graph, subgraphs that match a query graph are provided. Processing a query graph comprises multiple stages, one for each query node in the query graph. In the first stage, a query node is selected, different portions of the target graph are assigned to different threads, each thread identifies nodes that match the selected query node and stores the identities of those nodes in storage that is local to the thread. The results of each thread are then stored in a “global” data structure. In the second stage, a second query node is selected and different portions of the global data structure are assigned to different threads. Each thread identifies nodes that match the second query node and that are connected to a previously-matched node. The second stage repeats until all nodes in the query graph are processed.

公开(公告)号：US20160048607A1

公开(公告)日：2016-02-18

申请号：US14461184

申请日：2014-08-15

Applicant: Oracle International Corporation

Inventor： Raghavan Raman ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F17/30

CPC classification number: G06F17/30958 ,  G06F17/30979

Abstract: Techniques for identifying, in a target graph, subgraphs that match a query graph are provided. Processing a query graph comprises multiple stages, one for each query node in the query graph. In the first stage, a query node is selected, different portions of the target graph are assigned to different threads, each thread identifies nodes that match the selected query node and stores the identities of those nodes in storage that is local to the thread. The results of each thread are then stored in a “global” data structure. In the second stage, a second query node is selected and different portions of the global data structure are assigned to different threads. Each thread identifies nodes that match the second query node and that are connected to a previously-matched node. The second stage repeats until all nodes in the query graph are processed.

Abstract translation: 提供了在目标图中识别与查询图匹配的子图的技术。 处理查询图包括多个阶段，一个查询图中的每个查询节点。 在第一阶段中，选择查询节点，目标图的不同部分被分配给不同的线程，每个线程标识与所选查询节点匹配的节点，并将那些节点的身份存储在线程本地的存储中。 然后将每个线程的结果存储在“全局”数据结构中。 在第二阶段中，选择第二查询节点，并将全局数据结构的不同部分分配给不同的线程。 每个线程标识与第二个查询节点匹配并且连接到先前匹配的节点的节点。 第二阶段重复，直到查询图中的所有节点被处理。