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 40 for “"range query"”.

  1. Efficient algorithms for answering geo-range query

    … To answer this question we present a new type of query, Geo-Range query. This query reports the geographic points where the average value of nearby sensors are greater than certain threshold. To perform this query, we developed two fast, efficient algorithms. The Brute-Force algorithm use …

    uvic Repository record for Efficient algorithms for answering geo-range query (opens in a new tab)

  2. Adaptive Range Counting and Other Frequency-Based Range Query Problems

    We consider variations of range searching in which, given a query range, our goal is to compute some function based on frequencies of points that lie in the range. The most basic such computation involves counting the number of points in a query range. Data structures that compute this function …

    waterloo Repository record for Adaptive Range Counting and Other Frequency-Based Range Query Problems (opens in a new tab)

  3. Algorithms for multi-point range query and reverse nearest neighbour search

    … research work focuses on a type of proximity query called the multi-point range query (MPRQ). We showed that MPRQ is a natural extension to standard range queries and can be deployed in a wide range of applications, from real-life traveller information systems to computational biology …

    nus Repository record for Algorithms for multi-point range query and reverse nearest neighbour search (opens in a new tab) Download file for Algorithms for multi-point range query and reverse nearest neighbour search (opens in a new tab)

  4. Somewhat homomorphic encryption scheme for secure range query process in a cloud environment

    … leakage. This thesis proposes a secure range query process which is based on a somewhat homomorphic encryption scheme to improve secure database functionalities. There is no sensitive information leakage in the secure range query process. The data that are stored in the cloud database …

    laurentian Repository record for Somewhat homomorphic encryption scheme for secure range query process in a cloud environment (opens in a new tab)

  5. Multi-dimensional range query evaluation for distributed hash table based peer-to-peer systems

    … P2P systems to support multi-dimensional range query towards the long term goal of providing complex query facilities in P2P systems. We adopt a multi-dimensional coordinate space model, which is sorted by Hilbert space filling curve. Sorting makes the range query processing in multiple …

    nus Repository record for Multi-dimensional range query evaluation for distributed hash table based peer-to-peer systems (opens in a new tab) Download file for Multi-dimensional range query evaluation for distributed hash table based peer-to-peer systems (opens in a new tab)

  6. 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 …

    ottawa-retro Repository record for Design and Implementation of Routing Algorithms for Supporting Multi-dimensional Range Query in HD Tree (opens in a new tab)

  7. Fast database join on ray-tracing core equipped GPU

    … RTX suffers from a large build size and slow range queries. A follow-up work called cgRX(Coarse-granular Indexing), optimized the construction and range query algorithms, improving throughput by 1.5x–3x in relation to memory footprint, the range query time by 2x, and 5.5x faster updatability …

    uvic Repository record for Fast database join on ray-tracing core equipped GPU (opens in a new tab)

  8. Efficient Range and Join Query Processing in Massively Distributed Peer-to-Peer Networks

    … massively large-scale data management and query processing. Complex query operators such as range operator and join operator are needed by various distributed applications, including content distribution, locality-aware services, computing resource sharing, and many others. This …

    waterloo Repository record for Efficient Range and Join Query Processing in Massively Distributed Peer-to-Peer Networks (opens in a new tab)

  9. Secure and efficient query processing in outsourced databases

    … ensure data privacy while allowing for efficient querying. This thesis proposes a definition and components of a new secure and efficient outsourced database system, which answers various types of queries, with different privacy guarantees in different security models. This work starts with the …

    bu Repository record for Secure and efficient query processing in outsourced databases (opens in a new tab)

  10. Predictive In-memory Multi-Level Indexing Algorithm for Spatiotemporal Trajectory Streams in Distributed Environments

    … types of search queries on spatial data, such as range query and join query. Despite the importance of these types of queries on streaming data, many systems do not support them. Many also fail to handle the scalability and efficiency problems when the input data is too large. This thesis proposes …

    umn Repository record for Predictive In-memory Multi-Level Indexing Algorithm for Spatiotemporal Trajectory Streams in Distributed Environments (opens in a new tab)

  11. Efficient Algorithms for RDV graphs

    … about the neighborhood of $v$ into a type of range query amid a set of horizontal and vertical line segments. Our algorithms run in $O(n \log{n})$ time, presuming a $O(n)$-sized intersection representation of the graph is given. In addition, our techniques can also be used to obtain faster …

    waterloo Repository record for Efficient Algorithms for RDV graphs (opens in a new tab)

  12. Data transformation for improved query performance

    … 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 values in each dimension of the query feature vector with the corresponding dimension of an object in the …

    msu Repository record for Data transformation for improved query performance (opens in a new tab)

  13. The Privacy Preservation of Data Cubes

    … data of data cube but the summation of range query was almost remained the same as that of the original data. The experiments were done on APB benchmark data set from OLAP council. The results showed that our methods achieved better privacy preservation and better accuracy for range …

    nus Repository record for The Privacy Preservation of Data Cubes (opens in a new tab) Download file for The Privacy Preservation of Data Cubes (opens in a new tab)

  14. On the ordering of multiattribute data in information retrieval systems

    … programming model applied to the partial match query. However, the literature is relatively silent on the range query retrieval. Faloutsos showed that the order determined by the reflected Gray code can significantly improve the cluster distribution of the data blocks. It is recommended to …

    ubc Repository record for On the ordering of multiattribute data in information retrieval systems (opens in a new tab) Download PDF for On the ordering of multiattribute data in information retrieval systems (opens in a new tab)

  15. Approximate search on massive spatiotemporal datasets.

    … algorithms, we motivate the need for approximate query methods that can be used in interactive exploration and as fast data analysis subroutines on large spatiotemporal datasets. This thesis formulates a simple approximate range query problem for time series data, and proposes a method that aims …

    umn Repository record for Approximate search on massive spatiotemporal datasets. (opens in a new tab)

  16. 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 …

    waterloo Repository record for A Non-Intersecting R-Tree (opens in a new tab)

  17. Probabilistic threshold range aggregate query processing over uncertain data

    … loss in data transfer. A probabilistic threshold range aggregate (PRTA) query retrieves summarized information about the uncertain objects in the database satisfying a range query, with respect to a given probability threshold. This thesis is trying to address and handle this important type of …

    unsw Repository record for Probabilistic threshold range aggregate query processing over uncertain data (opens in a new tab)

  18. A Framework for Real-time Analysis in OLAP Systems

    … library to accelerate data cube construction and query resolution. Experiments using a data cube with 10,000,000 tuples and an update set of 100,000 tuples show that our framework achieves a 99% performance improvement updating the data cube, a 76% performance increase when constructing a new data …

    concordia Download PDF for A Framework for Real-time Analysis in OLAP Systems (opens in a new tab)

  19. Sequencing geographical data for efficient query processing on air in mobile computing.

    … effective for sequencing point data for spatial range query processing, while graph partition tree traversal ordering heuristic in conjunction with the optimization methods is suitable for sequencing graph data for network path query processing over air.

    oklahoma-thes Repository record for Sequencing geographical data for efficient query processing on air in mobile computing. (opens in a new tab)

  20. Fast and scalable similarity and correlation queries on time series data

    … need for fast methods for analyzing and querying these datasets that are often too big for practical brute force analysis. We start with the main contributions to the field over the past decade and a half. We will then proceed by describing new solutions to correlation analysis on time …

    concordia Download PDF for Fast and scalable similarity and correlation queries on time series data (opens in a new tab)

Page 1 of 2