2016
DOI: 10.1007/s10796-016-9692-4
|View full text |Cite
|
Sign up to set email alerts
|

Practical parallel string matching framework for RDF entailments with GPUs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…This limitation is eliminated in the next version (demonstrated in the future version [49]) where the vector is used in placed of the hash table. Also, if the total triplesâ Ȃ Ź sizes are too large for the available GPU memory, it can also be scaled out to use multiple GPUs to hold several portions of TripleID data similarly as in [50]. Streaming process is another solution to overcome this limit.…”
Section: Discussionmentioning
confidence: 99%
“…This limitation is eliminated in the next version (demonstrated in the future version [49]) where the vector is used in placed of the hash table. Also, if the total triplesâ Ȃ Ź sizes are too large for the available GPU memory, it can also be scaled out to use multiple GPUs to hold several portions of TripleID data similarly as in [50]. Streaming process is another solution to overcome this limit.…”
Section: Discussionmentioning
confidence: 99%