Ítem
Solo Metadatos

Chisel: Reshaping Queries to Trim Latency in Key-Value Stores

dc.creatorBirke R.spa
dc.creatorPérez, Juan F.spa
dc.creatorMokhtar S.B.spa
dc.creatorRameshan N.spa
dc.creatorChen L.Y.spa
dc.date.accessioned2020-05-25T23:58:25Z
dc.date.available2020-05-25T23:58:25Z
dc.date.created2019spa
dc.description.abstractIt is challenging for key-value data stores to trim user (tail) latency of requests as the workloads are observed to have skewed number of key-value pairs and commonly retrieved via multiget operation, i.e., all keys at the same time. In this paper we present Chisel, a novel client side solution to efficiently reshape the query size at the data store by adaptively splitting big requests into chunks to reap the benefits of parallelism and merge small requests into a single query to amortize latency overheads per request. We derive a novel layered queueing model that can quickly and approximately steer the decisions of Chisel. We extensively evaluate Chisel on memcached clusters hosted on a testbed, across a large number of scenarios with different workloads and system configurations. Our evaluation results show that Chisel can overturn the inherent high variability of requests into a judicious operational region, showcasing significant gains for the mean and 95th percentile of user perceived latency, compared to the state-of-art query processing policy. © 2019 IEEE.eng
dc.format.mimetypeapplication/pdf
dc.identifier.doihttps://doi.org/10.1109/ICAC.2019.00016
dc.identifier.urihttps://repository.urosario.edu.co/handle/10336/22861
dc.language.isoengspa
dc.publisherInstitute of Electrical and Electronics Engineers Inc.spa
dc.relation.citationEndPage51
dc.relation.citationStartPage42
dc.relation.citationTitleProceedings - 2019 IEEE International Conference on Autonomic Computing
dc.relation.ispartofProceedings - 2019 IEEE International Conference on Autonomic Computing, ICAC 2019,(2019); pp. 42-51spa
dc.relation.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85073226529&doi=10.1109%2fICAC.2019.00016&partnerID=40&md5=e3748e33fa8f33a5118c9893494e5cc6spa
dc.rights.accesRightsinfo:eu-repo/semantics/openAccess
dc.rights.accesoAbierto (Texto Completo)spa
dc.source.instnameinstname:Universidad del Rosariospa
dc.source.reponamereponame:Repositorio Institucional EdocURspa
dc.subject.keywordQueueing theoryspa
dc.subject.keywordClient sidesspa
dc.subject.keywordEvaluation resultsspa
dc.subject.keywordKey-value pairsspa
dc.subject.keywordKey-value storesspa
dc.subject.keywordLatency modelspa
dc.subject.keywordOperational regionsspa
dc.subject.keywordQueueing modelspa
dc.subject.keywordSystem configurationsspa
dc.subject.keywordToolsspa
dc.subject.keywordKey value storesspa
dc.subject.keywordSplit merge latency modelspa
dc.titleChisel: Reshaping Queries to Trim Latency in Key-Value Storesspa
dc.typeconferenceObjecteng
dc.type.hasVersioninfo:eu-repo/semantics/publishedVersion
dc.type.spaDocumento de conferenciaspa
Archivos
Colecciones