Efficient Bulk Deletes in Relational Databases (2001)
Cached
Download Links
- [www.db.fmi.uni-passau.de:8000]
- [www-db.in.tum.de]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROC. IEEE CONF. ON DATA ENGINEERING |
| Citations: | 5 - 2 self |
BibTeX
@INPROCEEDINGS{Gärtner01efficientbulk,
author = {A. Gärtner and A. Kemper and D. Kossmann and B. Zeller},
title = {Efficient Bulk Deletes in Relational Databases},
booktitle = {IN PROC. IEEE CONF. ON DATA ENGINEERING},
year = {2001},
pages = {183--192},
publisher = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Many applications require that large amounts of data are deleted from the database -- typically, such bulk deletes are carried out periodically and involve old or out-of-date data. If the data is not partitioned in such a way that bulk deletes can be carried out by simply deleting whole partitions, then most current database products execute such bulk delete operations very poorly. The reason is that every record is deleted from each index individually. This paper proposes and evaluates a new class of techniques to support bulk delete operations more efficiently. These techniques outperform the "record-at-a-time" approach implemented in many database products by about one order of magnitude.
