Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re^5: Writing a database lookup tool

by elef (Friar)
on Jan 20, 2013 at 09:02 UTC ( #1014263=note: print w/ replies, xml ) Need Help??

in reply to Re^4: Writing a database lookup tool
in thread Writing a database lookup tool

Update: I started playing with DBD::SQLite. I imported 800,000 records into a db, and quickly realized that by default, most of my searches are indeed carried out as sequential searches, which makes them hopelessly slow. With FTS enabled, average lookup times fell from 4 seconds to 0.04 seconds. If this scales in a roughly linear fashion and I get 0.5 sec lookups on 10 million records, I'll be very happy with the speed.
Thanks again.

Comment on Re^5: Writing a database lookup tool

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (6)
As of 2015-11-26 09:35 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (696 votes), past polls