Maybe I am just being dense this morning but I am confused why you think
that your nodes are different things depending on how many children they
have (nodes, groups, entities, ahhh!)...
If you have two sets of hierarchies that share the same nodes, you may
want to build two trees
Heh, I don't think you're being dense. I can barely understand what I
meant. I'll try to clarify I bit more.
What I have is a sequence of entities (for this example the entities
will be letters). I'm trying to use MySQL to hold the possible
combinations of entities.
The unique entities in a
Your system sounds more like BNF (Backus-Naur Form) expression evaluator
than a regular expression evaluator. Both are similar in that you can
specify sequences of things (letters or words or symbols) to appear in
certain orders and in certain quantities. Once a BNF or regex expression
is
Ok thanks a bunch, I'll take this information and see what I can come up
with.
Chris
[EMAIL PROTECTED] wrote:
Your system sounds more like BNF (Backus-Naur Form) expression evaluator
than a regular expression evaluator. Both are similar in that you can
specify sequences of things (letters or
Hi all,
I'm designing a small database, it's essentially a tree-structure. I'm
probably going to use a Modified Preorder Tree Traversal (On a side
note, how is it different than an Unmodified Preorder Tree Traversal?).
Each node will have children etc, and those will have children, etc.
But
