2021
DOI: 10.1007/s00778-021-00711-3
|View full text |Cite
|
Sign up to set email alerts
|

A survey of RDF stores & SPARQL engines for querying knowledge graphs

Abstract: Recent years have seen the growing adoption of non-relational data models for representing diverse, incomplete data. Among these, the RDF graphbased data model has seen ever-broadening adoption, particularly on the Web. This adoption has prompted the standardization of the SPARQL query language for RDF, as well as the development of a variety of local and distributed engines for processing queries over RDF graphs. These engines implement a diverse range of specialized techniques for storage, indexing, and quer… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
22
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 74 publications
(22 citation statements)
references
References 169 publications
0
22
0
Order By: Relevance
“…There are two key points for complex join queries: join ordering and selecting the most suitable join algorithm [29]. Algorithm 1 shows a detailed illustration of our SPARQL join query algorithm for semantic search.…”
Section: Sparql Join Query Algorithms For Learned Semantic Indexmentioning
confidence: 99%
“…There are two key points for complex join queries: join ordering and selecting the most suitable join algorithm [29]. Algorithm 1 shows a detailed illustration of our SPARQL join query algorithm for semantic search.…”
Section: Sparql Join Query Algorithms For Learned Semantic Indexmentioning
confidence: 99%
“…Such an approach aims to learn from a set of examples a classification or regression function, making it possible to subsequently provide an assignment to one of the classes (corresponding to the modes of operation) for any newly provided measurement. We also speak of diagnosis by pattern recognition (Resource Description Framework (RDF)) [7] insofar as the processing developed will seek to recognize the "shape" of the observation in order to affect it then. The set of N examples used to learn this relation is called the set learning process, each example is made up of variables or descriptors generally with a value in ℝ 𝑃 describing the measurement signals.…”
Section: Introductionmentioning
confidence: 99%
“…How such a graph is stored on disk, can change between database management systems. An example of a more specific graph database model are, triple stores, which store everything as an edge, including properties, while other graph database engines store data in different manners, for example as a multigraph or adjacency list [12] , [13] However this review will not cover this topic in more detail, and while there are performance difference to be observed between different data management and storage options for specific use cases, this topic is of lower relevance for users wishing to use a ready-made solution, i.e. a database management system.…”
Section: Introductionmentioning
confidence: 99%
“…a database management system. More information on this topic can be found in these reviews [12] , [13] .…”
Section: Introductionmentioning
confidence: 99%