diff --git a/doc/buckets.qbk b/doc/buckets.qbk
index 1303708f..ab68aebc 100644
--- a/doc/buckets.qbk
+++ b/doc/buckets.qbk
@@ -112,7 +112,7 @@ load factor is /required/ to be less than the maximum is following a call to
 below the max load factor, and set the maximum load factor to be the same as
 or close to the hint - unless your hint is unreasonably small or large.
 
-[table Methods for Controlling Bucket Size
+[table:bucket_size Methods for Controlling Bucket Size
     [[Method] [Description]]
 
     [
diff --git a/doc/comparison.qbk b/doc/comparison.qbk
index 3cea831e..0924fe5c 100644
--- a/doc/comparison.qbk
+++ b/doc/comparison.qbk
@@ -4,7 +4,7 @@
 
 [section:comparison Comparison with Associative Containers]
 
-[table Interface differences.
+[table:interface_differences Interface differences.
     [[Associative Containers] [Unordered Associative Containers]]
 
     [
@@ -88,7 +88,7 @@
     ]
 ]
 
-[table Complexity Guarantees
+[table:complexity_guarantees Complexity Guarantees
     [[Operation] [Associative Containers] [Unordered Associative Containers]]
     [
         [Construction of empty container]
diff --git a/doc/hash_equality.qbk b/doc/hash_equality.qbk
index db1b0616..823cf8cc 100644
--- a/doc/hash_equality.qbk
+++ b/doc/hash_equality.qbk
@@ -69,7 +69,7 @@ See the [link hash.custom Boost.Hash documentation] for more detail on how to
 do this.  Remember that it relies on extensions to the draft standard - so it
 won't work on other implementations of the unordered associative containers.
 
-[table Methods for accessing the hash and equality functions.
+[table:access_methods Methods for accessing the hash and equality functions.
     [[Method] [Description]]
 
     [
diff --git a/doc/unordered.qbk b/doc/unordered.qbk
index 431518ed..a12aaa62 100644
--- a/doc/unordered.qbk
+++ b/doc/unordered.qbk
@@ -3,7 +3,7 @@
  / file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) ]
 
 [library Boost.Unordered
-    [quickbook 1.4]
+    [quickbook 1.5]
     [authors [James, Daniel]]
     [copyright 2003 2004 Jeremy B. Maitin-Shepard]
     [copyright 2005 2006 2007 2008 Daniel James]