Time and Space Efficient Implementation of a Dynamic Index in a Main-Memory DBS

摘要

Exploitation of a very large main-memory as the prime storage for medium sized databases challenging problems regarding the software architecture of such a database management system. A central issue is how the database should be organized and what performance gains can be obtained from judicious use of the large memory and CPU power. The paper describes new algorithms and programming techniques which prove valuable in organizing access paths with minimal storage overhead and good performance characteristics.