Sökning: "Query By Example"

Visar resultat 1 - 5 av 26 uppsatser innehållade orden Query By Example.

  1. 1. Parallel Query Systems : Demand-Driven Incremental Compilers

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

    Författare :Christofer Nolander; [2023]
    Nyckelord :Query Systems; Parallelism; Incremental Computation; Compiler Architecture; Dependency Tracking; Query system; Parallelism; inkrementella beräkningar; kompilatorer; beroende spårning;

    Sammanfattning : Query systems were recently introduced as an architecture for constructing compilers, and have shown to enable fast and efficient incremental compilation, where results from previous builds is reused to accelerate future builds. With this architecture, a compiler is composed of several queries, each of which extracts a small piece of information about the source program. LÄS MER

  3. 2. Integration of GraphQL data sources into an RDF federation engine

    Master-uppsats, Linköpings universitet/Institutionen för datavetenskap

    Författare :Wiktor Karlsson; [2023]
    Nyckelord :RDF; SPARQL; GraphQL; JSON; query translator; queries; query; SPARQL to GraphQL translator;

    Sammanfattning : As data interoperability has become increasingly more important as of late, so has the topic of database query language translations. Being able to translate between different query languages, both old and new, could potentially improve a lot of different systems. LÄS MER

  4. 3. Scaling Apache Hudi by boosting query performance with RonDB as a Global Index : Adopting a LATS data store for indexing

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

    Författare :Ralfs Zangis; [2022]
    Nyckelord :Apache Hudi; Lakehouse; RonDB; Performance; Index; Key-value store; Apache Hudi; Lakehouse; RonDB; Prestanda; Index; Nyckel-värde butik;

    Sammanfattning : The storage and use of voluminous data are perplexing issues, the resolution of which has become more pressing with the exponential growth of information. Lakehouses are relatively new approaches that try to accomplish this while hiding the complexity from the user. LÄS MER

  5. 4. Active Learning for Solving Expensive Optimization Problems

    Master-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Siwei Fu; [2022]
    Nyckelord :;

    Sammanfattning : Many practical engineering and computer science problems can be translated into a global otimization problem where the task is to find the best (optimal) vector 𝒙𝒙∗ that gives the smallest possible function value 𝑓𝑓 = 𝑓𝑓(𝒙𝒙∗) for some function 𝑓𝑓() of interest. Often the function 𝑓𝑓() is expensive in the sense that it cannot be easily evaluated computationally or experimentally in terms of time and/or resources required. LÄS MER

  7. 5. Query By Example Keyword Spotting

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

    Författare :Jonas Sunde Valfridsson; [2021]
    Nyckelord :Keyword Spotting; Automatic Speech Recognition; ASR; Query By Example; Deep Distance Learning; Dynamic Time Warping; Few- Shot Learning; Nyckelords igenkänning; automatisk taligenkänning; fåförsöksinlärning;

    Sammanfattning : Voice user interfaces have been growing in popularity and with them an interest for open vocabulary keyword spotting. In this thesis we focus on one particular approach to open vocabulary keyword spotting, query by example keyword spotting. LÄS MER