Extracting Basic Graph Patterns from Triple Pattern Fragment Logs

06/20/2019
by   Nassopoulos Georges, et al.
0

The Triple Pattern Fragment (TPF) approach is de-facto a new way to publish Linked Data at low cost and with high server availability. However, data providers hosting TPF servers are not able to analyze the SPARQL queries they execute because they only receive and evaluate queries with one triple pattern. In this paper, we propose LIFT: an algorithm to extract Basic Graph Patterns (BGPs) of executed queries from TPF server logs. Experiments show that LIFT extracts BGPs with good precision and good recall generating limited noise.

READ FULL TEXT

page 12

page 14

research
03/25/2011

An Empirical Study of Real-World SPARQL Queries

Understanding how users tailor their SPARQL queries is crucial when desi...
research
11/18/2015

Behavior Query Discovery in System-Generated Temporal Graphs

Computer system monitoring generates huge amounts of logs that record th...
research
09/21/2022

Evaluating Continuous Basic Graph Patterns over Dynamic Link Data Graphs

In this paper, we investigate the problem of evaluating Basic Graph Patt...
research
04/10/2018

Semantic embeddings for program behavior patterns

In this paper, we propose a new feature extraction technique for program...
research
02/21/2020

Star Pattern Fragments: Accessing Knowledge Graphs through Star Patterns

The Semantic Web offers access to a vast Web of interlinked information ...
research
08/01/2017

An Analytical Study of Large SPARQL Query Logs

With the adoption of RDF as the data model for Linked Data and the Seman...
research
09/10/2019

Lifelog Patterns Analyzation using Graph Embedding based on Deep Neural Network

Recently, as the spread of smart devices increases, the amount of data c...

Please sign up or login with your details

Forgot password? Click here to reset