On the public citation graph
Towards a Painless Index for Spatial Objects
0 signed · 59 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/3-540-48482-5_7openalex-snapshot
XZ-Ordering: A Space-Filling Curve for Objects with Spatial Extension
inferredcites →https://doi.org/10.1007/bf00288933openalex-snapshot
Quad trees a data structure for retrieval on composite keys
inferredcites →https://doi.org/10.1007/s00778-006-0013-2openalex-snapshot
The B dual -Tree: indexing moving objects by space filling curves in the dual space
inferredcites →https://doi.org/10.1016/b978-012088469-8.50071-1openalex-snapshot
Approximate NN Queries on Streams with Guaranteed Error/performance Bounds
inferredcites →https://doi.org/10.1021/jm030242kopenalex-snapshot
Shape Signatures: A New Approach to Computer-Aided Ligand- and Receptor-Based Drug Design
inferredcites →https://doi.org/10.1023/a:1012809914301openalex-snapshot
SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees
inferredcites →https://doi.org/10.1080/136588197242185openalex-snapshot
Point representation of spatial objects and query window extension: a new technique for spatial access methods
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/icde.2004.1320007openalex-snapshot
Making the pyramid technique robust to query types and workloads
inferredcites →https://doi.org/10.1109/icde.2006.179openalex-snapshot
Effective Density Queries on ContinuouslyMoving Objects
inferredcites →https://doi.org/10.1109/t-c.1971.223258openalex-snapshot
Alternative Algorithm for Hilbert's Space-Filling Curve
inferredcites →https://doi.org/10.1145/1093382.1093383openalex-snapshot
Generalized multidimensional data mapping and query processing
inferredcites →https://doi.org/10.1145/1282480openalex-snapshot
Proceedings of the 1st International Conference on Very Large Data Bases - VLDB '75
inferredcites →https://doi.org/10.1145/2213556.2213587openalex-snapshot
On the optimality of clustering properties of space filling curves
inferredcites →https://doi.org/10.1145/280277.280279openalex-snapshot
Multidimensional access methods
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1145/373626.373678openalex-snapshot
Querying multi-dimensional data indexed using the Hilbert space-filling curve
inferredcites →https://doi.org/10.1145/588011.588037openalex-snapshot
A class of data structures for associative searching
inferredcites →https://doi.org/10.1145/73721.73746openalex-snapshot
Fractals for secondary key retrieval
inferredcites →https://doi.org/10.1145/93597.98741openalex-snapshot
The R*-tree: an efficient and robust access method for points and rectangles
inferredcites →https://doi.org/10.1184/r1/6604967openalex-snapshot
DOT: A Spatial Access Method Using Fractals
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.6596openalex-snapshot
Novel approaches on bulk‐loading of large scale spatial datasets
inferred← citeshttps://doi.org/10.1007/978-3-319-22849-5_33openalex-snapshot
A Universal Distributed Indexing Scheme for Data Centers with Tree-Like Topologies
inferred← citeshttps://doi.org/10.1007/978-3-319-98809-2_15openalex-snapshot
$$R^2$$-Tree: An Efficient Indexing Scheme for Server-Centric Data Center Networks
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2025.110394openalex-snapshot
Indexing history spatio-temporal samples with error-bounded regression Hilbert trees
inferred← citeshttps://doi.org/10.1016/j.datak.2019.101729openalex-snapshot
An efficient and scalable multi-dimensional indexing scheme for modular data centers
inferred← citeshttps://doi.org/10.1016/j.isprsjprs.2025.03.014openalex-snapshot
An nD-histogram technique for querying non-uniformly distributed point cloud data
inferred← citeshttps://doi.org/10.1093/comjnl/bxy132openalex-snapshot
Accelerate Data Retrieval by Multi-Dimensional Indexing in Switch-Centric Data Centers
inferred← citeshttps://doi.org/10.1109/access.2025.3573152openalex-snapshot
HPG-Tree: An Enhanced B+ -Tree for Spatial Indexing
inferred← citeshttps://doi.org/10.1109/cacml64929.2025.11010977openalex-snapshot
Hybrid ARIMA and GRNN Model for Accurate Short-Term Water Level Prediction
inferred← citeshttps://doi.org/10.1109/icdsis65355.2025.11070921openalex-snapshot
Deep Reinforcement Learning-Enhanced Query Optimization Engine for Distributed and Federated Database Management Systems
inferred← citeshttps://doi.org/10.1109/mdm55031.2022.00023openalex-snapshot
The “AI + R” - tree: An Instance-optimized R - tree
inferred← citeshttps://doi.org/10.1109/tkde.2016.2526006openalex-snapshot
Efficient R-Tree Based Indexing Scheme for Server-Centric Cloud Storage System
inferred← citeshttps://doi.org/10.1109/tkde.2024.3364183openalex-snapshot
A Survey of Multi-Dimensional Indexes: Past and Future Trends
inferred← citeshttps://doi.org/10.1109/tnet.2019.2891008openalex-snapshot
U2-Tree: A Universal Two-Layer Distributed Indexing Scheme for Cloud Storage System
inferred← citeshttps://doi.org/10.1145/2833165.2833171openalex-snapshot
Spatio-temporal join technique for disaster estimation in large-scale natural disaster
inferred← citeshttps://doi.org/10.1145/3017611.3017615openalex-snapshot
Composition of simulation data for large-scale disaster estimation
inferred← citeshttps://doi.org/10.1145/3177732.3177738openalex-snapshot
Theoretically optimal and empirically efficient r-trees with strong parallelizability
inferred← citeshttps://doi.org/10.1145/3397506openalex-snapshot
Packing R-trees with Space-filling Curves
inferred← citeshttps://doi.org/10.1145/3589132.3625597openalex-snapshot
MaaSDB: Spatial Databases in the Era of Large Language Models (Vision Paper)
inferred← citeshttps://doi.org/10.14778/3407790.3407829openalex-snapshot
Effectively learning spatial indices
inferred← citeshttps://doi.org/10.3390/ijgi7080327openalex-snapshot
A Parallel N-Dimensional Space-Filling Curve Library and Its Application in Massive Point Cloud Management
inferred← citeshttps://doi.org/10.3390/ijgi8110512openalex-snapshot
An Adaptive Construction Method of Hierarchical Spatio-Temporal Index for Vector Data under Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.3390/rs13091815openalex-snapshot
RSIMS: Large-Scale Heterogeneous Remote Sensing Images Management System
inferred← citeshttps://doi.org/10.5121/ijdms.2020.12302openalex-snapshot
HISTSFC: Optimization for ND Massive Spatial Points Querying
inferred← citeshttps://doi.org/10.5194/isprs-annals-vi-4-w1-2020-119-2020openalex-snapshot
AN OPTIMIZED SFC APPROACH FOR ND WINDOW QUERYING ON POINT CLOUDS
inferred← citeshttps://doi.org/10.5194/isprs-archives-xliii-b4-2021-367-2021openalex-snapshot
AN EFFICIENT ND-POINT DATA STRUCTURE FOR QUERYING FLOOD RISK
inferred← citeshttps://doi.org/10.5441/002/edbt.2015.43openalex-snapshot
K-Nearest Neighbor Temporal Aggregate Queries
inferred← citeshttps://doi.org/10.59490/abe.2022.12.6536openalex-snapshot
nD-PointCloud Data Management
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.