[lkml]   [1998]   [Sep]   [15]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
    SubjectAVL and hash in memory management
     As far as i know some developers tried to use hash instead of 
    AVL and recieve worth perfomance.
    I suggest use AVL with hash together for example:

    Hash array: ([0] [1] [2] [3] [4]...)
    | | | | |
    V V V V V
    NUL [Yes] NUL NUL [Yes]
    / \ / \
    [Yes] [Yes] [Yes]NUL
    / \ / \

    I am thinking this method can give better perfomance becouse tree
    becomes smaller in N times, where N is a number of elements in hash

    -------------------------------- |8|-) -----------------
    Sorry, if it was useless MAX...
    My hello to developers.

    Get Your Private, Free Email at

    To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
    the body of a message to
    Please read the FAQ at

     \ /
      Last update: 2005-03-22 13:44    [W:0.029 / U:54.024 seconds]
    ©2003-2017 Jasper Spaans. hosted at Digital OceanAdvertise on this site