Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/3850
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Narayan A. | en_US |
dc.contributor.author | Marković, Vuk | en_US |
dc.contributor.author | Postawa N. | en_US |
dc.contributor.author | King A. | en_US |
dc.contributor.author | Morales A. | en_US |
dc.contributor.author | Kumar K. | en_US |
dc.contributor.author | Efstathopoulos P. | en_US |
dc.date.accessioned | 2019-09-23T10:30:28Z | - |
dc.date.available | 2019-09-23T10:30:28Z | - |
dc.date.issued | 2016-12-05 | - |
dc.identifier.isbn | 9781509034314 | en_US |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/3850 | - |
dc.description.abstract | © 2016 IEEE. In large scale-out data architectures, data are distributed and replicated across several machines. Queries/tasks to such data architectures, are sent to a router which determines the machines containing the requested data. Ideally, to reduce the overall cost of analytics, the smallest set of machines required to satisfy the query should be returned by the router. Mathematically, this can be modeled as the set cover problem, which is NP-hard. Given large number of incoming queries in real-time, it is often impractical to compute set cover for each incoming query to perform routing. In this paper, we propose a novel technique to speedup the routing of a large number of real-time queries while minimizing the number of machines that each query touches (query span). We demonstrate that by analyzing the correlation between known queries and performing query clustering, we can reduce the set cover computation time, thereby significantly speeding up routing of unknown queries. Experiments show that our incremental set cover-based routing is 2.5 times faster and can return on average 50% fewer machines per query when compared to repeated greedy set cover and baseline routing techniques. | en |
dc.relation.ispartof | Proceedings - 2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS 2016 | en |
dc.title | Efficient routing for cost effective scale-out data architectures | en_US |
dc.type | Conference Paper | en_US |
dc.identifier.doi | 10.1109/MASCOTS.2016.29 | - |
dc.identifier.scopus | 2-s2.0-85010465881 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/85010465881 | - |
dc.description.version | Unknown | en_US |
dc.relation.lastpage | 429 | en |
dc.relation.firstpage | 424 | en |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.author.dept | Medicinski fakultet, Katedra opšteobrazovnih predmeta | - |
crisitem.author.parentorg | Medicinski fakultet | - |
Appears in Collections: | MDF Publikacije/Publications |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.