Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 128 for “"Hash Table"”.

  1. A read-only distributed hash table

    Distributed hash table (DHT) is an infrastructure to support resource discovery in large distributed system whereby data items are distributed across nodes in an overlay network based on a hash function. However, in commercial applications, data-item distributions may not be desirable due to the …

    nus Repository record for A read-only distributed hash table (opens in a new tab) Download file for A read-only distributed hash table (opens in a new tab)

  2. F2DR: A Distributed Hash Table Algorithm

    … has been directed toward the study of consistent hashing and distributed hash tables. While many useful research results have emerged from this work, existing solutions can be improved in the areas of time efficiency, system growth and change to input distributions. For resolution, systems such as …

    guelph Repository record for F2DR: A Distributed Hash Table Algorithm (opens in a new tab)

  3. Concurrent High-performance Persistent Hash Table In Java

    … This thesis presents a software-cache, called MapHash, that is a high-performance hash-table for use in Java.

    waterloo Repository record for Concurrent High-performance Persistent Hash Table In Java (opens in a new tab)

  4. Reduce Blockchain Nodes Storage Requirements by using Distributed Hash Table.

    Σκοπός της παρούσας διπλωματικής εργασίας είναι η μελέτη και η ανάλυση της επαναστατικής τεχνολογίας blockchain και η πρόταση μίας νέας προσέγγισης στην υλοποίησή της. Συγκεκριμένα, εξετάζεται η ιδέα της οργάνωσης των ομότιμων του blockchain σε DHT με σκοπό την αποθηκεύση των δεδομένων του …

    athens Repository record for Reduce Blockchain Nodes Storage Requirements by using Distributed Hash Table. (opens in a new tab)

  5. Scaled: Scalable Federated Learning via Distributed Hash Table Based Overlays

    … Scalable Federated Learning via Distributed Hash Table Based Overlays for network (Scaled) to conduct multiple concurrently running FL-based applications over edge networks. Specifically, Scaled adopts a fully decentral- ized multiple-master and multiple-slave architecture by exploiting …

    vt Repository record for Scaled: Scalable Federated Learning via Distributed Hash Table Based Overlays (opens in a new tab)

  6. DACHash: A Dynamic, Cache-Aware and Concurrent Hash Table on GPUs

    GPU acceleration of hash tables in high-volume transaction applications such as computational geometry and bio-informatics are emerging. Recently, several hash table designs have been proposed on GPUs, but our analysis shows that they still do not adequately factor in several important aspects of a …

    mississippi Repository record for DACHash: A Dynamic, Cache-Aware and Concurrent Hash Table on GPUs (opens in a new tab)

  7. Fundamental Design Issues in Anonymous Peer-to-peer Distributed Hash Table Protocols

    … is anonymous peer-to-peer (ANP2P) distributed hash table (DHT). These protocols are considered efficient, scalable, decentralized, and practical. However, the anonymity properties of these protocols are not well understood and difficult to quantify. As a result, users may have a false sense of …

    hawaii Repository record for Fundamental Design Issues in Anonymous Peer-to-peer Distributed Hash Table Protocols (opens in a new tab)

  8. Multi-dimensional range query evaluation for distributed hash table based peer-to-peer systems

    In this thesis, we investigate the issue of enabling current DHT-based P2P systems to support multi-dimensional range query towards the long term goal of providing complex query facilities in P2P systems. We adopt a multi-dimensional coordinate space model, which is sorted by Hilbert space filling …

    nus Repository record for Multi-dimensional range query evaluation for distributed hash table based peer-to-peer systems (opens in a new tab) Download file for Multi-dimensional range query evaluation for distributed hash table based peer-to-peer systems (opens in a new tab)

  9. Block-level storage in structured overlay networks: the design and implementation of a distributed hash table-based storage system

    … systems that approximate the ideal one. Notable innovations include hardware-based storage systems, distributed block-based storage systems, remote and distributed file systems. The storage systems deployed so far are tailored for specific storage environments. More specifically, …

    greece Repository record for Block-level storage in structured overlay networks: the design and implementation of a distributed hash table-based storage system (opens in a new tab)

  10. GraphDHT: Scaling Graph Neural Networks' Distributed Training on Edge Devices on a Peer-to-Peer Distributed Hash Table Network

    … devices interconnected through a Distributed Hash Table (DHT). As GNNs become increasingly vital in analyzing graph-structured data across various domains, they pose unique challenges in computational demands and privacy preservation, particularly when deployed for training on edge devices …

    vt Repository record for GraphDHT: Scaling Graph Neural Networks' Distributed Training on Edge Devices on a Peer-to-Peer Distributed Hash Table Network (opens in a new tab)

  11. Parallel gene upstream comparison via multi-level hash tables on GPU

    … the k-mers found in each gene in a multi-level hash table. The hash table design optimizes hash table comparison (rather than hash table insertion or lookup), is highly parallelizable and easily maps onto GPU. Four GPU kernels are proposed for pairwise hash table comparison, each leveraging a …

    missouri Repository record for Parallel gene upstream comparison via multi-level hash tables on GPU (opens in a new tab)

  12. Finding Approximate Repeats in DNA Sequences Using Multiple Spaced Seeds

    … repeats. We have designed a new space-efficient hash table for indexing sequences with multiple spaced seeds. The resulting seed-matches are then extended into longer approximate repeats using dynamic programming. Our results indicate that our hash table implementation requires less memory than …

    mcmaster Repository record for Finding Approximate Repeats in DNA Sequences Using Multiple Spaced Seeds (opens in a new tab)

  13. Perfect hashing and related problems

    … structure that supports these operations is a hash table. On a hash table, a basic operation takes 𝑂(1) time in the average case and 𝑂(𝑛) time in the worst case, where n is the number of words in the dictionary. While an ordinary hash function maps the words in a dictionary to a hash table with …

    vt Repository record for Perfect hashing and related problems (opens in a new tab)

  14. Online hashing for fast similarity search

    In this thesis, the problem of online adaptive hashing for fast similarity search is studied. Similarity search is a central problem in many computer vision applications. The ever-growing size of available data collections and the increasing usage of high-dimensional representations in describing …

    bu Repository record for Online hashing for fast similarity search (opens in a new tab)

  15. A Graph-Based Indexing Technique for Efficient Searching in Large Scale Textual Documents

    … GBI uses a directed graph built using a hash table to effectively capture the simultaneous occurrence of multiple keywords in a document. The objective is to use the relationship between the search keywords captured in the graph structure and a fast hash table lookup to effectively …

    carleton Repository record for A Graph-Based Indexing Technique for Efficient Searching in Large Scale Textual Documents (opens in a new tab)

  16. EA-PHT-HPR: Designing Scalable Data Structures for Persistent Memory

    … of persistent data structures, specifically for hash tables. The work presents an iterative process for the development of a persistent hash table. The proposed designs are based on a previously implemented DRAM design. We intend for the design of the hash table to remain similar to its original …

    waterloo Repository record for EA-PHT-HPR: Designing Scalable Data Structures for Persistent Memory (opens in a new tab)

  17. Data Structures for Fast Access Control in ECM Systems

    … it against the bitmap based representation and a hash table based representation while using random ID numbering and breadth-first numbering, respectively. Our experimental tests on both synthetic and real-world data show that the hash table outperforms our representation for regular permission …

    waterloo Repository record for Data Structures for Fast Access Control in ECM Systems (opens in a new tab)

  18. G-hash: Towards Fast Kernel-based Similarity Search in Large Graph Databases

    … graph data management. In our method we use a hash table to support efficient storage and fast search of the extracted local features from graph data. Using the hash table, we have developed a graph kernel function to capture the intrinsic similarity of graphs and for fast similarity query …

    ku Repository record for G-hash: Towards Fast Kernel-based Similarity Search in Large Graph Databases (opens in a new tab)

Page 1 of 7