ABSTRACT
A cracked database is a datastore continuously reorganized based on operations being executed. For each query, the data of interest is physically reclustered to speed-up future access to the same, overlapping or even disjoint data. This way, a cracking DBMS self-organizes and adapts itself to the workload.
So far, cracking has been considered for static databases only. In this paper, we introduce several novel algorithms for high-volume insertions, deletions and updates against a cracked database. We show that the nice performance properties of a cracked database can be maintained in a dynamic environment where updates interleave with queries. Our algorithms comply with the cracking philosophy, i.e., a table is informed on pending insertions and deletions, but only when the relevant data is needed for query processing just enough pending update actions are applied.
We discuss details of our implementation in the context of an open-source DBMS and we show through a detailed experimental evaluation that our algorithms always manage to keep the cost of querying a cracked datastore with pending updates lower than the non-cracked case.
References
- S. Agrawal et al. Database Tuning Advisor for Microsoft SQL Server 2005. In VLDB, 2004. Google Scholar
Digital Library
- M. A. Bender and H. Hu. An Adaptive Packed Memory Array. In SIGMOD, 2006. Google Scholar
Digital Library
- P. Boncz and M. Kersten. MIL Primitives For Querying a Fragmented World. The VLDB Journal, 8(2), Mar. 1999. Google Scholar
Digital Library
- S. Chaudhuri and G. Weikum. Rethinking Database System Architecture: Towards a Self-Tuning RISC-Style Database System. In VLDB, 2000. Google Scholar
Digital Library
- S. Idreos, M. Kersten, and S. Manegold. Database Cracking. In CIDR, 2007.Google Scholar
- M. Kersten and S. Manegold. Cracking the Database Store. In CIDR, 2005.Google Scholar
- P. Seshadri and A. N. Swami. Generalized partial indexes. In ICDE, 1995. Google Scholar
Digital Library
- D. G. Severance and G. M. Lohman. Differential files: their application to the maintenance of large databases. ACM Trans. Database Syst., 1(3):256--267, 1976. Google Scholar
Digital Library
- M. Stonebraker. The case for partial indexes. SIGMOD Rec., 18(4):4--11, 1989. Google Scholar
Digital Library
- M. Stonebraker et al. C-Store: A Column Oriented DBMS. In VLDB, 2005. Google Scholar
Digital Library
- A. S. Szalay et al. The SDSS SkyServer: Public Access to the Sloan Digital Sky Server Data. In SIGMOD, 2002. Google Scholar
Digital Library
- D. C. Zilio et al. DB2 Design Advisor: Integrated Automatic Physical Database Design. In VLDB, 2004. Google Scholar
Digital Library
- MonetDB. http://monetdb.cwi.nl/.Google Scholar
Index Terms
Updating a cracked database





Comments