Please start any new threads on our new
site at https://forums.sqlteam.com. We've got lots of great SQL Server
experts to answer whatever question you can come up with.
| Author |
Topic |
|
jmcbride
Starting Member
24 Posts |
 Posted - 2003-02-04 : 11:52:45
|
| I need a large and robust links management system that will serve to hierarchicaly categorize them according to which link contains sub links, in a tree fashion. I have been reviewing various methods for completing this, including Joe Celko's Nested Set Model, the method suggested by robvolk at http://www.sqlteam.com/item.asp?ItemID=8866, and the typical adjacency model.I find Joe Celko's method very confusing, and fearful that robvolk's will be very resource intensive (we average a million hits per month). The database will not be accessed each individual time (web pages will be cached), so I will not necessarily have a million calls to the data set. I need it to be very robust though.Any basic ideas? What if I used the adjacency model to create an xml file, then accessed the xml file?--------------------http://www.utsa.edu/(Joe) Joseph McBride |
|
|
Page47
Master Smack Fu Yak Hacker
2878 Posts |
Posted - 2003-02-04 : 12:57:13
|
| How much data are you trying to model? And what percentage of select vs. insert/update/delete activity? I take it, since you will be caching the pages, that it is mostly selects.I've worked with the nested set model with 1 million records ... its not great for inserts/update/delete, but very very quick for selects.I can be more specific if you need it.Jay White{0} |
 |
|
|
|
|
|
Working on tree, Alternate to Joe Celko