Essays about: "key-value store"

Showing result 1 - 5 of 20 essays containing the words key-value store.

  1. 1. Caching of key-value stores in the data plane

    University essay from Karlstads universitet/Institutionen för matematik och datavetenskap (from 2013)

    Author : Samuel Larsson; [2019]
    Keywords : key-value store; programmable data planes; cache; NetCache; DXRAM;

    Abstract : The performance of distributed key-value stores is usually dependent on its underlying network, and have potential to improve read/write latencies by improving upon the per- formance of the network communication. We explore the potential performance increase by designing an experimental in-network cache based on NetCache in the switch data plane for the distributed key-value store DXRAM, and placing it on a programmable switch that connects the peers in a DXRAM storage cluster. READ MORE

  2. 2. Service Metric Prediction in Clouds using Transfer Learning

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Nevine Gouda; [2019]
    Keywords : ;

    Abstract : Cloud service management for telecommunication operators is crucial and challengingespecially in a constantly changing operational execution environment. ThusPerformance models can be used to maintain service quality. READ MORE

  3. 3. Cauldron: A Scalable Domain Specific Database for Product Data

    University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Author : Love Ottosson; [2017]
    Keywords : distributed systems; nosql; big data; e-commerce; distributed systems; nosql; big data; e-commerce;

    Abstract : This project investigated how NoSQL databases can be used together with a logical layer, instead of a relational database with separated backend logic, to search for products with customer specific constraints in an e-commerce scenario. The motivation behind moving from a relational database was the scalability issues and increased read latencies experienced as the data increased. READ MORE

  4. 4. Snapple : A distributed, fault-tolerant, in-memory key-value store using Conflict-Free Replicated Data Types

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : Johan Stenberg; [2016]
    Keywords : Distributed Systems; CRDTs; Conflict-Free Replicated Data Types; OR-Set; Snapple;

    Abstract : As services grow and receive more traffic, data resilience through replication becomes increasingly important. Modern large-scale Internet services such as Facebook, Google and Twitter serve millions of users concurrently. Replication is a vital component of distributed systems. READ MORE

  5. 5. Geo-Replicated Buckets : An Optrimistic Geo-Replicated Shim for Key-Value Store

    University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Author : João Neto; [2015]
    Keywords : ;

    Abstract : This work introduces GeoD and VersionD. GeoD is a causally-consistent georeplication shim for key-value stores. GeoD enables the separation of concerns regarding replication and convergence from key-value stores, while preserving all of their read-only functionality. READ MORE