Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re^3: In search of an algorithm for loading cyclic graphs

by dynamo (Chaplain)
on May 17, 2005 at 18:38 UTC ( #457936=note: print w/replies, xml ) Need Help??


in reply to Re^2: In search of an algorithm for loading cyclic graphs
in thread In search of an algorithm for loading cyclic graphs

I'm not sure where the problem is here. If you know that the ids are unique within each table, and you know the table to be looking in for a given id (from the field name), doesn't that uniquely identify what each field is trying to point to?

If not, why not just assign each table a starting number, with room for a few million (or however many seems appropriate) rows between each starting number?

What kind of 'indigestion' does your code get?

  • Comment on Re^3: In search of an algorithm for loading cyclic graphs

Replies are listed 'Best First'.
Re^4: In search of an algorithm for loading cyclic graphs
by samtregar (Abbot) on May 17, 2005 at 18:46 UTC
    Does my answer to your question below help? I'm not sure how to better explain it...

    But really, I'm not looking for help hacking the code. I'm looking for pointers to a generic comp-sci algorithm that applies to loading huge cyclic graphs, with all the problems that causes. If my explanation so far hasn't suggested something to you then either it doesn't exist or you don't know it.

    -sam

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (6)
As of 2023-02-06 00:36 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I prefer not to run the latest version of Perl because:







    Results (33 votes). Check out past polls.

    Notices?