Principles of database buffer management
ACM Transactions on Database Systems (TODS)
Working with Persistent Objects: To Swizzle or Not to Swizzle
IEEE Transactions on Software Engineering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Making C++ objects persistent: the hidden pointers
Software—Practice & Experience
Storing and using objects in a relational database
IBM Systems Journal
Transactional client-server cache consistency: alternatives and performance
ACM Transactions on Database Systems (TODS)
The object data standard: ODMG 3.0
The object data standard: ODMG 3.0
The VLDB Journal — The International Journal on Very Large Data Bases - Persistent object systems
QuickStore: a high performance mapped object store
The VLDB Journal — The International Journal on Very Large Data Bases
A Trace-Based Simulation of Pointer Swizzling Techniques
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
An Adaptive Hybrid Server Architecture for Client Caching ODBMSs
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
A Study of Three Alternative Workstation-Server Architectures for Object Oriented Database Systems
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
A Performance Study of Alternative Object Faulting and Pointer Swizzling Strategies
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Swizzle Barrier Optimizations for Orthogonal Persistence in Java
Proceedings of the 8th International Workshop on Persistent Object Systems (POS8) and Proceedings of the 3rd International Workshop on Persistence and Java (PJW3): Advances in Persistent Object Systems
| Hi-index | 0.00 |
Pointer swizzling improves the performance of OODBMSs by reducing the number of table lookups. However, the object replacement incurs the unswizzling overhead. In this paper, we propose a new pointer swizzling strategy, the dynamic indirect pointer swizzling (DIPS). DIPS dynamically applies pointer swizzling techniques in order to reduce the overhead of unswizzling. DIPS uses the temporal locality information which is gathered by the object buffer manager. The information is used to select the object to whose pointers the pointer swizzling techniques are applied and to dynamically bind the pointer swizzling techniques using the virtual function mechanism. We show the efficiency of the proposed strategy through experiments over various object buffer sizes and workloads.