I have a USENET crawling script which is very efficient when it comes to crawling the server and storage. The only problem now is getting the results back to the user.
Currently, the way it's handled is recursive querying, whereby each thread will requery for the the next post in that level associated with that ID or their parentID matches the current postID.
As you can see, a query for just 10 threads can increase alot more if a certain thread contains like 20 replies.
So I'm wondering how would I get MySQL to query the database and sort it out so that the result set would be simply be just printing out the hiearchy.
If this is impossible, what's another way to decrease the amount of querying and load?
