10.1145/1247480.1247527acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
Article

Updating a cracked database

Online:11 June 2007Publication History

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

  1. S. Agrawal et al. Database Tuning Advisor for Microsoft SQL Server 2005. In VLDB, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. A. Bender and H. Hu. An Adaptive Packed Memory Array. In SIGMOD, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. P. Boncz and M. Kersten. MIL Primitives For Querying a Fragmented World. The VLDB Journal, 8(2), Mar. 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. Chaudhuri and G. Weikum. Rethinking Database System Architecture: Towards a Self-Tuning RISC-Style Database System. In VLDB, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. S. Idreos, M. Kersten, and S. Manegold. Database Cracking. In CIDR, 2007.Google ScholarGoogle Scholar
  6. M. Kersten and S. Manegold. Cracking the Database Store. In CIDR, 2005.Google ScholarGoogle Scholar
  7. P. Seshadri and A. N. Swami. Generalized partial indexes. In ICDE, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Stonebraker. The case for partial indexes. SIGMOD Rec., 18(4):4--11, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. M. Stonebraker et al. C-Store: A Column Oriented DBMS. In VLDB, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. S. Szalay et al. The SDSS SkyServer: Public Access to the Sloan Digital Sky Server Data. In SIGMOD, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. D. C. Zilio et al. DB2 Design Advisor: Integrated Automatic Physical Database Design. In VLDB, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. MonetDB. http://monetdb.cwi.nl/.Google ScholarGoogle Scholar

Index Terms

  1. Updating a cracked database

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        ACM Conferences cover image
        SIGMOD '07: Proceedings of the 2007 ACM SIGMOD international conference on Management of data
        June 2007
        1210 pages
        ISBN:9781595936868
        DOI:10.1145/1247480
        • General Chairs:
        • Lizhu Zhou,
        • Tok Wang Ling,
        • Program Chair:
        • Beng Chin Ooi

        Copyright © 2007 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Online: 11 June 2007

        Permissions

        Request permissions about this article.

        Request Permissions

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate 678 of 3,582 submissions, 19%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!