Vertical Data Migration in Large Near-Line Document Archives Based on Markov-Chain Predictions
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Integrated document caching and prefetching in storage hierarchies based on Markov-chain predictions
The VLDB Journal — The International Journal on Very Large Data Bases
Unified Fine-Granularity Buffering of Index and Data: Approach and Implementation
ICCD '00 Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors
Opportunistic log: efficient installation reads in a reliable storage server
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
A correlation-aware prefetching strategy for object-based file system
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
| Hi-index | 0.00 |
Due to the nature of supported applications, object-oriented DBMSs need efficient mechanisms for the retrieval of complex objects and the navigation, along semantic links among objects. Object clustering is effective when the primary access pattern follows the primary relationship used for clustering, but not so effective when multiple relationships are involved [4]. Object buffering provides a possible solution to compensate the limitation of clustering schemes. This paper investigates the advantages of using an additional layer of object-based buffer pools on top of a traditional page-based buffer pool, and proposes a profile-based buffering scheme to optimize the efficiency of object buffer pools. The performance evaluation based on the semantic implementation of profiles was conducted. The results show that our scheme has better response time over existing schemes in most cases, even when the prefetching accuracy is as low as 50%