Din cate stiu eu un biblioraft contine numai dosare iar un dosar contine numai documente. Alceva nu. In aceste conditii ai 3 tabele :

1. Biblioraft(IdBiblioraft, DenBiblioraft, ...)
2. Dosar(IdDosar,  IdBiblioraft, ...)
3. Document(IdDocument, IdDosar,  IdBiblioraft, ...)

 Daca aceasta regula este incalcata atunci observatia lui Grig este mai mult decat intemeiata.

SELECT CONCAT( REPEAT(' ', COUNT(parent.name) - 1), node.name) AS name
FROM nested_category AS node,
nested_category AS parent
WHERE node.lft BETWEEN parent.lft AND parent.rgt
GROUP BY node.name
ORDER BY node.lft

Retrieving a Full Tree

The first common task when dealing with hierarchical data is the display of the entire tree, usually with some form of indentation. The most common way of doing this is in pure SQL is through the use of a self-join:

SELECT t1.name AS lev1, t2.name as lev2, t3.name as lev3, t4.name as lev4
FROM category AS t1
LEFT JOIN category AS t2 ON t2.parent = t1.category_id
LEFT JOIN category AS t3 ON t3.parent = t2.category_id
LEFT JOIN category AS t4 ON t4.parent = t3.category_id
WHERE t1.name = 'ELECTRONICS';

Nu te supara, am senzatia ca ti-e greu sa te uiti in articol si ma pui pe mine sa o fac. La Nested Category ai un capitol cu o gramada de selecturi care-ti descarca tot ce vrei:

Retrieving a Full Tree

SELECT node.name
FROM nested_category AS node,
nested_category AS parent
WHERE node.lft BETWEEN parent.lft AND parent.rgt
AND parent.name = 'ELECTRONICS'
ORDER BY node.lft;

Tie iti trebuie toate chestiile subordonate, deci renunti la "and parent.name=ceva". Si daca nu-ti convine, vezi ca ai un exemplu in care ti le si ordoneaza ca intr-un tree (folosind spatii inaintea denumirii). Chiar vrei sa iti arat eu linie cu linie ce trebuie sa faci? fusese vorba ca citesti CU ATENTIE articolul ala, nu?