Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re^2: Memory efficient way to deal with really large arrays?

by eyepopslikeamosquito (Archbishop)
on Dec 15, 2020 at 22:06 UTC ( [id://11125265]=note: print w/replies, xml ) Need Help??


in reply to Re: Memory efficient way to deal with really large arrays?
in thread Memory efficient way to deal with really large arrays?

Hi SunnyD. Though I can't speak for the OP, when I asked my similar question, I assumed, without testing, that a database would be way slower than an in-memory data structure. Reading all the answers to the reply below (including one by your beloved long lost hero BrowserUk), shows that SQLite was tried but abandoned as being way too slow:

Update: After browsing an old BrowserUk performance-related Judy array thread, I see that you stuck your unwanted SunnyD SQLite oar into that thread three times:

  • Comment on Re^2: Memory efficient way to deal with really large arrays?

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://11125265]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others scrutinizing the Monastery: (5)
As of 2024-04-23 16:18 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found