Beefy Boxes and Bandwidth Generously Provided by pair Networks
good chemistry is complicated,
and a little bit messy -LW
 
PerlMonks  

Re: Efficiently Walking Large Data Structures Stored Across Multiple Tables

by iburrell (Chaplain)
on Mar 01, 2004 at 20:59 UTC ( [id://333054]=note: print w/replies, xml ) Need Help??


in reply to Efficiently Walking Large Data Structures Stored Across Multiple Tables

First, can you write a SQL statement that gives the information you need from the current schema? Class::DBI can be inefficient when doing traversals across multiple objects because it does lots of individual queries instead of a single query with joins.

If you can write some SQL statements that do the job with the current schema, then you don't need to deal with trees or nested sets or anything like that.

  • Comment on Re: Efficiently Walking Large Data Structures Stored Across Multiple Tables

Log In?
Username:
Password:

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

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

    No recent polls found