You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@hbase.apache.org by "vamshi (JIRA)" <ji...@apache.org> on 2011/07/25 07:35:09 UTC

[jira] [Created] (HBASE-4137) Implementation of Distributed Hash Table(DHT)

Implementation of Distributed Hash Table(DHT) 
----------------------------------------------

                 Key: HBASE-4137
                 URL: https://issues.apache.org/jira/browse/HBASE-4137
             Project: HBase
          Issue Type: Improvement
          Components: performance
    Affects Versions: 0.90.3
            Reporter: vamshi


To implement  a scalable data structure i.e Distributed hash table in the HBase.   

--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira

        

[jira] [Commented] (HBASE-4137) Implementation of Distributed Hash Table(DHT) for lookup service

Posted by "stack (JIRA)" <ji...@apache.org>.
    [ https://issues.apache.org/jira/browse/HBASE-4137?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13070804#comment-13070804 ] 

stack commented on HBASE-4137:
------------------------------

Can you describe what you are trying to do?  What do you mean by 'lookup service'?  What are you looking up?  And why would we put in place a DHT for lookups when there is already a means of locating data.  Thanks.

> Implementation of Distributed Hash Table(DHT)  for lookup service
> -----------------------------------------------------------------
>
>                 Key: HBASE-4137
>                 URL: https://issues.apache.org/jira/browse/HBASE-4137
>             Project: HBase
>          Issue Type: Improvement
>          Components: performance
>    Affects Versions: 0.90.3
>            Reporter: vamshi
>
> To implement  a scalable data structure i.e Distributed hash table in the HBase. In the Hbase to perform fast lookup  we can take the help of Distributed Hash Table (DHT), a scalable data structure.

--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira

        

[jira] [Resolved] (HBASE-4137) Implementation of Distributed Hash Table(DHT) for lookup service

Posted by "stack (JIRA)" <ji...@apache.org>.
     [ https://issues.apache.org/jira/browse/HBASE-4137?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

stack resolved HBASE-4137.
--------------------------

    Resolution: Incomplete


The description does not seem to apply to hbase and the description has been sprayed across a few random issues which leads me to believe the author is not clear themselves on what is wanted.

Resolving as incomplete.

> Implementation of Distributed Hash Table(DHT)  for lookup service
> -----------------------------------------------------------------
>
>                 Key: HBASE-4137
>                 URL: https://issues.apache.org/jira/browse/HBASE-4137
>             Project: HBase
>          Issue Type: Improvement
>          Components: performance
>    Affects Versions: 0.90.3
>            Reporter: vamshi
>
> To implement  a scalable data structure i.e Distributed hash table in the HBase. In the Hbase to perform fast lookup  we can take the help of Distributed Hash Table (DHT), a scalable data structure.

--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira

        

[jira] [Updated] (HBASE-4137) Implementation of Distributed Hash Table(DHT) for lookup service

Posted by "vamshi (JIRA)" <ji...@apache.org>.
     [ https://issues.apache.org/jira/browse/HBASE-4137?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

vamshi updated HBASE-4137:
--------------------------

    Description: To implement  a scalable data structure i.e Distributed hash table in the HBase. In the Hbase to perform fast lookup  we can take the help of Distributed Hash Table (DHT), a scalable data structure.  (was: To implement  a scalable data structure i.e Distributed hash table in the HBase.   )
        Summary: Implementation of Distributed Hash Table(DHT)  for lookup service  (was: Implementation of Distributed Hash Table(DHT) )

> Implementation of Distributed Hash Table(DHT)  for lookup service
> -----------------------------------------------------------------
>
>                 Key: HBASE-4137
>                 URL: https://issues.apache.org/jira/browse/HBASE-4137
>             Project: HBase
>          Issue Type: Improvement
>          Components: performance
>    Affects Versions: 0.90.3
>            Reporter: vamshi
>
> To implement  a scalable data structure i.e Distributed hash table in the HBase. In the Hbase to perform fast lookup  we can take the help of Distributed Hash Table (DHT), a scalable data structure.

--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira

        

[jira] [Commented] (HBASE-4137) Implementation of Distributed Hash Table(DHT) for lookup service

Posted by "stack (JIRA)" <ji...@apache.org>.
    [ https://issues.apache.org/jira/browse/HBASE-4137?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13071947#comment-13071947 ] 

stack commented on HBASE-4137:
------------------------------

bq. Are they stored in two different special machines in which no other regions stored? 

No

bq. please give me a clarity on it..so that i can move ahead. Thank you stack..

I think you are trying to solve a problem we don't have.  I'd suggest you read the bigtable paper.  There it describes how root and meta are used/cached and rarely accessed.

> Implementation of Distributed Hash Table(DHT)  for lookup service
> -----------------------------------------------------------------
>
>                 Key: HBASE-4137
>                 URL: https://issues.apache.org/jira/browse/HBASE-4137
>             Project: HBase
>          Issue Type: Improvement
>          Components: performance
>    Affects Versions: 0.90.3
>            Reporter: vamshi
>
> To implement  a scalable data structure i.e Distributed hash table in the HBase. In the Hbase to perform fast lookup  we can take the help of Distributed Hash Table (DHT), a scalable data structure.

--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira

        

[jira] [Commented] (HBASE-4137) Implementation of Distributed Hash Table(DHT) for lookup service

Posted by "vamshi (JIRA)" <ji...@apache.org>.
    [ https://issues.apache.org/jira/browse/HBASE-4137?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13071638#comment-13071638 ] 

vamshi commented on HBASE-4137:
-------------------------------

Hi stack, i thought in some different manner and i posted that description. i had a different view then.i'll change it once i get a clear perspective  from the below queries..    

I have small doubt regarding Root and .META. Actually where the Root and .META. are stored in the HBase cluster? Are they stored in two different special machines in which no other regions stored? 
One more thing is, is Root and  .META. distributed or they are fully present in a single system (same or different systems)?  
If Root is present on a single system and if there are somany requests from clents(for first time) which is obvious in real time environment, it might be a bottle neck for Root .In that case to get rid-off the Root from that problem, can we distribute the Root? And can we use DHT(Distributed Hash table) then, for load balancing of requests?  
please give me a clarity on it..so that i can move ahead.   Thank you stack..

> Implementation of Distributed Hash Table(DHT)  for lookup service
> -----------------------------------------------------------------
>
>                 Key: HBASE-4137
>                 URL: https://issues.apache.org/jira/browse/HBASE-4137
>             Project: HBase
>          Issue Type: Improvement
>          Components: performance
>    Affects Versions: 0.90.3
>            Reporter: vamshi
>
> To implement  a scalable data structure i.e Distributed hash table in the HBase. In the Hbase to perform fast lookup  we can take the help of Distributed Hash Table (DHT), a scalable data structure.

--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira