[
https://issues.apache.org/jira/browse/HBASE-2433?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12856318#action_12856318
]
Hyunsik Choi commented on HBASE-2433:
-------------------------------------
Both papers aims at reducing the number of joins. Is right? They does not
eliminate joins, whereas joins that both papers cannot eliminate is common as
you can see the berlin benchmark (
http://www4.wiwiss.fu-berlin.de/bizer/BerlinSPARQLBenchmark/spec/index.html ).
In such cases, it may be inevitable to use MapReduce to process join processing
on large-scale RDF data sets. If you makes use of other distributed computing
model (i.e., instead of MapReduce) specified to RDF query processing , I could
understand.
Besides, Hexastore makes use of six indices in six possible ways of RDF
triples. Is right? I wonder how is it implemented based on Hbase.
> RDF and SPARQL with HBase - Features and design specs
> -----------------------------------------------------
>
> Key: HBASE-2433
> URL: https://issues.apache.org/jira/browse/HBASE-2433
> Project: Hadoop HBase
> Issue Type: Improvement
> Components: contrib
> Reporter: Amandeep Khurana
> Assignee: Amandeep Khurana
>
> This is for scoping out the feature set and the design specifications for the
> RDF store over HBase and the query capability it will have. I'll be posting
> some initial ideas soon.
> The key goals for this layer are:
> 1. Scalability
> 2. Support for interactive queries (this one seems to be the biggest
> challenge)
> We would need to define the subset of queries we will support. We'll probably
> begin with SELECT queries.
--
This message is automatically generated by JIRA.
-
If you think it was sent incorrectly contact one of the administrators:
https://issues.apache.org/jira/secure/Administrators.jspa
-
For more information on JIRA, see: http://www.atlassian.com/software/jira
