Redis using too much memory smaller number of keys





.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box;
}







0















I have a redis standalone server, with around 8000 keys at a given instance .
The used_memeory is showing to be around 8.5 GB.



My individuals key-value size is max around 50kb , by that calculation the used_memory should be less than 1 GB (50kb * 8000)



I am using spring RedisTemplate with default pool configuration to connect to redis



Any idea what should I look into, to narrow down where the memory is being consumed ?










share|improve this question























  • What is data storage type for your case i.e. are you using normal key-value or hierarchical data type

    – swayamraina
    Jan 4 at 9:31











  • I am using zset

    – Manas Saxena
    Jan 4 at 9:34


















0















I have a redis standalone server, with around 8000 keys at a given instance .
The used_memeory is showing to be around 8.5 GB.



My individuals key-value size is max around 50kb , by that calculation the used_memory should be less than 1 GB (50kb * 8000)



I am using spring RedisTemplate with default pool configuration to connect to redis



Any idea what should I look into, to narrow down where the memory is being consumed ?










share|improve this question























  • What is data storage type for your case i.e. are you using normal key-value or hierarchical data type

    – swayamraina
    Jan 4 at 9:31











  • I am using zset

    – Manas Saxena
    Jan 4 at 9:34














0












0








0








I have a redis standalone server, with around 8000 keys at a given instance .
The used_memeory is showing to be around 8.5 GB.



My individuals key-value size is max around 50kb , by that calculation the used_memory should be less than 1 GB (50kb * 8000)



I am using spring RedisTemplate with default pool configuration to connect to redis



Any idea what should I look into, to narrow down where the memory is being consumed ?










share|improve this question














I have a redis standalone server, with around 8000 keys at a given instance .
The used_memeory is showing to be around 8.5 GB.



My individuals key-value size is max around 50kb , by that calculation the used_memory should be less than 1 GB (50kb * 8000)



I am using spring RedisTemplate with default pool configuration to connect to redis



Any idea what should I look into, to narrow down where the memory is being consumed ?







redis






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked Jan 3 at 14:55









Manas SaxenaManas Saxena

4942822




4942822













  • What is data storage type for your case i.e. are you using normal key-value or hierarchical data type

    – swayamraina
    Jan 4 at 9:31











  • I am using zset

    – Manas Saxena
    Jan 4 at 9:34



















  • What is data storage type for your case i.e. are you using normal key-value or hierarchical data type

    – swayamraina
    Jan 4 at 9:31











  • I am using zset

    – Manas Saxena
    Jan 4 at 9:34

















What is data storage type for your case i.e. are you using normal key-value or hierarchical data type

– swayamraina
Jan 4 at 9:31





What is data storage type for your case i.e. are you using normal key-value or hierarchical data type

– swayamraina
Jan 4 at 9:31













I am using zset

– Manas Saxena
Jan 4 at 9:34





I am using zset

– Manas Saxena
Jan 4 at 9:34












1 Answer
1






active

oldest

votes


















0














zset internally uses two data structures to hold the same elements in order to get O(log(N)) INSERT and REMOVE operations into a sorted data structure.


The two Data-structures to be specific are,




  • Hash Table

  • Skip list


Storage for ideal cases according to my research is in the following order,
hset < set < zset



I would recommend you to start using hset in case you have hierarchical data storage. This would lower down your memory consumption but might make searching teeny-tiny bit slower (only if one key has more than say a couple of hundred records)






share|improve this answer


























    Your Answer






    StackExchange.ifUsing("editor", function () {
    StackExchange.using("externalEditor", function () {
    StackExchange.using("snippets", function () {
    StackExchange.snippets.init();
    });
    });
    }, "code-snippets");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "1"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f54024737%2fredis-using-too-much-memory-smaller-number-of-keys%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    0














    zset internally uses two data structures to hold the same elements in order to get O(log(N)) INSERT and REMOVE operations into a sorted data structure.


    The two Data-structures to be specific are,




    • Hash Table

    • Skip list


    Storage for ideal cases according to my research is in the following order,
    hset < set < zset



    I would recommend you to start using hset in case you have hierarchical data storage. This would lower down your memory consumption but might make searching teeny-tiny bit slower (only if one key has more than say a couple of hundred records)






    share|improve this answer






























      0














      zset internally uses two data structures to hold the same elements in order to get O(log(N)) INSERT and REMOVE operations into a sorted data structure.


      The two Data-structures to be specific are,




      • Hash Table

      • Skip list


      Storage for ideal cases according to my research is in the following order,
      hset < set < zset



      I would recommend you to start using hset in case you have hierarchical data storage. This would lower down your memory consumption but might make searching teeny-tiny bit slower (only if one key has more than say a couple of hundred records)






      share|improve this answer




























        0












        0








        0







        zset internally uses two data structures to hold the same elements in order to get O(log(N)) INSERT and REMOVE operations into a sorted data structure.


        The two Data-structures to be specific are,




        • Hash Table

        • Skip list


        Storage for ideal cases according to my research is in the following order,
        hset < set < zset



        I would recommend you to start using hset in case you have hierarchical data storage. This would lower down your memory consumption but might make searching teeny-tiny bit slower (only if one key has more than say a couple of hundred records)






        share|improve this answer















        zset internally uses two data structures to hold the same elements in order to get O(log(N)) INSERT and REMOVE operations into a sorted data structure.


        The two Data-structures to be specific are,




        • Hash Table

        • Skip list


        Storage for ideal cases according to my research is in the following order,
        hset < set < zset



        I would recommend you to start using hset in case you have hierarchical data storage. This would lower down your memory consumption but might make searching teeny-tiny bit slower (only if one key has more than say a couple of hundred records)







        share|improve this answer














        share|improve this answer



        share|improve this answer








        edited Jan 4 at 10:26

























        answered Jan 4 at 10:17









        swayamrainaswayamraina

        875813




        875813
































            draft saved

            draft discarded




















































            Thanks for contributing an answer to Stack Overflow!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f54024737%2fredis-using-too-much-memory-smaller-number-of-keys%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            Popular posts from this blog

            MongoDB - Not Authorized To Execute Command

            How to fix TextFormField cause rebuild widget in Flutter

            in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith