Refresco: Improving Query Performance Through Freshness Control in a Database Cluster

  • Cécile Le Pape
  • Stéphane Gançarski
  • Patrick Valduriez
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3290)


We consider the use of a cluster system for managing autonomous databases. In order to improve the performance of read-only queries, we strive to exploit user requirements on replica freshness. Assuming mono-master lazy replication, we propose a freshness model to help specifying the required freshness level for queries. We propose an algorithm to optimize the routing of queries on slave nodes based on the freshness requirements. Our approach uses non intrusive techniques that preserve application and database autonomy. We provide an experimental validation based on our prototype Refresco. The results show that freshness control can help increase query throughput significantly. They also show significant improvement when freshness requirements are specified at the relation level rather than at the database level.


Master Node Slave Node Query Response Time Application Service Provider Freshness Control 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alonso, R., Barbará, D., Garcia-Molina, H.: Data caching issues in an information retrieval system. ACM TODS 15(3), 359–384 (1990)CrossRefGoogle Scholar
  2. 2.
    Barbará, D., Garcia-Molina, H.: The demarcation protocol: A technique for maintaining constraints in distributed database systems. VLDB Journal 3(3), 325–353 (1994)CrossRefGoogle Scholar
  3. 3.
    Gallersdörfer, R., Nicola, M.: Improving performance in replicated databases through relaxed coherency. In: Int. Conf. on VLDB (1995)Google Scholar
  4. 4.
    Gançarski, S., Naacke, H., Pacitti, E., Valduriez, P.: Parallel processing with autonomous databases in a cluster system. In: Int. Conf. On Cooperative Information Systems, CoopIS (2002)Google Scholar
  5. 5.
    Grabs, T., Böhm, K., Schek, H.-J.: Scalable distributed query and update service implementations for XML document elements. In: Workshop on Research Issues in Data Engineering (2001)Google Scholar
  6. 6.
    Labrinidis, A., Roussopoulos, N.: Balancing performance and data freshness in web database servers. In: Int. Conf. on VLDB (2003)Google Scholar
  7. 7.
    Olston, C., Widom, J.: Offering a precision-performance tradeoff for aggregation queries over replicated data. In: Int. Conf. on VLDB (2000)Google Scholar
  8. 8.
    Röhm, U., Böhm, K., Schek, H.-J.: Cache-aware query routing in a cluster of databases. In: Int. Conf. On Data Engineering, ICDE (2001)Google Scholar
  9. 9.
    Röhm, U., Böhm, K., Schek, H.-J., Schuldt, H.: Fas - a freshness-sensitive coordination middleware for a cluster of olap components. In: Int. Conf. on VLDB (2002)Google Scholar
  10. 10.
    Transaction Processing Performance Council. Tpc-r : a business reporting, decision support benchmark,
  11. 11.
    Wu, K.-L., Yu, P.S., Pu, C.: Divergence control for epsilon-serializability. In: Int. Conf. On Data Engineering, ICDE (1992)Google Scholar
  12. 12.
    Yu, H., Vahdat, A.: Design and evaluation of a conit-based continuous consistency model for replicated services. ACM TOCS 20(3), 239–282 (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Cécile Le Pape
    • 1
  • Stéphane Gançarski
    • 1
  • Patrick Valduriez
    • 2
  1. 1.Laboratoire d’Informatique de Paris 6ParisFrance
  2. 2.INRIA and LINANantesFrance

Personalised recommendations