Extracting Basic Graph Patterns from Triple Pattern Fragment Logs
Nassopoulos Georges, Serrano-Alvarado Patricia, Molli Pascal and, Desmontils Emmanuel
TL;DR
This paper introduces LIFT, an algorithm that extracts complex Basic Graph Patterns from TPF server logs, enabling better analysis of SPARQL queries without requiring full query logs.
Contribution
LIFT is a novel algorithm that accurately extracts BGPs from TPF logs, improving data providers' ability to analyze executed queries.
Findings
LIFT achieves high precision and recall in extracting BGPs.
The approach generates limited noise in the extracted patterns.
Experimental results validate the effectiveness of LIFT.
Abstract
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.
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSemantic Web and Ontologies · Data Mining Algorithms and Applications · Advanced Database Systems and Queries