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 66 for “"R-Tree"”.

  1. A Non-Intersecting R-Tree

    Indexes for multidimensional data based on the 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 …

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

  2. SIMD-fied bulk R-tree construction

    Spatial indexing through R-tree construction is increasingly critical as datasets expand, making performance improvements essential for modern applications. The Sort-Tile-Recursive (STR) algorithm, commonly used for bulk R-tree construction, requires optimization to meet the demands of larger …

    umn Repository record for SIMD-fied bulk R-tree construction (opens in a new tab)

  3. An R-tree index using the STL style

    … critical for performance of database systems. Trees are effective indexes that handle both single-dimensional and multi-dimensional data. The R-tree is a commonly used multi-dimensional tree index for the spatial data and geographic information system (GIS). By using design pattern and …

    concordia Download PDF for An R-tree index using the STL style (opens in a new tab)

  4. rK-Hist : an R-Tree based histogram for multi-dimensional selectivity estimation

    … a new histogram model that is based upon an r-tree space partitioning. The localization of the r-tree boxes is in turn controlled by a Hilbert space filling curve, while a series of efficient area equalization heuristics restructures the initial boxes to provide improved bucket representation. …

    concordia Download PDF for rK-Hist : an R-Tree based histogram for multi-dimensional selectivity estimation (opens in a new tab)

  5. An R*-Tree Based Semi-Dynamic Clustering Method for the Efficient Processing of Spatial Join in a Shared-Nothing Parallel Database System

    The growing importance of geospatial databases has made it essential to perform complex spatial queries efficiently. To achieve acceptable performance levels, database systems have been increasingly required to make use of parallelism. The spatial join is a computationally expensive operator. …

    uno Repository record for An R*-Tree Based Semi-Dynamic Clustering Method for the Efficient Processing of Spatial Join in a Shared-Nothing Parallel Database System (opens in a new tab)

  6. Disk-based Indexing for NIR-Trees using Polygon Overlays

    This thesis presents the NIR+-Tree, a disk-resident R-Tree variant that eliminates overlap among its minimum bounding rectangles (MBRs). The NIR+-Tree is an extension of the main-memory NIR-Tree, adopting techniques for efficient storage and retrieval on disk. By employing non-intersecting polygons …

    waterloo Repository record for Disk-based Indexing for NIR-Trees using Polygon Overlays (opens in a new tab)

  7. Efficient Concurrent Operations in Spatial Databases

    … indexing structures such as the R-tree family and grid file; 2) linear spatial access methods, represented by the Space-Filling Curve (SFC) combined with B-trees. Concurrency control protocols have been designed for some pure multidimensional indexing structures, but none of them is …

    vt Repository record for Efficient Concurrent Operations in Spatial Databases (opens in a new tab)

  8. A computational model of prosody for Yorùbá text-to-speech synthesis

    … framework is implemented using the Relational Tree (R-Tree) techniques (Ehrich and Foith, 1976). R-Tree is a sophisticated data structure that provides a multi-dimensional description of a waveform. A Skeletal Tree (S-Tree) is first generated using algorithms based on the tone phonological …

    aston Download PDF for A computational model of prosody for Yorùbá text-to-speech synthesis (opens in a new tab)

  9. Partial Replica Location And Selection For Spatial Datasets

    … we have improved performance by designing a R-tree structure in the backend database, and by aggregating several queries into one larger query, which reduces overhead. We also use the Morton Space-filling Curve during R-tree construction, which improves spatial locality. In addition, we …

    mississippi Repository record for Partial Replica Location And Selection For Spatial Datasets (opens in a new tab)

  10. Video database retrieval based on trajectory analysis

    … point warping is given. We implemented the R-tree as the indexing structure and specialized it to our application. The trajectory and speed curves are analyzed and the abstract feature values are organized within the R-tree structure. A QBE interface is provided, and hierarchical searching is …

    ubc Repository record for Video database retrieval based on trajectory analysis (opens in a new tab) Download PDF for Video database retrieval based on trajectory analysis (opens in a new tab)

  11. Enhancing Spatial Query Efficiency Through Dead Space Indexing in Minimum Bounding Boxes

    … enabling seamless integration with any R-tree variant without altering the core indexing architecture. The effectiveness of this technique is validated through a comprehensive set of experiments on both real-world and synthetic datasets, demonstrating significant improvements in query …

    waterloo Repository record for Enhancing Spatial Query Efficiency Through Dead Space Indexing in Minimum Bounding Boxes (opens in a new tab)

  12. Finding strong, common and discriminating characteristics of clusters from thematic maps

    … other techniques such as a technique based on R-tree technique. For the problem of how to extract patterns of multiple clusters efficiently. Two different methods for pattern extraction are evaluated. The technique based on isothetic rectangle intersections again outperforms the technique based …

    ubc Repository record for Finding strong, common and discriminating characteristics of clusters from thematic maps (opens in a new tab) Download PDF for Finding strong, common and discriminating characteristics of clusters from thematic maps (opens in a new tab)

  13. Algorithms and data structures for IP lookup, packet classification and conflict detection

    … used concept in the design of concurrent search tree algorithms. <br>The first part investigates the hypothesis that a relaxed balancing scheme is better suited for search-tree based dynamic IP router tables than a scheme that utilizes strict balancing. To this end we propose the relaxed balanced …

    freiburg-diss Repository record for Algorithms and data structures for IP lookup, packet classification and conflict detection (opens in a new tab)

  14. Subseries Join and Compression of Time Series Data Based on Non-uniform Segmentation

    … all features in a dataset are indexed in an R-tree, and candidate matching features of two datasets are found by an R-tree join operation. Given candidate matching features, a dynamic programming algorithm is developed to compute the final subseries join. To improve storage efficiency, a …

    waterloo Repository record for Subseries Join and Compression of Time Series Data Based on Non-uniform Segmentation (opens in a new tab)

  15. Spatial Indexing for Moving Geometry in Main Memory

    … The evaluated data structures are the simple quadtree, the loose quadtree, theloose-linear quadtree, and the R*-tree. A dynamic array is also implemented to represent a naïve approach. Where applicable, we augment the spatial indexes with two update techniques: bottom-up updating and update memo, …

    chalmers Repository record for Spatial Indexing for Moving Geometry in Main Memory (opens in a new tab)

  16. New strategies for electronic design automation problems

    … BFS (breadth-first search) algorithm and the R-tree structure. Therefore, we propose strategies to use the cost-effective GPU platform to parallelize and accelerate BFS and R-tree query. These strategies are potentially applicable to many EDA problems.

    uiuc Repository record for New strategies for electronic design automation problems (opens in a new tab)

  17. Query Authentication and processing on outsourced databases

    … of the approach are studied :( 1) Verifiable KD-tree (VKDtree) that is based on space partitioning, and (2)Verifiable R-tree (VR-tree) that is based on data partitioning. The schemes are evaluated on window queries, and results show that VR-tree is highly precise, meaning that few data points …

    nus Repository record for Query Authentication and processing on outsourced databases (opens in a new tab) Download file for Query Authentication and processing on outsourced databases (opens in a new tab)

  18. Efficient geographic information systems: Data structures, Boolean operations and concurrency control

    … show how a spatial data structure called an R-tree can be used to augment the performance of many existing GIS. Boolean operations on geographic data are fundamental to the spatial anal ysis common in geographic data processing. They allow the user to analyze geographic data by using operators …

    rit Repository record for Efficient geographic information systems: Data structures, Boolean operations and concurrency control (opens in a new tab)

  19. SpatialHadoop: A MapReduce Framework for Big Spatial Data

    … efficient spatial indexes, such as grid, R-tree, R+-tree, and Quad tree, which organize the data nicely in the distributed file system. The indexes follow a two-level design of one global index that partitions the data across machines, and multiple local indexes that organize records in each …

    umn Repository record for SpatialHadoop: A MapReduce Framework for Big Spatial Data (opens in a new tab)

Page 1 of 4