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

  • Home
  • SEARCH
  • 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 7686655
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 31, 20262026-05-31T19:31:44+00:00 2026-05-31T19:31:44+00:00

I need to store maybe 250 million records of String -> String mappings and

  • 0

I need to store maybe 250 million records of String -> String mappings and a database seems overload for this sort of thing.

I can’t store this in memory as it will run out of heap space. I could extend the heap space, but I’d prefer not to do this.

I want as fast access as I can get to a single mapping as possible and wanted to know the best way to go about this.

The initial String is unique and what I will be searching by. I also know the range the string length will lie in, but its mapped value could be any length.

Is it possible to get something as fast as a database for searching? I’m guessing not but just wanted to be sure.

I’m working in Java, but I assume this will be language independent.

  • 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-31T19:31:45+00:00Added an answer on May 31, 2026 at 7:31 pm

    Redis http://redis.io/ is what you need!

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a spatially enabled database (DB2, in this case). I need to store
I'm doing this database design stuff for a system where i need to store
I need a database that can store a large number of BLOBS. The BLOBs
I need to store various info about some movies, books, games, and maybe other
I need to store products for an e-commerce solution in a database. Each product
I need store multiple currencies on my database... Here's the problem: Example Tables: [
I need to store QSet[QTime] (or similar) data. The thing that i want to
Building a relatively simple website, and need to store some data in the database
I'm not too sure how to ask this question. I need to store a
I need to securely store private user data so it can persist across my

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.