Essays about: "range queries"

Showing result 1 - 5 of 20 essays containing the words range queries.

  1. 1. Evaluating performance of homomorphic encryption applied on delta encoding

    University essay from Linköpings universitet/Databas och informationsteknik

    Author : János Richard Dani; [2022]
    Keywords : homomorphic encryption; delta encoding; performance test;

    Abstract : Homomorphic encryption is an encryption scheme that allows for simple operations on encrypted data. These operations are mainly boolean circuits combined into more complexarithmetic operations, rotations, and others. Homomorphic encryption was first implemented in 2009, and in the following decade, many different versions emerged. READ MORE

  2. 2. Flight search engine CPU consumption prediction

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Zhaopeng Tao; [2021]
    Keywords : Flight Search Engine; Deep Neural Networks; Tabular Data; Regression; Machine Learning; Flight Schedule Embedding; Node Embedding; Graph Embedding; Line Graph Embedding; Sökmotor för flygresor; Djupa neurala nätverk; Tabulära data; Regression; Maskininlärning; Inbäddning av flygschema; Inbäddning av noder; Inbäddning av grafer; Inbäddning av linjediagram;

    Abstract : The flight search engine is a technology used in the air travel industry. It allows the traveler to search and book for the best flight options, such as the combination of flights while keeping the best services, options, and price. The computation for a flight search query can be very intensive given its parameters and complexity. READ MORE

  3. 3. Parallel Minimum Cuts : An improved CREW PRAM algorithm

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Andrés López Martínez; [2020]
    Keywords : ;

    Abstract : This thesis considers the minimum cut problem in undirected, weighted graphs. We present a simple randomized CREW PRAM algorithm to find the minimum cut in a graph G with n nodes and m edges, based on Karger’s celebrated randomized near-linear time min-cut algorithm [STOC’96]. READ MORE

  4. 4. A comparison of different R-tree construction techniques for range queries on neuromorphological data

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Axel Elmarsson; Johan Grundberg; [2020]
    Keywords : ;

    Abstract : The brain is the most complex organ in the human body, and there are many reasons to study it. One way of studying the brain is through digital simulations. Such simulations typically require large amounts of data on the 3dimensional structure of individual neurons to be stored and processed efficiently. READ MORE

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

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

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

    Abstract : 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. READ MORE