Revisiting Reuse in Main Memory Database Systems

Preprint English OPEN
Dursun, Kayhan; Binnig, Carsten; Cetintemel, Ugur; Kraska, Tim;
  • Subject: Computer Science - Databases

Reusing intermediates in databases to speed-up analytical query processing has been studied in the past. Existing solutions typically require intermediate results of individual operators to be materialized into temporary tables to be considered for reuse in subsequent q... View more
  • References (29)
    29 references, page 1 of 3

    [1] C. Binnig et al. SQLScript: Efficiently Analyzing Big Enterprise Data in SAP HANA. In BTW, 2013.

    [2] N. Bruno et al. An online approach to physical design tuning. In ICDE, 2007.

    [3] G. Candea et al. A Scalable, Predictable Join Operator for Highly Concurrent Data Warehouses. PVLDB, 2009.

    [4] C. Chen et al. The Implementation and Performance Evaluation of the ADMS Query Optimizer: Integrating Query Result Caching and Matching. In EDBT, 1994.

    [5] A. Crotty et al. Tupleware: ”Big” Data, Big Analytics, Small Clusters. In CIDR, 2015.

    [6] S. Dar et al. Semantic Data Caching and Replacement. In VLDB, 1996.

    [7] D. DeHaan et al. Optimal top-down join enumeration. In ACM SIGMOD, 2007.

    [8] K. Gao et al. Simultaneous Pipelining in QPipe: Exploiting Work Sharing Opportunities Across Queries. In ICDE, 2006.

    [9] G. Giannikis et al. SharedDB: Killing One Thousand Queries with One Stone. PVLDB, 2012.

    [10] G. Giannikis et al. Shared Workload Optimization. PVLDB, 2014.

  • Metrics
Share - Bookmark