• Corpus ID: 15265269

SPARQLT and its User-Friendly Interface for Managing and Querying the History of RDF Knowledge Bases

  title={SPARQLT and its User-Friendly Interface for Managing and Querying the History of RDF Knowledge Bases},
  author={Shi Gao and Muhao Chen and Maurizio Atzori and Jiaqi Gu and Carlo Zaniolo},
  booktitle={International Workshop on the Semantic Web},
As the real world evolves, the information contained in the knowledge bases is updated accordingly and the evolution history of entities and their properties becomes of great interest to users, who thus need effective query tools to explore it. In this paper, we (i) introduce SPARQL and its user-friendly interface for expressing powerful structured queries on the history of RDF knowledge bases, and (ii) overview its underlying query engine that supports efficient evaluation of such queries and… 

Figures from this paper

User-friendly temporal queries on historical knowledge bases

Integration, Provenance, and Temporal Queries for Large-Scale Knowledge Bases

This dissertation proposes a framework that supports knowledge integration, temporal query evaluation and user-friendly interfaces for large-scale knowledge bases, and introduces IBMiner, a novel NLP-based system that derives knowledge bases from free text and preserves the provenance of extracted triples.

Answering End-User Questions, Queries and Searches on Wikipedia and its History

Two user-friendly systems that seek to make the universal knowledge of Web KBs available to users who neither know SPARQL, nor the internals of the KBs are described and compared.

RDF-TX: A Fast, User-Friendly System for Querying the History of RDF Knowledge Bases

SPARQL T is introduced, a temporal extension of SPARQL that expresses powerful structured queries on temporal RDF graphs, an efficient in-memory query engine that takes advantage of compressed multiversion B+ trees to achieve fast evaluation of SParQL T queries, and a query optimizer that improves selectivity estimation of temporal queries and generates efficient join orders using the statistics of temporal R DF graphs.



SWiPE: searching wikipedia by example

Swipe's SBE approach makes semi-structured documents queryable in an intuitive and user-friendly way and, through Wikipedia, delivers the benefits of querying and exploring large knowledge bases to all Web users.

Applied Temporal RDF: Efficient Temporal Querying of RDF Data with SPARQL

This paper presents a syntax and storage format based on named graphs to express temporal RDF, and shows that it vastly reduces the number of triples by eliminating redundancies resulting in an increased performance for processing and querying.

Scaling RDF with Time

This paper proposes the tGRIN index structure that builds a specialized index for temporal RDF that is physically stored in an RDBMS, and shows that even when these efforts are augmented with well known temporal indexes like R+ trees, SR-trees, ST-index, and MAP21, the t GRIN index exhibits superior performance.

T-SPARQL: A TSQL2-like Temporal Query Language for RDF

A temporal extension of the SPARQL query language for RDF graphs based on a temporal RDF database model employing triple timestamping with temporal elements, which best preserves the scalability property enjoyed by triple storage technologies, especially in a multi-temporal setting.

Efficient Temporal Coalescing Query Support in Relational Database Systems

It is concluded that temporal queries can be best supported by OLAP functions supported in the current SQL:2003 standards, and is demonstrated that the current RDBMS are mature enough to directly support efficient temporal queries.

Introducing Time into RDF

This paper presents a framework to incorporate temporal reasoning into RDF, yielding temporal RDF graphs, and presents a semantics for these kinds of graphs which includes the notion of temporal entailment and a syntax to incorporate this framework into standard R DF graphs, using the RDF vocabulary plus temporal labels.

An asymptotically optimal multiversion B-tree

A multiversion B-tree that supports insertions and deletions of data items at the current version and range queries and exact match queries for any version, current or past and is asymptotically optimal.

Maintaining knowledge about temporal intervals

An interval-based temporal logic is introduced, together with a computationally effective reasoning algorithm based on constraint propagation. This system is notable in offering a delicate balance

Sparqlt: A fast, user-friendly system for querying the history of rdf knowledge bases

  • Sparqlt: A fast, user-friendly system for querying the history of rdf knowledge bases
  • 2015