Space Partitioning Links
The basis of fast collision detection systems usually is one of the many space partitioning algorithms. Here is a list of some interesting techniques for the space partitioning storage. Note that actual collision detection is separate from these since you need to operate on these to find the collisions, they simply make the checking faster than O(n^2) where n is the number of objects.
BSP Trees (2 subdivisions)
http://www.andrew.cmu.edu/user/rrost/bsp/
Quadtrees (4 subdivisions)
http://www.cs.technion.ac.il/~cs234325/Homepage/Exercise-Slides/Gershon/ppt/OctTreeInCollision.ppt
Octrees (8 subdivisions)
http://www.cg.tuwien.ac.at/studentwork/VisFoSe98/eder/octree.htm
http://www.flipcode.com/cgi-bin/fcmsg.cgi?thread_show=11136
Various (OOBB, AABB)
http://www.flipcode.com/cgi-bin/fcmsg.cgi?thread_show=11057