TrQuery: An Embedding-based Framework for Recommanding SPARQL Queries

06/16/2018
by   Lijing Zhang, et al.
0

In this paper, we present an embedding-based framework (TrQuery) for recommending solutions of a SPARQL query, including approximate solutions when exact querying solutions are not available due to incompleteness or inconsistencies of real-world RDF data. Within this framework, embedding is applied to score solutions together with edit distance so that we could obtain more fine-grained recommendations than those recommendations via edit distance. For instance, graphs of two querying solutions with a similar structure can be distinguished in our proposed framework while the edit distance depending on structural difference becomes unable. To this end, we propose a novel score model built on vector space generated in embedding system to compute the similarity between an approximate subgraph matching and a whole graph matching. Finally, we evaluate our approach on large RDF datasets DBpedia and YAGO, and experimental results show that TrQuery exhibits an excellent behavior in terms of both effectiveness and efficiency.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/16/2020

Graph Partitioning and Graph Neural Network based Hierarchical Graph Matching for Graph Similarity Computation

Graph similarity computation aims to predict a similarity score between ...
research
08/26/2023

Graph Edit Distance Learning via Different Attention

Recently, more and more research has focused on using Graph Neural Netwo...
research
08/02/2021

Learning Domain-Specific Edit Operations from Model Repositories with Frequent Subgraph Mining

Model transformations play a fundamental role in model-driven software d...
research
07/02/2019

Approximate Similarity Search Under Edit Distance Using Locality-Sensitive Hashing

Edit distance similarity search, also called approximate pattern matchin...
research
09/10/2018

Convolutional Neural Networks for Fast Approximation of Graph Edit Distance

Graph Edit Distance (GED) computation is a core operation of many widely...
research
05/14/2020

Hierarchical and Fast Graph Similarity Computation via Graph Coarsening and Deep Graph Learning

In this work, we are interested in the large graph similarity computatio...
research
11/30/2020

Combinatorial Learning of Graph Edit Distance via Dynamic Embedding

Graph Edit Distance (GED) is a popular similarity measurement for pairwi...

Please sign up or login with your details

Forgot password? Click here to reset