| Document Date: 2014-01-31 04:33:03
Open Document File Size: 940,44 KBShare Result on Facebook
City Thread / Amsterdam / / Company Closed Queuing Networks / IBM / Distributed Systems / Queueing Networks / Kraft / X5 / Closed Queueing Networks / Memory Database Systems / Intel / Microsoft / / / Facility Imperial College / Prentice Hall / / IndustryTerm analytical processing / disk-based database systems / interior point algorithm / analytical solution / analytical processing workloads / active processing / database systems / multi-core processors / analytical solutions / big data analysis systems / interior-point algorithm / decrease processing time / evolutionary algorithm / resource management / software-as-a-service applications / local optimization algorithms / database server / optimization algorithms / data processing / multi-tier applications / storage systems / data management / non-violating solution / inmemory systems / local and global search strategies / / OperatingSystem Fork / / Organization Imperial College London / Department of Computing / Real-Time Business Intelligence / Autonomic Service / / Person S. Das / V / Karsten Molka / J. Almeida / V / Hence / Thomas Molka / Laura Moore / / Position chair / query planner / / Product Pentax K-x Digital Camera / X5 4 / Sangean SR3 Radio / / ProgrammingLanguage MATLAB / SQL / / PublishedMedium Journal of the ACM / Natural Computing / / RadioStation Core / / Technology SOA / OLAP / evolutionary algorithm / Relational Database / interior point algorithm / machine learning / shared memory / interior-point algorithm / optimization algorithms / SDRAM / simulation / same algorithm / service level agreement / flash / Business Intelligence / local optimization algorithms / / URL http /
SocialTag |
Memory-Aware Sizing for In-Memory Databases Karsten Molka∗† , Giuliano Casale∗ , Thomas Molka† , Laura Moore† ∗ Department of Computing, Imperial College London, United Kingdom {k.molka13, g.casale}@imperial.