On the public citation graph
A Performance Study of Traversing Spatial Indexing Structures in Parallel on GPU
0 signed · 22 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bfb0014180openalex-snapshot
Declustering spatial databases on a multi-computer architecture
inferredcites →https://doi.org/10.1016/j.jpdc.2008.05.014openalex-snapshot
A performance study of general-purpose applications on graphics processors using CUDA
inferredcites →https://doi.org/10.1109/69.908985openalex-snapshot
Analysis of the clustering properties of the Hilbert space-filling curve
inferredcites →https://doi.org/10.1109/ssdm.1999.787622openalex-snapshot
Master-client R-trees: a new parallel R-tree architecture
inferredcites →https://doi.org/10.1145/1007568.1007594openalex-snapshot
Fast computation of database operations using graphics processors
inferredcites →https://doi.org/10.1145/1620585.1620588openalex-snapshot
Relational query coprocessing on graphics processors
inferredcites →https://doi.org/10.1145/1735688.1735706openalex-snapshot
Accelerating SQL database operations on a GPU with CUDA
inferredcites →https://doi.org/10.1184/r1/6610658openalex-snapshot
The K-D-B-Tree : a search structure for large multidimensional dynamic indexes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10115-023-01899-2openalex-snapshot
Accelerating massive queries of approximate nearest neighbor search on high-dimensional data
inferred← citeshttps://doi.org/10.1007/s10586-015-0428-xopenalex-snapshot
Improving the performance of GIS polygon overlay computation with MapReduce for spatial big data processing
inferred← citeshttps://doi.org/10.1007/s10586-017-1253-1openalex-snapshot
HBase storage schemas for massive spatial vector data
inferred← citeshttps://doi.org/10.1016/j.jpdc.2013.03.015openalex-snapshot
Parallel multi-dimensional range query processing with R-trees on GPU
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.10.015openalex-snapshot
Co-processing heterogeneous parallel index for multi-dimensional datasets
inferred← citeshttps://doi.org/10.1109/tc.2018.2823760openalex-snapshot
A GPU-Aware Parallel Index for Processing High-Dimensional Big Data
inferred← citeshttps://doi.org/10.1109/tpds.2014.2347041openalex-snapshot
Exploiting Massive Parallelism for IndexingMulti-Dimensional Datasets on the GPU
inferred← citeshttps://doi.org/10.1109/tpds.2024.3381214openalex-snapshot
G-Learned Index: Enabling Efficient Learned Index on GPU
inferred← citeshttps://doi.org/10.3390/math12132115openalex-snapshot
Efficient Parallel Processing of R-Tree on GPUs
inferred← citeshttps://doi.org/10.7753/ijsea1112.1049openalex-snapshot
Research on Key Technologies of 3D Rendering Algorithm in Urban Architecture Design
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.