2020
DOI: 10.1007/s10796-020-09998-z
|View full text |Cite
|
Sign up to set email alerts
|

Combining Graph Exploration and Fragmentation for Scalable RDF Query Processing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 27 publications
0
1
0
Order By: Relevance
“…In gStore, each entity node is signed (Signature) and encoded, a binary-based signature graph (Signature Graph) is constructed, and a VS-tree index is established on this basis, the search space is reduced. A novel approach is proposed to perform queries (Basic Graph Patterns, Wildcards, Aggregations and Sorting) on RDF data (Khelil, A., et al 2021). RDF graph exploration is combined with physical fragmentation of triples.…”
Section: Related Workmentioning
confidence: 99%
“…In gStore, each entity node is signed (Signature) and encoded, a binary-based signature graph (Signature Graph) is constructed, and a VS-tree index is established on this basis, the search space is reduced. A novel approach is proposed to perform queries (Basic Graph Patterns, Wildcards, Aggregations and Sorting) on RDF data (Khelil, A., et al 2021). RDF graph exploration is combined with physical fragmentation of triples.…”
Section: Related Workmentioning
confidence: 99%