[prev in list] [next in list] [prev in thread] [next in thread] 

List:       interchange-users
Subject:    Re: [ic] Shipping in Interchange 6
From:       "Stefan Hornburg (Racke)" <racke () linuxia ! de>
Date:       2014-07-28 10:41:39
Message-ID: 53D628E3.6050502 () linuxia ! de
[Download RAW message or body]

On 07/26/2014 05:34 AM, Greg Sabino Mullane wrote:
>> The conditions are in a tree structure and a shipment rate belongs
>> the root node of one these conditions.
> 
> I'm not sure why this warrants the complexity of a tree (perhaps a 
> better example?), but:
> 
>> Adjacency list
>> Nested set
>> Closure table (aka bridge table)
>> Materialized path (path enumeration)
> 
> Adjacency list should be ruled out if we still want to support MySQL (no CTEs!)
> 
> I think any of the others will be fine. The data set will be so small I don't 
> think relative read or write speed should really matter. I would find one 
> that is familiar to whomever wants to champion/write it. FWIW, I prefer 
> nested set for smallish data sets.

Thanks for your advice. If we could avoid the complexity of a tree,
that would be good. Do you have a suggestion how to structure the
shipment conditions into a linear fashion in the database?

Regards
	Racke



-- 
Perl and Dancer Development

Visit our Perl::Dancer conference 2014:

http://act.perl.dance/

_______________________________________________
interchange-users mailing list
interchange-users@icdevgroup.org
http://www.icdevgroup.org/mailman/listinfo/interchange-users
[prev in list] [next in list] [prev in thread] [next in thread]