Predicting cost amortization for query services

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2011, Pages 325-336

  Kantere, Verena ^a   Dash, Debabrata ^b   Gratsias, Georgios ^c   Ailamaki, Anastasia ^d  

^a CYPRUS UNIVERSITY OF TECHNOLOGY   (Cyprus)

^b HP Company   (Switzerland)

^c ELCA Informatique SA   (Switzerland)

^d EPFL   (Switzerland)

Author keywords

cloud data services; cost amortization; prediction models

Indexed keywords

COSTS; DATA ACQUISITION; DATABASE SYSTEMS; FORECASTING; STOCHASTIC SYSTEMS; TRAFFIC SURVEYS;

AMORTISATION; CLOUD DATA; CLOUD DATA SERVICE; COST AMORTIZATION; DATA COLLECTION; DATA SERVICES; ECONOMIC VIABILITY; ON-LINE SERVICE; PREDICTION MODELLING; QUERY SERVICE;

STOCHASTIC MODELS;

EID: 79960001828     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989323.1989358     Document Type: Conference Paper

References (37)

1. D. Agrawal, A. E. Abbadi, F. Emekci, and A. Metwally. Database management as a service: Challenges and opportunities. In ICDE '09, pages 1709-1716, 2009.
2. N. Bruno and R. V. Nehme. Configuration-parametric query optimization for physical design tuning. In SIGMOD, 2008.
3. B. Calder and D. Grunwald. Next cache line and set prediction. In ISCA, pages 287-296, 1995.
4. S. Chaudhuri and V. R. Narasayya. An efficient cost-driven index selection tool for Microsoft SQL server. In VLDB, 1997.
5. D. R. Cox and D. Oakes. Analysis of Survival Data. CRC Press, 1984.
6. D. Dash, V. Kantere, and A. Ailamaki. An economic model for self-tuned cloud caching. In ICDE, pages 1687-1693, 2009.
7. J. J. Faraway. Extending the linear model with R: generalized linear, mixed effects and nonparametric regression models. CRC Press, 2006.
8. D. G. Feitelson. Locality of sampling and diversity in parallel system workloads. In Intl. Conf. Supercomputing, 2007.
9. A. Ghosh, J. Parikh, V. S. Sengar, and J. R. Haritsa. Plan selection based on query clustering. In VLDB, 2002.
10. M. Gibas, G. Canahuate, and H. Ferhatosmanoglu. Online index recommendations for high-dimensional databases using query workloads. IEEE TKDE, 20(2):246-260, 2008.
11. H. Hacigumus, B. Iyer, and S. Mehrotra. Providing database as a service. In ICDE '02: Proceedings of the 18th International Conference on Data Engineering, page 29, Washington, DC, USA, 2002. IEEE Computer Society.
12. http://aws.amazon.com/ec2/.
13. http://code.google.com/appengine/.
14. http://msdn.microsoft.com/en us/library/ms189747.aspx.
15. http://www.microsoft.com/azure/.
16. http://www.salesforce.com/.
17. http://www.sdss.org/.
18. Z. Hu, S. Kaxiras, and M. Martonosi. Timekeeping in the memory system: predicting and optimizing memory behavior. SIGARCH Comput. Archit. News, 30(2):209-220, 2002.
19. I. F. Ilyas, V. Markl, P. Haas, P. Brown, and A. Aboulnaga. Cords: Automatic discovery of correlations and soft functional dependencies. In In SIGMOD, pages 647-658, 2004.
20. M. Kharbutli and Y. Solihin. Counter-based cache replacement and bypassing algorithms. IEEE Trans. Comput., 57(4):433-447, 2008.
21. H. Kimura, G. Huo, A. Rasin, S. Madden, and S. B. Zdonik. Correlation maps: A compressed access method for exploiting soft functional dependencies. In VLDB, 2009.
22. A.-C. Lai, C. Fide, and B. Falsafi. Dead-block prediction & dead-block correlating prefetchers. SIGARCH Comput. Archit. News, 29(2):144-154, 2001.
23. C. A. Lang and A. K. Singh. Modeling high-dimensional index structures using sampling. SIGMOD Rec., 30(2):389-400, 2001.
24. H. Li, D. Groep, and L. Wolters. Workload characteristics of a multi-cluster supercomputer. In Workshop on Job Scheduling Strategies for Parallel Processing, 2004.
25. H. Li, M. Muskulus, and L. Wolters. Modeling job arrivals in a data-intensive grid. In Workshop on Job Scheduling Strategies for Parallel Processing, 2006.
26. H. Li, M. Muskulus, and L. Wolters. Modeling correlated workloads by combining model based clustering and a localized sampling algorithm. In ICS, pages 64-72. ACM, 2007.
27. T. Malik, R. C. Burns, and A. Chaudhary. Bypass caching: Making scientific databases good network citizens. In ICDE, 2005.
28. T. Malik, X. Wang, R. Burns, D. Dash, and A. Ailamaki. Automated physical design in database caches. In SMDB, 2008.
29. T. N. Minh and L. Wolters. Modeling job arrival process with long range dependence and burstiness characteristics. In CCGRID, pages 324-330. IEEE, 2009.
30. T. N. Minh and L. Wolters. Modeling parallel system workloads with temporal locality. In Workshop on Job Scheduling Strategies for Parallel Processing, 2009.
31. M. A. Nieto-Santisteban, J. Gray, A. S. Szalay, J. Annis, A. R. Thakar, and W. J. OÕmullane. When database systems meet the grid. In CIDR, 2005.
32. S. Papadomanolakis, D. Dash, and A. Ailamaki. Efficient use of the query optimizer for automated database design. In VLDB, pages 1093-1104, 2007.
33. M. Stonebraker, P. M. Aoki, W. Litwin, A. Pfeffer, A. Sah, J. Sidell, C. Staelin, and A. Yu. Mariposa: A wide-area distributed database system. VLDB J., 5(1):48-63, 1996. (Pubitemid 126704129)
34. H. Taylor and S. Karlin. An Introduction to Stochastic Modeling. Academic Press, third edition, 1998.
35. A. Tewari and P. Bartlett. Optimistic linear programming gives logarithmic regret for irreducible mdps. In Advances in Neural Information Processing Systems 20.
36. P. Unterbrunner, G. Giannikis, G. Alonso, D. Fauser, and D. Kossmann. Predictable performance for unpredictable workloads. In VLDB, 2009.
37. X. Wang, T. Malik, R. C. Burns, S. Papadomanolakis, and A. Ailamaki. A workload-driven unit of cache replacement for mid-tier database caching. In DASFAA, pages 374-385, 2007.