Data Structures Used

• Relations
• Dynamic and compressed vectors
• Dictionaries
• Indexing
  • Multi-column hashing
  • Rapid traversal of hash tables
• Persistence
  • The address space architecture
• Virtual Memory for persistent store
  • Segment fault handler
  • Backing store organisation
• The persistent heap
• A garbage collector
• Pointers to virtual method tables
• Self installation
• Loading
• Performance and conclusions