The EXODUS extensible DBMS project: an overview
Readings in object-oriented database systems
B-trees with inserts and deletes: why free-at-empty is better than merge-at-half
PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Algorithms for flexible space management in transaction systems supporting fine-granularity locking
EDBT '94 Proceedings of the 4th international conference on extending database technology: Advances in database technology
Shoring up persistent applications
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Rdb (2nd ed.): a comprehensive guide
Rdb (2nd ed.): a comprehensive guide
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
SYBASE Architecture and Administration
SYBASE Architecture and Administration
Starburst Mid-Flight: As the Dust Clears
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the 2nd International Workshop on High Performance Transaction Systems
Vclusters: a flexible, fine-grained object clustering mechanism
Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
On clustering in database servers for supporting mobile clients
Cluster Computing
On the Analysis of On-Line Database Reorganization
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
Revised Papers from the NODe 2002 Web and Database-Related Workshops on Web, Web-Services, and Database Systems
Anatomy of a native XML base management system
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient bulk deletes for multi dimensional clustered tables in DB2
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A novel method to extend flash memory lifetime in flash-based DBMS
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
Analyzing and improving table space allocation
ADC '11 Proceedings of the Twenty-Second Australasian Database Conference - Volume 115
XLynx—An FPGA-based XML filter for hybrid XQuery processing
ACM Transactions on Database Systems (TODS) - Invited papers issue
| Hi-index | 0.00 |
An important problem faced by many database management systems is the "online object placement problem"--the problem of choosing a disk page to hold a newly allocated object. In the absence of clustering criteria, the goal is to maximize storage utilization. For main-memory based systems, simple heuristics exist that provide reasonable space utilization in the worst case and excellent utilization in typical cases. However, the storage management problem for databases includes significant additional challenges, such as minimizing I/O traffic, coping with crash recovery, and gracefully integrating space management with locking and logging.We survey several object placement algorithms, including techniques that can be found in commercial and research database systems. We then present a new object placement algorithm that we have designed for use in Shore, an object-oriented database system under development at the University of Wisconsin--Madison. Finally, we present results from a series of experiments involving actual Shore implementations of some of these algorithms. Our results show that while current object placement algorithms have serious performance deficiencies, including excessive CPU or main memory overhead, I/O traffic, or poor disk utilization, our new algorithm consistently excellent performance in all of these areas.