NickP Thanks a lot, I think that is what I was looking for! I will have to try it out as soon as I can.

The table has an incremented id. But there will be gaps in the numbers where entries have been deleted.

For example:

table id:
1
2
3
4
7
8
9
22
34
45

Now if I used the sql statement : SELECT TOP 10 * FROM tbl

That should return the records with those ids. Now if I did:
SELECT TOP 10 * FROM tbl WHERE [ID] > 45 '(the 45 would be a variable)
That would presumable return the next 10. The only problem with this is how to retrieve the ids where the separations would take place.

I want the user to be able to select any node and have the correct results displayed as quickly as possible.

Now if I knew that the ids had no gaps, I could simply find the first ID and last ID and do some math to determine which ids would be the break points.

Ideally, the user would select how the treeview is to sort the information, by firstname, lastname or title. once the selection is choosen the treeview would be prepared and the break IDs could be identified.

Thanks...