Sökning: "B-Tree"

Hittade 5 uppsatser innehållade ordet B-Tree.

  1. 1. EDPM : An extension of EDPM - an embedded domain-specific language for performance monitoring C and C++ programs

    Uppsats för yrkesexamina på avancerad nivå, Blekinge Tekniska Högskola/Institutionen för datavetenskap

    Författare :David Bosnjak; [2023]
    Nyckelord :EDPM; Dynamic Nesting; PAPI; LLVM; Libtooling; EDPM; Dynamisk Nestning; PAPI; LLVM; Libtooling;

    Sammanfattning : Background. Performance monitoring of C/C++ programs has often been a tedious and straining process, where insufficient and complex tools/APIs are required. Performance monitoring tools and APIs tend to focus on ease of use or flexibility, but rarely both. LÄS MER

  3. 2. Antibiotic resistance in Staphylococcus aureus and Staphylococcus pseudintermedius isolated from milk, cattle and dogs in and around Kampala, Uganda

    Uppsats för yrkesexamina på avancerad nivå, SLU/Dept. of Clinical Sciences

    Författare :Lina Wachtmeister; [2018]
    Nyckelord :Antibiotic resistance; ; Uganda; Staphylococcus aureus; ; Staphylococcus pseudintermedius; ; MRSA; MRSP; Milk; Dog; Cattle;

    Sammanfattning : Utveckling av antibiotikaresistens är ett internationellt allvarligt problem inom både human- och veterinärvården. Meticillin-resistenta Staphylococcus aureus (MRSA) och Meticillinresistenta Staphylococcus pseudintermedius (MRSP) kan orsaka en mängd olika sjukdomar och har i vissa fall få behandlingsalternativ. LÄS MER

  4. 3. The Shortcut Index

    Uppsats för yrkesexamina på avancerad nivå, Lunds universitet/Institutionen för datavetenskap

    Författare :Anton Persson; [2016]
    Nyckelord :neo4j; ldbc; B tree; oltp; percent of neighborhood interest; range locality; neighborhood locality; graph database; labeled property graph; graph density; neighborhood density; path index; Technology and Engineering;

    Sammanfattning : With a novel path index design, called the Shortcut Index, we partially solve the problem of executing traversal queries on dense neighborhoods in a graph database. We implement our design on top of the graph database Neo4j but it could be used for any graph database that uses the labeled property graph model. LÄS MER

  5. 4. Efficient and Reliable Filesystem Snapshot Distribution

    Master-uppsats, KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Författare :Lauri Vosandi; [2015]
    Nyckelord :;

    Sammanfattning : Linux is an portable operating system kernel devised by Linus Torvalds and it can be used in conjunction with other userspace utilities such as GNU to build a free and open-source operating system for a multitude of target applications. While Linux-based operating systems have made significant progress on the servers and embedded systems, there is still much room for improvement for workstations and laptops. LÄS MER

  7. 5. Smart Clustering System for Filtering and Cleaning User Generated Content : Creating a profanity filter for Truecaller

    Kandidat-uppsats, KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Författare :Arvin Moradi; [2013]
    Nyckelord :Java; REST; Jersey; filter; linear function; MongoDB; Maven; String matching; algorithm; B-Tree; Hashmap; Aho-Corasick;

    Sammanfattning : This thesis focuses on investigating and creating an application for filtering user-generated content. The method was to examine how profanity and racist expressions are used and manipulated to evade filtering processes in similar systems. Focus also went on to study different algorithms to get this process to be quick and efficient, i.e. LÄS MER