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 5 of 5 for “"Range Query"”.

  1. ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain

    … that are critical for efficiency: a range query optimization that reduces the number of distance computations required when finding nearest neighbors of clusters, and a caching optimization that stores a subset of previously computed distances, which are likely to be reused. …

    mit Repository record for ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain (opens in a new tab)

  2. Privacy-preserving query processing over encrypted data in cloud

    <p>"The query processing of relational data has been studied extensively throughout the past decade. A number of theoretical and practical solutions to query processing have been proposed under various scenarios. With the recent popularity of cloud computing, data owners now have the opportunity to …

    must-thes Repository record for Privacy-preserving query processing over encrypted data in cloud (opens in a new tab)

  3. BP-Tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B⁺-trees

    … that uses large leaf nodes to optimize for range-query performance without sacrificing update speed by using large leaf nodes. B⁺-trees are a fundamental data structure for implementing in-memory indexes in databases and storage systems. B⁺- trees support both point operations (i.e., inserts …

    mit Repository record for BP-Tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B⁺-trees (opens in a new tab)

  4. Designing Compact On-Disk Index Data Structures

    … achieves more efficient use of I/O for point and range queries. Disco guarantees that a point query issues at most one I/O while a short range query needs at most two I/Os, achieving an I/O efficiency close to a B+-tree. The third work extends the design of Disco to achieve an optimal use of I/O …

    uic

  5. Data Distribution Management In Large-scale Distributed Environments

    … Distributed Tree (HD Tree), to support range queries in P2P overlay networks. All the relevant problems of a distributed data structure, including the scalability, self-organizing, fault-tolerance, and load balancing have been studied. Both theoretical analysis and experimental results …

    ottawa-retro Repository record for Data Distribution Management In Large-scale Distributed Environments (opens in a new tab)