title: Implementing a hierarchical data structure in a database
body: <p>I know there are two approaches: adjacency list and nested tree. It's said that adjacency list can become slow to use on traversal because of numerous queries. But I don't know any realistic figures for this. The site I'm making will have in the region of 200 pages. Is traversal to generate (for example) a sitemap going to take longer than about 0.3 seconds?</p>
  
  <p>Running on MySQL (innoDB) with LAMP stack.</p>
  
  <p>I'd prefer to implement adjacency if possible because of the more simplistic design.</p>
  
  <p>Thanks.</p>