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?
|
---|
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 |
In Section
Seekers of Perl Wisdom