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 1728 for “"data structures"”.
-
Succinct Data Structures
The world is drowning in data. The recent explosion of web publishing, XML data, bioinformation, scientific data, image data, geographical map data, and even email communications has put a strain on our ability to manage the information contained there. In general, the influx of massive data sets …
-
MULTITHREADED PARALLEL DATA STRUCTURES
… design and analysis of multithreaded parallel data structures that are both cost-scalable and composable. We introduce a high-level QRMW (queued read-modify-write) DMT (dynamic multithreading) model and a new easily-composable 'span'-type notion called delay. We then implement and prove …
-
Cache Oblivious Data Structures
This thesis discusses cache oblivious data structures. These are structures which have good caching characteristics without knowing Z, the size of the cache, or L, the length of a cache line. Since the structures do not require these details for good performance they are portable across caching …
-
Distributed stabilizing data structures
… task; Transient faults can affect an existing data structure and alter its data content. As a result, the data structure may lose its properties, and the operations defined over the data structure will have unpredictable and undesirable results, making the data structure unusable; We present …
-
Time Windowed Data Structures
We studytime windowed data structures, where atimestampedinput sequence can be preprocessed into a data structure based on a given predicateP, so that for a query time interval specified at the query time, it can answer queries based on the inputs whose timestamps lie in the query interval and …
-
Handling complex multilevel data structures
… two statistical models for dealing with data involving complex social structures. Appropriate handling of data structures is a concern in the context of educational settings. From base single-level data to complex hierarchical with cross-classifications and multiple-memberships, we …
-
Simple, Faster Kinetic Data Structures
… which are subject to change. We design a set of data structures and a mechanism to efficiently update the data structures. These updates occur at critical, discrete times. Also, a query may arrive at any time. We want to answer queries quickly without solving problems from scratch, so we maintain …
-
Practical Dynamic Transactional Data Structures
… time. Whether this lock is applied to an entire data structure, or only a single element, the pitfalls of lock-based programming persist. Deadlock, livelock, starvation, and priority inversion are some of the hazards of lock-based programming that can be avoided by using non-blocking techniques. …
-
Succinct Data Structures for Chordal Graphs
… graphs and give a n log n + o(n log n) bit data structure to answer the approximate distance query to within an additive constant of 1 in O(1) time. We study the problem of succinctly storing a static chordal graph to answer adjacency, degree, neighbourhood and shortest path queries. Let G …
-
SafeDS: Safe Data Structures for C++
… has yet been developed to efficiently secure all data in the program memory and mitigate such attacks. Nevertheless, solutions that only protect critical data in memory provide a balance between security and efficiency that could be practical in many applications. Accordingly, we introduce SafeDS, …
-
Data Structures for Points-To Analysis
In this dissertation, we present improvements to data structures, and the algorithms upon them, for points-to analysis. Our focus is mainly on flow-sensitive analysis but our techniques can either be applied to other analyses or used in analyses which combine flow-sensitivity with other …
-
Detectable Data Structures for Persistent Memory
… of secondary storage. It is possible for a data structure to recover near-instantly after a system failure by accessing recovery data directly in persistent memory through memory operations. A variety of researches have been working on building persistent data structures for persistent …
-
Data Structures of Nature: Fermionic Encodings
A compelling application of quantum computers with thousands of qubits is quantum simulation. Simulating fermionic systems is both a problem with clear real-world applications and a computationally challenging task. In order to simulate a system of fermions on a quantum computer, one has to first …
-
High-Performance Composable Transactional Data Structures
… change in the way we design and use fundamental data structures. Concurrent data structures allow scalable and thread-safe accesses to shared data. They provide operations that appear to take effect atomically when invoked individually. A main obstacle to the practical use of concurrent data …
-
Transforming Databases with Recursive Data Structures
… of performing structural transformations on databases involving complex data-structures and object-identities, and proposes an approach to specifying and implementing such transformations. We start by looking at various applications of such database transformations, and at some of the more …
-
A categorical model for data structures
… this thesis we consider the problem of modeling data structures. A model based on category theory is proposed in which both the static and dynamic characteristics of data structures can be represented. Data structures are modeled by categories and their dynamic characteristics by functors between …
Page 1 of 87