0

I'm working on a project that has alot of hierarchy relational data stored in the database.

I have an situation somewhat equal to the one discribed below. My main concern for this application is the database (MySQL) performance. I've have found a possible solution by using nested set and nested intervals. However I think that those might not do the job. My database has an equal (read/store) ratio and I have read that the solutions mentioned can only be efficient when the database is seldom changing.

Does anyone have experience with this kind of problem and what should I do next?

The image that explains the relations in uml

MichielDeRouter
  • 426
  • 4
  • 21
  • First you talk about hierarchy relational data but in next paragraph it seems that data is not stored in hierarchy way- Please, explain, this is a self referenced table? – dani herrera Nov 28 '12 at 08:35
  • Yes its is an self referenced table, sorry for being unclear. I added an Image for furder clarification. – MichielDeRouter Nov 28 '12 at 08:39
  • Refer this question once: http://stackoverflow.com/questions/11064913/achieve-hierarchy-in-a-less-number-of-mysql-queries this will help you – Sashi Kant Nov 28 '12 at 08:42
  • Take a look to: http://stackoverflow.com/questions/8961789/genealogy-tree-algorithm – dani herrera Nov 28 '12 at 08:49
  • I have read both the articles but it isn't what I am looking for. The methods that are presented are only efficient for a database that seldom changes. – MichielDeRouter Nov 28 '12 at 08:56

0 Answers0