	[x] Posted via EE Mobile
	Search, ask, and monitor your questions on the go with EE Mobile. Visit Experts Exchange from your mobile device and never be out of touch again.

Question

	[x] Attachment Details

[x]

The Solution Rating System

With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.

The Grade of the Solution
The Zone Rank of the Expert Providing the Solution
The Number of Author and Expert Comments
The Number of Experts Contributing
The Feedback of the Community

Your Input Matters
Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site.

If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support.

Thank you!

6.6

MySQL Nested Set / Pre-order tree query

Asked by killer455 in MySQL Server, Databases Miscellaneous

We are using nested sets / pre-order tree to store hierarchical data (categories).

Example:
http://dev.mysql.com/tech-resources/articles/hierarchical-data.html

We need a single query that will select the children of a specific category and also their children. --BUT-- be able to limit the number of second level children.

Example. We have a table which has:
id
title
left_
right_
level - stores the deepness level of the category (1, 2, 3, etc)

So say we want to find the children of a node which has ID of 12.

We get the left_ and right_ values where ID = 12.

We then select the children which have left_ and right_ in between the left_ and right_ values of ID 12 and only get categories which have 1 or 2 levels deeper (children and sub children).

I want to limit how many sub children get returned.

So that way we get a list of categories with X amount of sub children for each category.

View the Solution FREE for 30 Days

20091111-EE-VQP-92 - Hierarchy / EE_QW_3_20080625

Hall of Fame

1. ushastry639,035
2. cxr572,263
3. angelIII501,679
4. Ray_Pas...378,482
5. nemws1271,196
6. mwvisa1208,698
7. racek206,543
8. snoyes_jw190,899
9. theGhost...187,804
10. routinet102,775
11. NerdsOfT...95,575
12. flob994,037
13. rrjegan1791,280
14. gamebits80,935
15. Sharath_...78,989
16. wuff1uk76,652
17. Kdo74,151
18. yodercm73,608
19. hielo68,404
20. mahome64,543
21. DanielWilson63,080
22. k_murli_...62,206
23. leakim97158,339
24. logudotcom57,767
25. oobayly56,124

1. angelIII2,759,519
2. todd_far...1,724,617
3. ushastry1,241,109
4. snoyes_jw956,407
5. cxr732,381
6. Raynard7704,144
7. hernst42623,649
8. Squeebee555,077
9. hielo550,290
10. Ray_Pas...541,673
11. leannonn537,683
12. routinet495,977
13. yodercm391,475
14. NovaDeni...389,149
15. racek387,674
16. psadac355,445
17. virmaior353,139
18. fibo345,039
19. akshah123330,218
20. AdrianSRU321,878
21. mankowitz321,286
22. theGhost...272,127
23. nemws1271,196
24. mwvisa1266,434
25. gamebits259,971

MySQL Nested Set / Pre-order tree query

Asked by killer455 in MySQL Server, Databases Miscellaneous

About this solution