Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight

Re: List overhead

by jeroenes (Priest)
on Oct 18, 2001 at 12:52 UTC ( #119630=note: print w/replies, xml ) Need Help??

in reply to List overhead

I analyze data consisting of many items but little information per item. I quickly ran across perl's hunger for memory. In my experience (linux 2.2/perl5.6/gcc) perl asks for 43 byte overhead per item (that is just from total memory footprint with large lists in memory, so not really accurate). If your list has 10 million items, you need 400 megabyte of memory. That's simply too much.

There are solutions:

  1. BerkeleyDB
  2. pack/unpack bytestrings
  3. vec on bitstrings
I conincedently started to use the latter one this week, and it works good. For large lists, I have to keep a few flags per item. vec returns or sets bits (the desired number of bits, actually) so you do not need pack conversions, and that really clears up the code.

For really large lists, BerkeleyDB is the way to go. Find it at


"We are not alone"(FZ)

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://119630]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (1)
As of 2017-03-29 04:41 GMT
Find Nodes?
    Voting Booth?
    Should Pluto Get Its Planethood Back?

    Results (343 votes). Check out past polls.