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 4 of 4 for “"Persistent data structure"”.
-
Scaling quantum compilation with graph rewriting
… computations over both quantum and classical data. To this end, it introduces a graph-based intermediate representation (IR), with support for linear types to model quantum data. This unifies graphical formalisms used for reasoning over quantum computations (such as the ZX calculus) with …
-
Domain Specific Continuous Queries Implemented using Database Management Systems
… these are queries that deliver streams of data to clients as opposed to common queries which only respond with a single response. We define Domain Specific Continuous Queries as a query that, apart from an initial response with the matching set of records, streams all updates affecting the …
-
ADDING PERSISTENCE TO MAIN MEMORY PROGRAMMING
Unlocking the true potential of the new persistent memories (PMEMs) requires eliminating traditional persistent I/O abstractions altogether, by introducing persistent semantics directly into main memory programming. Such a programming model elevates failure atomicity to a first-class application …
-
Partial persistent sequences and their applications to collaborative text document editing and processing
… text documents by recording changes and the metadata of those changes (e.g., user names and modification timestamps). The recent Web 2.0 document editing and processing applications, such as real-time collaborative note taking and wikis, require fine-grained shared access to collaborative text …