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 7 of 7 for “"skip lists"”.

  1. Using skip lists in the implementation of a hypertext tool for maintenance programmers

    This thesis presents a hypertext browser tool mainly for maintenance phase of software development. As the maintenance phase is the most costly and time-consuming phase in the whole process of software development and system evolution, our tool is aimed at providing support to maintenance …

    concordia Download PDF for Using skip lists in the implementation of a hypertext tool for maintenance programmers (opens in a new tab)

  2. The Benefits and Limitations of Rust for Implementing Concurrent Data Structures - Comparing Concurrent Skip Lists in Rust to C

    … compares to languages like C. In particular, skip lists will be investigated since they are important for many concurrent systems and make use of many intricate concurrent programming techniques. We implemented several state-of-the-art skip lists in Rust, and created a comprehensive …

    chalmers Repository record for The Benefits and Limitations of Rust for Implementing Concurrent Data Structures - Comparing Concurrent Skip Lists in Rust to C (opens in a new tab)

  3. HNSW grafų algoritmas apytikslio artimiausio kaimyno paieškai /

    … of parallels between the HNSW algorithm and skip-lists in one-dimensional data. The structural similarities between these two data structures were analyzed, focusing on their common characteristics and case, when HNSW corresponds to the skp-list structure. Furthermore, the thesis delved into …

    vilnius Repository record for HNSW grafų algoritmas apytikslio artimiausio kaimyno paieškai / (opens in a new tab)

  4. Concurrent Non-blocking Skip List Using Multi-word Compare and Swap Operation

    … a non-blocking lock-free implementation of skip list data structure using multi word compare and swap (CASN) operation. This operation is designed to work on arbitrary number of memory locations as a single atomic step. We discuss the implementation details of CASN operation which only …

    unlv Repository record for Concurrent Non-blocking Skip List Using Multi-word Compare and Swap Operation (opens in a new tab) Download PDF for Concurrent Non-blocking Skip List Using Multi-word Compare and Swap Operation (opens in a new tab)

  5. PebblesDB : building key-value stores using fragmented log-structured merge trees

    … a novel data structure that is inspired by Skip Lists, termed Fragmented Log- Structured Merge Trees (FLSM). FLSM introduces the notion of guards to organize logs (sstables or files containing the data on storage), and avoids rewriting data in the same level. Theoretically, we show how FLSM …

    texas Repository record for PebblesDB : building key-value stores using fragmented log-structured merge trees (opens in a new tab)

  6. A Scalable Recoverable Skip List for Persistent Memory on NUMA Machines

    … which need high availability and reliability. Skip lists are a data structure particularly well-suited for usage as a fully PMEM-resident index, due to their reduced amount of writes from their probabilistic balancing in comparison to other index data structures like B-trees. The Untitled …

    waterloo Repository record for A Scalable Recoverable Skip List for Persistent Memory on NUMA Machines (opens in a new tab)

  7. Efficient scientific data discovery over self-describing file formats

    … hash tables, self-balancing search trees, skip lists, sparse array, etc. Efficient selection of an indexing data structure is challenging in the context of scientific data management, due to the lack of investigation of metadata, metadata queries, and indexing methodologies. Secondly, it is …

    ttu Repository record for Efficient scientific data discovery over self-describing file formats (opens in a new tab)