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 13 of 13 for “"bloom filters"”.
-
Bloom Filters for Filesystem Forensics
… and memory capacity just exacerbate the problem. Bloom filters are space-efficient, probabilistic data structures that can represent data sets with quantifiable false positive rates that have the potential to alleviate the problem by reducing space requirements. We provide a framework using Bloom …
-
Improving the Performance of Parallel SPARQL Query Processing on Apache Spark Using Bloom Filters
… Motivated by these reasons, we propose a Bloom filter-based approach to improve the performance of parallel SPARQL query processing on Apache Spark. We construct a Bloom filter for each index based on different patterns over (subject, predicate, object) triples stored in that index. When a …
-
Representing shortest paths in graphs using Bloom filters without false positives and applications to routing in computer networks
A Bloom filter is data structure for representing sets in a compressed form, which has many applications. Bloom filters save time and space, but produce errors known as false positives. In this thesis, a new approach is suggested. Instead of choosing labels for edges in graphs at random (as is done …
-
Rethinking Update-in-Place Key-Value Stores for Modern Storage
… expensive compaction jobs and memory-consuming Bloom filters in order to achieve reasonably fast reads. In the era of NVMe SSDs, we argue that this trade-off between read performance and write performance is sub-optimal. With enough parallelism, modern storage media have comparable random and …
-
Enabling malware remediation in expanding home networks
… IP flows to devices through a series of scalable Bloom filters, allowing EDICT to operate under the significant memory constraints of home routers. When a customer is informed of compromise, EDICT will query this connection log using a fuzzy check of the timestamp and source port, both provided by …
-
Network Anomaly Detection with Incomplete Audit Data
… characteristics of the network traffic. A Bloom filters based fast flow aggregation scheme is employed at the data pre-processing stage to further reduce the response time of the anomaly detection scheme. Lastly, this dissertation also proposes an expectation-maximization algorithm based …
-
Leveraging distributional context for safe and interactive data science at scale
… for browsing, we develop workload-aware learned Bloom filters optimized for multidimensional data that allow analysts to quickly identify records that have been examined before, all while guarding against false negatives; (iv) for report generation, we develop context-aware aggregate …
-
Distributed associative memory
… dissertation modifies error-correcting codes and Bloom filters to create high-capacity associative memories. These associative memories use principled statistical inference and are distributed as no single component contains enough information to complete the task by itself, yet the components can …
-
Exploiting System Diversity in Peer-to-Peer Publish-Subscribe Systems
… utility of a peer (``friend'') is derived using Bloom filters and network coordinates. Bloom filters succinctly capture the subscription interest of a node, whereas network coordinates help capture the network location of a node. Via push-pull gossip, a node seeks to find a set of friends that …
-
Efficient processing of similarity queries with applications
… employs new spatial indexing techniques based on bloom filters to forward queries to the appropriate local sites. The proposed query processing and optimization techniques are prototyped inside Spark, a distributed main-memory computation system.</p>
-
Efficient data search and synchronization for tree-structured data on mobile devices
… on a special data structure we proposed, called Bloom Filter Tree. It is to compute a bloom filter for each interior node of the tree, essentially building a co-existing BF-tree to enhance the original data tree in order to allow more operations. Using the BF-tree, these two processes become …
-
A cryptographic approach to location privacy
… user's exact location. By leveraging the Spatial Bloom filter {data structure}, complemented by homomorphic encryption, the service provider can learn about the user's presence in predefined areas without revealing the user's exact location or these predefined areas to the user. The third part of …
-
XSiena: The Content-Based Publish/Subscribe System
Just as packet switched networks constituted a major breakthrough in our perception of the information exchange in computer networks so have the decoupling properties of publish/subscribe systems revolutionized the way we look at networking in the context of large scale distributed systems. The …