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 83 for “"Range queries"”.
-
Synchronised range queries
… presents a notion of logical time synchronised range queries to address the issue of data access. Accessing data efficiently in a latency-sensitive and large scale network overlay is a vital requirement for the scalability of the system. So, this thesis presents a notion of synchronised range …
-
Interactive Range Queries under Differential Privacy
… is associated with higher accuracy. Counting queries, which ”count” the number of items in a dataset that meet specific conditions, impose additional restrictions on privacy protection. In particular, if the resulting counts are low, the data released is more specific and can lead to privacy …
-
An Adaptive Algorithm for Range Queries in Differential Privacy
… a mechanism that answers a given workload of range queries efficiently under differential privacy. Therefore, an algorithm was implemented during this project to satisfy differential privacy by controlling the noise added to the answers according to the input data and the given workload. The …
-
Oblivious Multi-Way Band Joins: An Efficient Algorithm for Secure Range Queries
… Band joins, which match tuples over value ranges rather than exact keys, are widely used in temporal, spatial, and proximity-based analytics but present challenges in oblivious computation. Our approach employs a dual-entry technique that transforms range matching into cumulative sum …
-
Techniques for Accelerating Aggregated Range Queries on Large Multidimensional Datasets in Interactive Visual Exploration
… years, allowing users to express rich data queries that produce informative visual summaries, all in real-time. The fundamental insight of these techniques is that the performance of interactive visual data exploration systems can be improved by accelerating aggregated range queries. …
-
On the evaluation of exact-match and range queries over multidimensional data in distributed hash tables
… provides expressive retrieval support through range-based and exact-match queries and can be applied over massive quantities of multidimensional data. We provide benchmarks to illustrate the relative advantage of using our solution over a general-purpose cloud storage engine in a distributed …
-
Distributed skip list in fine-grain message passing interface : implementation and analysis of a dictionary data structure that supports range queries
… 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 list data structure provides …
-
Data transformation for improved query performance
… fast and efficient retrieval while executing queries. The typical queries that are run in a database can be classified into three broad categories. They are range queries, k-nearest neighbor (k-NN) queries and box queries. Implementation of a box query typically involves simple comparison of …
-
A Non-Intersecting R-Tree
… are popularly used by databases for a wide range of applications. Such index trees support point and range queries but are costly to construct over datasets of millions of points. We present the Non-Intersecting R-Tree (NIR-Tree), a novel insert-efficient, in-memory, multidimensional index …
-
Duomenų skaidymo efektyvumo palyginimas „PostgreSQL Citus” ir „Apache Cassandra” duomenų bazių valdymo sistemose /
… higher throughput (up to 19 times higher for range queries) and 2 to 4 times lower latency compared to PostgreSQL Citus, handled write operations more effectively (data loading was about 13 times faster), and maintained better availability during network topology changes. Conversely, while …
-
Improving Performance of Spatial Network Queries
Spatial network queries, for example KNN or range, operate on systems where objects are constrained to locations on a network. Current spatial network query algorithms rely on forms of network traversal which have a high complexity proportional to the size of the network making, them poor for large …
-
New Perspectives on Structured Encryption: Attacks, Constructions and Foundations
… on two subclasses of STE, namely encrypted range queries (numerically labelled data) and searchable encryption (text-based data).<br/><br/>We develop a multitude of novel attacks on encrypted range queries and searchable encryption with devastating consequences on user privacy. In …
-
Secure Geometric Search on Encrypted Spatial Data
… graph design, medical imaging, etc. Geometric queries, such as geometric range queries (i.e., finding points inside a geometric range) and nearest neighbor queries (i.e., finding the closest point to a given point), are fundamental primitives to analyze and retrieve information over spatial …
-
Secure and efficient searchable encryption
… technology. However, it does not support search queries on encrypted data and the server cannot process the outsourced data in their protected form. To counteract this problem, several cryptographic solutions have been proposed, like (Fully) Homomorphic Encryption (FHE), Multi-Party Computation …
-
Design and Implementation of Routing Algorithms for Supporting Multi-dimensional Range Query in HD Tree
… by Yunfeng Gu to support multi-dimensional range queries in a distributed environment. My thesis work is a follow-up to the research on the HD Tree. It focuses on the basic routing strategies in order to support multi-dimensional range queries in the HD Tree. There are two basic routing …
-
Προσαρμοστικοί αλγόριθμοι εξισορρόπησης φόρτου σε κατανεμημένα περιβάλλοντα: δίκτυα ομοτίμων και υπολογιστικά νέφη
… algorithm that balances load in distributed range partitioned data structures (i.e., structures that are able to answer range queries) is presented. The problem of uneven load distribution that occurs when peers serve objects of varying popularity is addressed. NIXMIG is implemented on top of …
-
Reliacinių duomenų bazių saugumo modelio tyrimas /
… databases, proposed model, which allows range queries and aggregation functions over encrypted data without decrypting them at RDBMS level, and determined advantages and disadvantages of it. The program which realizes proposed model is given as proof of concept.
-
Symmetric schemes for efficient range and error-tolerant search on encrypted data
… schemes supporting two types of search queries, range queries and error-tolerant queries. The natural solution to accommodate efficient range queries on ciphertexts is to use order-preserving encryption (OPE). I propose a security definition for OPE schemes, construct the first OPE …
-
Search And Delivery Techniques In Peer-to-peer Networks
… the problem of supporting continuous moving range queries in wireless mobile peer-to-peer networks is studied. Continuous moving range queries have a number of applications when a moving object wants to monitor its surrounding environment for a period of time. When a fixed network …
-
Data Distribution Management In Large-scale Distributed Environments
… the more commonly known associative searching or queries. DDM in the cluster-based network environment is one of the important services provided by the simulation middle-ware to support real-time distributed interactive simulations. The only common feature shared by DDM in both environments is …
Page 1 of 5