Sökning: "“First Match Query”"

Hittade 5 uppsatser innehållade orden “First Match Query”.

  1. 1. Optimizing databases in the cloud based on performance and cost savings

    Master-uppsats, Lunds universitet/Institutionen för elektro- och informationsteknik

    Författare :Felix Nilsson; Daniel Mihajlovic; [2022]
    Nyckelord :Resource provisioning; Cloud service platform; Optimizing cost; Database; Performance; Metrics; Technology and Engineering;

    Sammanfattning : As cloud service providers becomes more prevalent, so does questions related to cost efficiency of hosted resources. Payment models for cloud hosted resources tend to be either subscription based or pay-as-you-go for computing resources, in this case for compound metrics of CPU, Data IO and Log IO. LÄS MER

  3. 2. Workload Detection and Continuous Automatic Bayesian Optimization in Database Management Systems

    Master-uppsats, Lunds universitet/Institutionen för datavetenskap

    Författare :Jonas Boström; Viktor Olsson; [2022]
    Nyckelord :Technology and Engineering;

    Sammanfattning : The goal of this thesis has been to investigate the possibility of multi-workload optimization in Database Management Systems and workload detection. A system was successfully constructed to allow for multi-workload testing and data aggregation. LÄS MER

  4. 3. Dynamic First Match : Reducing Resource Consumption of First Match Queries in MySQL NDB Cluster

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

    Författare :Hara Kumar; [2020]
    Nyckelord :“Query Optimization”; “Distributed Databases”; “First Match Query”; Frågaoptimering; ”distribuerad databas”; “första match frågor”;

    Sammanfattning : Dynamic First Match is a learned heuristic that reduces the resource consumption of first match queries in a multi-threaded, distributed relational database, while having a minimal effect on latency. Traditional first match range scans occur in parallel across all data fragments simultaneously. This could potentially return many redundant results. LÄS MER

  5. 4. Audio Moment Retrieval based on Natural Language Query

    Master-uppsats, Blekinge Tekniska Högskola/Institutionen för datavetenskap

    Författare :Danylo Shevchuk; [2020]
    Nyckelord :Deep Learning; Intervals Retrieval; Natural Language Query; Audio Classification;

    Sammanfattning : Background. Users spend a lot of time searching through media content to find the desirable fragment. Most of the time people can describe verbally what they are looking for but there is not much of a use for that as of today. LÄS MER

  7. 5. Offline Approximate String Matching forInformation Retrieval : An experiment on technical documentation

    Master-uppsats, JTH. Forskningsmiljö Informationsteknik

    Författare :Simon Dubois; [2013]
    Nyckelord :Algorithm comparison; Approximate string matching; Information retrieval; Offline string matching; Overlap coefficient; Phonetic indexation; String distance; String metric; String searching algorithm;

    Sammanfattning : Approximate string matching consists in identifying strings as similar even ifthere is a number of mismatch between them. This technique is one of thesolutions to reduce the exact matching strictness in data comparison. In manycases it is useful to identify stream variation (e.g. LÄS MER