Sökning: "key value pair"

Visar resultat 1 - 5 av 11 uppsatser innehållade orden key value pair.

1. 1. Design and Implementation of an Architecture-aware In-memory Key- Value Store

   Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Författare :Omar Giordano; [2021]
   Nyckelord :Key-Value Store; Data Plane Development Kit; Last Level of Cache; Sliceaware memory management; Memcached; Haswell microrchitecture.; Key-Value Store; Data Plane Development Kit; Sista Nivån av Cache; Skivmedveten Minneshantering; Memcached; Haswell mikroarkitektur.;

   Sammanfattning : Key-Value Stores (KVSs) are a type of non-relational databases whose data is represented as a key-value pair and are often used to represent cache and session data storage. Among them, Memcached is one of the most popular ones, as it is widely used in various Internet services such as social networks and streaming platforms. LÄS MER

3. 2. Development of a Profile Sample Cutter

   Master-uppsats, KTH/Skolan för industriell teknik och management (ITM)

   Författare :Maryam Tarik Hamad; [2020]
   Nyckelord :Blade geometry; vertical constraint; paper properties; paper slitting; Knivbladsgeometri; vertikal begränsning; pappersegenskaper; pappersskärning;

   Sammanfattning : The pulp- and paper industry is a key industry globally and stands for a production of 600 million tonnes pulp and paper worldwide with a total revenue of 400 billion dollars. Due to high quality requirements on paper, it is important to use instruments that control that the produced paper fulfill the promised requirements. LÄS MER

4. 3. adXtractor – Automated and Adaptive Generation of Wrappers for Information Retrieval

   Master-uppsats, Malmö högskola/Fakulteten för teknik och samhälle (TS)

   Författare :Muhamet Ademi; [2017]
   Nyckelord :wrapper generation; information extraction; content of interest identification; wrapper rules; text extraction; key value pair; wrapper generate; main content identification; web scraping; information extraction algorithms; web extraction; dom tree analysis; dom analysis;

   Sammanfattning : The aim of this project is to investigate the feasibility of retrieving unstructured automotive listings from structured web pages on the Internet. The research has two major purposes: (1) to investigate whether it is feasible to pair information extraction algorithms and compute wrappers (2) demonstrate the results of pairing these techniques and evaluate the measurements. LÄS MER

5. 4. Geo-process lookup management

   Uppsats för yrkesexamina på avancerad nivå, Luleå tekniska universitet/Datavetenskap

   Författare :Andreas Hägglund; [2017]
   Nyckelord :DHT; Distributed hash table; Geohash; lookup; Geographical search;

   Sammanfattning : This thesis presents a method to deploy and lookup applications and devices based on a geographical location. The proposed solution is a combination of two existing technologies, where the first one is a geocode system to encode latitude and longitude coordinates, and the second one is a Distributed Hash Table (DHT) where values are stored and accessed with a $<$key,value$>$ pair. LÄS MER

7. 5. A Study of the Systemic Risk in the Japanese Banking System - An application of the CoVaR method

   Magister-uppsats, Lunds universitet/Nationalekonomiska institutionen

   Författare :Qian Wu; [2015]
   Nyckelord :Japanese Banking System; Japan; Systemic risk; CoVaR; Business and Economics;

   Sammanfattning : CoVaR is one of the pioneering systemic risk measures proposed during the financial turmoil of 2008, introduced by Adrian and Brunnermeier (2008). It is based on the familiar risk measurement Value-at-Risk (VaR). LÄS MER