Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6788405
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 26, 20262026-05-26T17:28:55+00:00 2026-05-26T17:28:55+00:00

I’m working on a specialized on-disk hashtable (prior experiments with Berkeley, ManagedESENT, etc. didn’t

  • 0

I’m working on a specialized on-disk hashtable (prior experiments with Berkeley, ManagedESENT, etc. didn’t pan out). It has a fairly simple chained structure, with each key-value pair (KVP) followed in the file by a long (Int64) value that points to the next KVP in the chain (and uses a value of zero if there isn’t one). I’m using MD5 to generate the hash code.

When profiling the code to assess the speed of adding entries, the hash function is responsible for about 55% of the running time, which isn’t totally surprising. But about 25% of that time is coming from the binForm.Serialize(ms, obj) call in the ObjectToByteArray serialization function. Both functions are shown below. I’m assuming I can’t make any big gains on the hash algorithm itself, but I’m wondering if I can eke some performance out of the serialization function?

    // Compute hash code
    long hash(object s)
    {
        byte[] y = md5.ComputeHash(ObjectToByteArray(s)); // Produces byte[16]
        long z = BitConverter.ToInt64(y, 0);
        long res = z & bitMask;
        return res;
    }

    // Convert an object to a byte array
    private byte[] ObjectToByteArray(Object obj)
    {
        if (obj == null)
            return null;

        MemoryStream ms = new MemoryStream();
        binForm.Serialize(ms, obj);
        return ms.ToArray();
    }
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-26T17:28:56+00:00Added an answer on May 26, 2026 at 5:28 pm

    Use protobuf.net, found here, it’s far quicker!

    Update

    From looking at your code I assume there is no requriement that computed hashes be consistent across AppDomains? If not computing your HashCode can be as simple as:

    private static long GenerateHash(object key)
    {
      long typeHash = key.GetType().GetHashCode();
      long keyHash = key.GetHashCode();
      return (typeHash << 32) + keyHash;
    }
    

    For future reference, your MemoryStream should really be in a using block, or else you run the risk of leaking memory:

    private byte[] ObjectToByteArray(Object obj)
    {
        if (obj == null)
            return null;
    
        using (MemoryStream ms = new MemoryStream()) 
        {
          binForm.Serialize(ms, obj);
          return ms.ToArray();
        }   
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I'm parsing an RSS feed that has an &#8217; in it. SimpleXML turns this
link Im having trouble converting the html entites into html characters, (&# 8217;) i
That's pretty much it. I'm using Nokogiri to scrape a web page what has
I want to count how many characters a certain string has in PHP, but
Basically, what I'm trying to create is a page of div tags, each has
I've got a string that has curly quotes in it. I'd like to replace
I'm trying to decode HTML entries from here NYTimes.com and I cannot figure out
I'm working with an upstream system that sometimes sends me text destined for HTML/XML
I have a string like this: La Torre Eiffel paragonata all&#8217;Everest What PHP function
I have just tried to save a simple *.rtf file with some websites and

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.