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 14 of 14 for “"R-tree"”.
-
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. …
-
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 …
-
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 …
-
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 …
-
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.
-
Dynamic-parinet (D-parinet) : indexing present and future trajectories in networks
… of graph partitioning and a set of composite B+-tree local indexes tuned for a given query load and a given data distribution in the network space. D-PARINET studies continuous update of trajectory data and use interpolation to predict future MO movement in the network. PARINET and D-PARINET can …
-
Algorithmic and statistical properties of filling elements of a free group, and quantitative residual properties of gamma-limit groups
… in any very small action free action on an R-tree. For the free group of rank two, we construct a combinatorial algorithm to determine whether or not a given finitely generated subgroup is filling. In higher ranks, we discuss two types of non-filling subgroups: those contained in loop vertex …
-
An integrated index structure for object-oriented and spatio-temporal information systems
… between several dD indexing methods, the R tree structure was selected to index spatio-temporal objects by treating homogeneously both spatial and temporal dimensions. An object-oriented development technique named TDSO was utilized to specify and design the RTree class extensions and the …
-
Virtual forced splitting in multidimensional access methods
External, tree-based, multidimensional access methods typically attempt to provide B+ tree like behaviour and performance in the organisation of large collections of multidimensional data. The B+ tree’s efficiency comes directly from the fact that it organises data occupying a single dimension, …
-
On indexing large databases for advanced data models
… for multidimensional range search, such as the R-tree and its variants, are based on ad hoc assumptions on the nature of the workloads they index, and have been known to suffer from reduced scalability and robustness. We adopt an alternative approach; our study focuses on techniques that provide …
-
Indexing for moving objects
… multi-dimensional index structure such as the R-tree. The association of moving speeds with its MBR often causes large overlaps among MBRs. This problem becomes more severe as the number of concurrent operations increases due to lock contention. Thus, it cannot handle heavy update load and high …
-
Dynamics of irreducible endomorphisms of F_n
… N. The proof uses certian projections of trees coming from invariant length measures. These ideas are extended to show how to decompose a tree T in the boundary of Outer space by considering the space of invariant length measures on T; this gives a decomposition that generalizes the …
-
Proposta de um framework conceitual para apoiar a criação de técnicas de indexação para banco de dados temporais
… de desempenho e portabilidade. São exemplos B-Tree, B+-Tree e R-Tree, entre outras. Estas técnicas não suportam indexar os complexos BDTs, mas são fundamentais para que sirvam de base para novas estruturas que suportem esses tipos de dados. As técnicas de indexação para dados temporais …