{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:56:37Z","timestamp":1760597797584},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/tkde.2018.2817235","type":"journal-article","created":{"date-parts":[[2018,3,19]],"date-time":"2018-03-19T18:15:49Z","timestamp":1521483349000},"page":"1-1","source":"Crossref","is-referenced-by-count":5,"title":["SLA Definition for Multi-tenant DBMS and its Impact on Query Optimization"],"prefix":"10.1109","author":[{"given":"Shaoyi","family":"Yin","sequence":"first","affiliation":[]},{"given":"Abdelkader","family":"Hameurlain","sequence":"additional","affiliation":[]},{"given":"Franck","family":"Morvan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/119995.115813"},{"key":"ref11","first-page":"66","article-title":"Application of hash to database machine and its architecture","volume":"1","author":"kitsuregawa","year":"1983","journal-title":"New Genenation Comput"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989355"},{"key":"ref13","first-page":"702","article-title":"Towards multi-tenant performance SLOs","author":"lang","year":"2012","journal-title":"Proc IEEE 28th Int Conf Data Eng"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/62061.62063"},{"key":"ref15","first-page":"930","article-title":"Analysis of two existing and one new dynamic programming algorithm for the generation of optimal\n bushy join trees without cross products","author":"moerkotte","year":"0","journal-title":"Proc 32nd Int Conf Very Large Data Bases"},{"key":"ref16","article-title":"SQLVM: Performance isolation in multi-tenant relational\n database-as-a-service","author":"narasayya","year":"2013","journal-title":"Proc 7th Biennial Conf Innovative Data Syst Res"},{"key":"ref17","year":"2018"},{"key":"ref18","year":"2017"},{"key":"ref19","article-title":"Changing the face of database cloud services with personalized service level agreements","author":"ortiz","year":"0","journal-title":"Proc 7th Biennial Conf Innovative Data Syst Res"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2854006.2854012"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2750545"},{"key":"ref27","first-page":"1299","article-title":"Approximation schemes for many-objective query optimization","author":"trummer","year":"0","journal-title":"Proc ACM SIGMOD Int Conf"},{"key":"ref3","year":"2016"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/2732219.2732223"},{"key":"ref5","first-page":"99","article-title":"Data placement in bubba","author":"copeland","year":"0","journal-title":"Proc ACM SIGMOD Int Conf"},{"key":"ref8","first-page":"9","article-title":"Query optimization by simulated annealing","author":"ioannidis","year":"0","journal-title":"Proc ACM SIGMOD Int Conf"},{"key":"ref7","first-page":"9","article-title":"Query optimization for parallel execution","author":"ganguly","year":"0","journal-title":"Proc ACM SIGMOD Int Conf"},{"key":"ref2","year":"2018"},{"key":"ref9","first-page":"312","article-title":"Randomized algorithms for optimizing large join queries","author":"ioannidis","year":"0","journal-title":"Proc ACM SIGMOD Int Conf"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0389-y"},{"key":"ref20","first-page":"469","article-title":"Tradeoffs in processing complex join queries via hashing in multiprocessor database machines","author":"schneider","year":"0","journal-title":"Proc 16th Int Conf Very Large Data Bases"},{"key":"ref22","year":"2015"},{"key":"ref21","first-page":"23","article-title":"Access path selection in a relational database\n management system","author":"selinger","year":"0","journal-title":"Proc ACM SIGMOD Int Conf"},{"key":"ref24","first-page":"8","article-title":"Optimization of large join queries","author":"swami","year":"0","journal-title":"Proc ACM SIGMOD Int Conf"},{"key":"ref23","year":"2018"},{"key":"ref26","year":"2017"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/141356.141392"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/08319945.pdf?arnumber=8319945","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T09:16:02Z","timestamp":1643188562000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8319945\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2817235","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2018]]}}}