Linked Data Management 2016
DOI: 10.1201/b16859-13
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Query Processing in RDF Databases

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
4
0

Year Published

2016
2016
2017
2017

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 0 publications
0
4
0
Order By: Relevance
“…Table 2 illustrates that 2620 the tool can process data sets of different sizes. Thus, the schema transformation is feasible and efficient even for large data sets by benefiting from indexing techniques to deploy efficient access on SPARQL endpoints [37]. Table 7 show the percentage of users that successfully performed the redefinition and enrichment tasks with the tool, respectively.…”
Section: Levelmemberoutdegreementioning
confidence: 99%
See 1 more Smart Citation
“…Table 2 illustrates that 2620 the tool can process data sets of different sizes. Thus, the schema transformation is feasible and efficient even for large data sets by benefiting from indexing techniques to deploy efficient access on SPARQL endpoints [37]. Table 7 show the percentage of users that successfully performed the redefinition and enrichment tasks with the tool, respectively.…”
Section: Levelmemberoutdegreementioning
confidence: 99%
“…At the time of writing 37 http://www.w3.org/2011/gld/wiki/ISO_Extensions_ to_SKOS 38 http://rdf-vocabulary.ddialliance.org/xkos.html this paper, this proposal is in a preliminary status.…”
mentioning
confidence: 99%
“…Table 2 illustrates that 2620 the tool can process data sets of different sizes. Thus, the schema transformation is feasible and efficient even for large data sets by benefiting from indexing techniques to deploy efficient access on SPARQL endpoints [37]. Usability.…”
Section: Levelmemberoutdegreementioning
confidence: 99%
“…Kämpgen et al [43,44] attempt to override the lack of structure in QB, discussed in Section 3, defining an OLAP data model on top of QB and other related vocabularies, e.g., some proposed ISO extensions to SKOS. 37 . They propose to represent each level as an in-2760 stance of a class skosclass:ClassificationLevel and organize levels in hierarchies via stating the depth of each level in the hierarchy using the skosclass:depth property.…”
mentioning
confidence: 99%