GPU-Based Algorithms for Processing the k Nearest-Neighbor Query on Spatial Data Using Partitioning and Concurrent Kernel Execution |
|
Efficient distributed algorithms for distance join queries in spark-based spatial analytics systems |
|
Porting disk-based spatial index structures to flash-based solid state drives |
|
GPU-aided edge computing for processing the k nearest-neighbor query on SSD-resident data |
|
Efficient group k nearest-neighbor spatial query processing in apache spark |
|
Algorithms for processing the group K nearest-neighbor query on distributed frameworks |
|
Parallel processing of spatial batch-queries using xBR <sup>+</sup> -trees in solid-state drives |
|
Improving Distance-Join Query processing with Voronoi-Diagram based partitioning in SpatialHadoop |
|
Efficient processing of all-k-nearest-neighbor queries in the MapReduce programming framework |
|
Bulk-loading and bulk-insertion algorithms for xBR <sup>+</sup>-trees in Solid State Drives |
|
Efficient distance join query processing in distributed spatial data management systems |
|
Efficient large-scale distance-based join queries in spatialhadoop |
|
An efficient algorithm for bulk-loading xBR+-trees |
|
Efficient query processing on large spatial databases: A performance study |
|
New plane-sweep algorithms for distance-based join queries in spatial databases |
|
Analysis and design of a web-based decision support system for choosing higher education studies |
|
Comparison of post-relational and object-relational modelling for real-world database applications |
|
Higher technological education specialties and graduates' vocational status and prospects |
|
On past-time indexing of moving objects |
|
Cost models for distance joins queries using R-trees |
|
On approximate algorithms for distance-based queries using R-trees |
|
A spatio-temporal geometry-based model for digital documentation of historical living systems |
|
Algorithms for processing K-closest-pair queries in spatial databases |
|
Multi-way distance join queries in spatial databases |
|
Benchmarking access methods for time-evolving regional data |
|
Performance evaluation of lazy deletion methods in R-trees |
|
On the generation of time-evolving regional data |
|
Overlapping linear quadtrees and spatio-temporal query processing |
|
Closest pair queries in spatial databases |
|
On sampling regional data |
|
On the creation of quadtrees by using a branching process |
|
A random model for analyzing region quadtrees |
|
Dynamic inverted quadtree: A structure for pictorial databases |
|
Analytical comparison of two spatial data structures |
|
Overlapping quadtrees for the representation of similar images |
|