Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

When in doubt, sort

by Thelonius (Priest)
on Mar 23, 2002 at 03:46 UTC ( #153716=note: print w/replies, xml ) Need Help??


in reply to Up for Critique

A generally good strategy for a load is to parse the data, writing the data out into one file for each table. Then sort the data in each file on the field(s) that you are doing your SELECT on.

If the database is empty before your run (it's not clear from your description), then you don't need to index until you are done. Any duplicates will be in consecutive records after you sort, so you will know when there are duplicates.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://153716]
help
Chatterbox?
NodeReaper says "Shhhh! Be vewy vewy quiet, I'm hunting wumpus"

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (5)
As of 2018-01-22 09:03 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    How did you see in the new year?










    Results (233 votes). Check out past polls.

    Notices?