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 12 of 12 for “"Distributed data structure"”.

  1. RootChord

    We present a distributed data structure, which we call "RootChord". To our knowledge, this is the first distributed hash table which is able to adapt to changes in the size of the network and answer lookup queries within a guaranteed two hops while maintaining a routing table of size …

    waterloo Repository record for RootChord (opens in a new tab)

  2. Data Distribution Management In Large-scale Distributed Environments

    Data Distribution Management (DDM) deals with two basic problems: how to distribute data generated at the application layer among underlying nodes in a distributed system and how to retrieve data back whenever it is necessary. This thesis explores DDM in two different network environments: …

    ottawa-retro Repository record for Data Distribution Management In Large-scale Distributed Environments (opens in a new tab)

  3. Distributed true string B-tree peer-to-peer overlay networks

    … the physical (IP) node that stores a particular data item. To tackle this application-level routing problem, this thesis proposes a new P2P overlay network, called Distributed True String B-tree (DTSBT) P2P overlay network. Unlike popular Distributed Hash Table (DHT)-based P2P overlay networks …

    ottawa-retro Repository record for Distributed true string B-tree peer-to-peer overlay networks (opens in a new tab)

  4. Distributed skip list in fine-grain message passing interface : implementation and analysis of a dictionary data structure that supports range queries

    … mind, we have implemented a pure message-passing distributed data structure ideal for range queries. The structure is a distributed skip list that takes full advantage of Fine-Grain MPI to execute on a variety of scales ranging from a single multicore to multiple machines across clusters. The skip …

    ubc Repository record for Distributed skip list in fine-grain message passing interface : implementation and analysis of a dictionary data structure that supports range queries (opens in a new tab) Download PDF for Distributed skip list in fine-grain message passing interface : implementation and analysis of a dictionary data structure that supports range queries (opens in a new tab)

  5. A scalable video streaming approach using distributed b-tree

    … approach, in this thesis we pro- pose to use distributed data structure as the underlying storage for streaming video. We developed a distributed B-tree, and stored video files in the B- tree which runs over a cluster of computers and served from there. We show that system throughput increases …

    ubc Repository record for A scalable video streaming approach using distributed b-tree (opens in a new tab) Download PDF for A scalable video streaming approach using distributed b-tree (opens in a new tab)

  6. Studying the Properties of a Distributed Decentralized b+ Tree with Weak-Consistency

    Distributed computing is very popular in the field of computer science and is widely used in web applications. In such systems, tasks and resources are partitioned among several computers so that the workload can be shared among the different computers in the network, in contrast to systems using a …

    ottawa-retro Repository record for Studying the Properties of a Distributed Decentralized b+ Tree with Weak-Consistency (opens in a new tab)

  7. System support for keyword-based search in structured Peer-to-Peer systems

    … we present protocols for building a distributed search infrastructure over structured Peer-to-Peer systems. Unlike existing search engines which consist of large server farms managed by a centralized authority, our approach makes use of a distributed set of end-hosts built out of …

    maryland Repository record for System support for keyword-based search in structured Peer-to-Peer systems (opens in a new tab)

  8. A Scalable P2P RIA Crawling System with Fault Tolerance

    … therefore the long time required for crawling, distributed RIA crawling has been introduced with the aim to decrease the crawling time. However, the current RIA crawling systems are not scalable, i.e. they are limited to a relatively low number of crawlers. Furthermore, they do not allow for …

    ottawa-retro Repository record for A Scalable P2P RIA Crawling System with Fault Tolerance (opens in a new tab)

  9. Temporal streams: programming abstractions for distributed live stream analysis applications

    … response, disaster recovery, and critical infrastructure monitoring are all examples of such applications. These applications are distributed and typically require significant computing resources (like a cluster of workstations) for analysis. In addition to live data, many such applications also …

    gatech Repository record for Temporal streams: programming abstractions for distributed live stream analysis applications (opens in a new tab)

  10. Διαχείριση δεδομένων σε κατανεμημένα συστήματα μεγάλης κλίμακας για χρήση σε εφαρμογές αναλυτικής επεξεργασίας

    The increasing size of the data collected and generated by industrial and academic information systems has created new sets of demands from data management platforms. Besides the well-documented need for offline analytics, the requirement to immediately detect interesting trends is ever-growing, …

    greece Repository record for Διαχείριση δεδομένων σε κατανεμημένα συστήματα μεγάλης κλίμακας για χρήση σε εφαρμογές αναλυτικής επεξεργασίας (opens in a new tab)