On the public citation graph
Declustering spatial databases on a multi-computer architecture
0 signed · 103 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-52208-5_28openalex-snapshot
Hierarchical spatial data structures
inferredcites →https://doi.org/10.1007/bf00962238openalex-snapshot
Efficient and effective Querying by Image Content
inferredcites →https://doi.org/10.1109/tse.1987.233515openalex-snapshot
On Multiple Random Accesses and Physical Data Placement in Dynamic Files
inferredcites →https://doi.org/10.1145/115790.115859openalex-snapshot
Dynamic file allocation in disk arrays
inferredcites →https://doi.org/10.1145/119995.115859openalex-snapshot
Dynamic file allocation in disk arrays
inferredcites →https://doi.org/10.1145/130283.130293openalex-snapshot
A performance analysis of alternative multi-attribute declustering strategies
inferredcites →https://doi.org/10.1145/16856.16886openalex-snapshot
Spatial query processing in an object-oriented database system
inferredcites →https://doi.org/10.1145/170035.170075openalex-snapshot
Efficient processing of spatial joins using R-trees
inferredcites →https://doi.org/10.1145/170036.170075openalex-snapshot
Efficient processing of spatial joins using R-trees
inferredcites →https://doi.org/10.1145/182591.182593openalex-snapshot
Beyond uniformity and independence
inferredcites →https://doi.org/10.1145/205447.205460openalex-snapshot
Measured capacity of an Ethernet
inferredcites →https://doi.org/10.1145/223784.223796openalex-snapshot
A general solution of the n-dimensional B-tree problem
inferredcites →https://doi.org/10.1145/318898.318900openalex-snapshot
Direct spatial search on pictorial databases using packed R-trees
inferredcites →https://doi.org/10.1145/319682.319698openalex-snapshot
Disk allocation for Cartesian product files on multiple-disk systems
inferredcites →https://doi.org/10.1145/358728.358741openalex-snapshot
An effective way to represent quadtrees
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1145/38713.38743openalex-snapshot
The BANG file: A new kind of grid file
inferredcites →https://doi.org/10.1145/38714.38743openalex-snapshot
The BANG file: A new kind of grid file
inferredcites →https://doi.org/10.1145/52324.52347openalex-snapshot
Measured capacity of an Ethernet: myths and reality
inferredcites →https://doi.org/10.1145/568271.223796openalex-snapshot
A general solution of the n-dimensional B-tree problem
inferredcites →https://doi.org/10.1145/73721.73746openalex-snapshot
Fractals for secondary key retrieval
inferredcites →https://doi.org/10.1145/73721.73747openalex-snapshot
Declustering using error correcting codes
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.1145/93597.98742openalex-snapshot
Linear clustering of objects with multiple attributes
inferredcites →https://doi.org/10.1145/93605.98741openalex-snapshot
The R*-tree: an efficient and robust access method for points and rectangles
inferredcites →https://doi.org/10.1145/93605.98742openalex-snapshot
Linear clustering of objects with multiple attributes
inferredcites →https://doi.org/10.1145/971701.50221openalex-snapshot
Optimal file distribution for partial match retrieval
inferredcites →https://doi.org/10.1145/99935.99949openalex-snapshot
The hB-tree: a multiattribute indexing method with good guaranteed performance
inferredcites →https://doi.org/10.1184/r1/6606125openalex-snapshot
Hilbert R-tree: An Improved R-tree using Fractals
inferredcites →https://doi.org/10.1184/r1/6610748openalex-snapshot
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11733836_64openalex-snapshot
Efficient k-Nearest Neighbor Searches for Parallel Multidimensional Index Structures
inferred← citeshttps://doi.org/10.1007/11751649_5openalex-snapshot
Efficient Parallel Processing for K-Nearest-Neighbor Search in Spatial Databases
inferred← citeshttps://doi.org/10.1007/978-0-387-35973-1_603openalex-snapshot
Indexing, Hilbert R-Tree, Spatial Indexing, Multimedia Indexing
inferred← citeshttps://doi.org/10.1007/978-3-319-23519-6_603-2openalex-snapshot
Indexing, Hilbert R-Tree, Spatial Indexing, Multimedia Indexing
inferred← citeshttps://doi.org/10.1007/978-3-540-24741-8_43openalex-snapshot
Management of Highly Dynamic Multidimensional Data in a Cluster of Workstations
inferred← citeshttps://doi.org/10.1007/978-3-540-30192-9_51openalex-snapshot
P2PR-Tree: An R-Tree-Based Spatial Index for Peer-to-Peer Environments
inferred← citeshttps://doi.org/10.1007/978-3-540-45227-0_21openalex-snapshot
Effective Load-Balancing via Migration and Replication in Spatial Grids
inferred← citeshttps://doi.org/10.1007/978-3-540-74742-0_37openalex-snapshot
Cluster Recovery for Fault Tolerance of Spatial Database Cluster in Sensor Networks
inferred← citeshttps://doi.org/10.1007/s00778-008-0121-2openalex-snapshot
Self-tuning management of update-intensive multidimensional data in clusters of workstations
inferred← citeshttps://doi.org/10.1007/s10115-003-0104-yopenalex-snapshot
Alternative strategies for Performing Spatial Joins on Web Sources
inferred← citeshttps://doi.org/10.1007/s11227-011-0567-7openalex-snapshot
Analyzing design choices for distributed multidimensional indexing
inferred← citeshttps://doi.org/10.1007/s11227-012-0800-zopenalex-snapshot
Distributed high dimensional indexing for k-NN search
inferred← citeshttps://doi.org/10.1016/j.cageo.2015.09.003openalex-snapshot
Data decomposition method for parallel polygon rasterization considering load balancing
inferred← citeshttps://doi.org/10.1016/j.future.2008.02.010openalex-snapshot
An efficient peer-to-peer indexing tree structure for multidimensional data
inferred← citeshttps://doi.org/10.1016/j.is.2003.08.003openalex-snapshot
Iterative-improvement-based declustering heuristics for multi-disk databases
inferred← citeshttps://doi.org/10.1016/j.jpdc.2010.02.002openalex-snapshot
Multiple query scheduling for distributed semantic caches
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.parco.2003.05.003openalex-snapshot
Parallel bulk-loading of spatial data
inferred← citeshttps://doi.org/10.1023/a:1009758427967openalex-snapshot
Nearest Neighbor Queries in Shared-Nothing Environments
inferred← citeshttps://doi.org/10.1023/a:1019047229571openalex-snapshot
Storing spatial data on a network of workstations
inferred← citeshttps://doi.org/10.1023/a:1026509108054openalex-snapshot
Distributed Processing of Similarity Queries
inferred← citeshttps://doi.org/10.1109/ccgrid.2003.1199356openalex-snapshot
Parallel multi-dimensional ROLAP indexing
inferred← citeshttps://doi.org/10.1109/ccgrid.2005.1558637openalex-snapshot
Spatial indexing of distributed multidimensional datasets
inferred← citeshttps://doi.org/10.1109/dante.1999.844988openalex-snapshot
Parallel R-tree spatial join for a shared-nothing architecture
inferred← citeshttps://doi.org/10.1109/hipc.2012.6507487openalex-snapshot
A fault-tolerant environment for large-scale query processing
inferred← citeshttps://doi.org/10.1109/hpcc.2012.121openalex-snapshot
A Performance Study of Traversing Spatial Indexing Structures in Parallel on GPU
inferred← citeshttps://doi.org/10.1109/icde.2007.367938openalex-snapshot
MultiMap: Preserving disk locality for multidimensional datasets
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639280openalex-snapshot
DiST: fully decentralized indexing for querying distributed multidimensional datasets
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639313openalex-snapshot
Distributed antipole clustering for efficient data search and management in Euclidean and metric spaces
inferred← citeshttps://doi.org/10.1109/mdm.2015.47openalex-snapshot
Efficient and Scalable Spatial Retrieval of Resident Involvement Information in City Events
inferred← citeshttps://doi.org/10.1109/sc.2006.44openalex-snapshot
Multiple Range Query Optimization with Distributed Cache Indexing
inferred← citeshttps://doi.org/10.1109/ssdbm.2004.65openalex-snapshot
Spatio-temporal data services in a shared-nothing environment
inferred← citeshttps://doi.org/10.1109/ssdm.2004.1311204openalex-snapshot
Spatio-temporal data services in a shared-nothing environment
inferred← citeshttps://doi.org/10.1109/tkde.2009.160openalex-snapshot
Managing Multidimensional Historical Aggregate Data in Unstructured P2P Networks
inferred← citeshttps://doi.org/10.1109/tsc.2021.3079580openalex-snapshot
Multi-GPU Efficient Indexing For Maximizing Parallelism of High Dimensional Range Query Services
inferred← citeshttps://doi.org/10.1117/12.761369openalex-snapshot
Fully distributed R-tree for efficient range query dissemination in peer-to-peer spatial data grid
inferred← citeshttps://doi.org/10.1145/1032222.1032250openalex-snapshot
On efficiently processing nearest neighbor queries in a loosely coupled set of data sources
inferred← citeshttps://doi.org/10.1145/1097064.1097074openalex-snapshot
Spatial queries in sensor networks
inferred← citeshttps://doi.org/10.1145/1188455.1188560openalex-snapshot
Data management and query---Multiple range query optimization with distributed cache indexing
inferred← citeshttps://doi.org/10.1145/233269.233321openalex-snapshot
A Teradata content-based multimedia object manager for massively parallel architectures
inferred← citeshttps://doi.org/10.1145/253260.253342openalex-snapshot
Building a scaleable geo-spatial DBMS
inferred← citeshttps://doi.org/10.1145/253262.253342openalex-snapshot
Building a scaleable geo-spatial DBMS
inferred← citeshttps://doi.org/10.1145/258319.258330openalex-snapshot
Parallel processing of nearest neighbor queries in declustered spatial data
inferred← citeshttps://doi.org/10.1145/288692.288721openalex-snapshot
Evaluating parallel R-tree implementations on a network of workstations (an extended abstract)
inferred← citeshttps://doi.org/10.1145/2949689.2949705openalex-snapshot
Multi-Assignment Single Joins for Parallel Cross-Match of Astronomic Catalogs on Heterogeneous Clusters
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/3221269.3223031openalex-snapshot
Multidimensional range queries on modern hardware
inferred← citeshttps://doi.org/10.1145/3397506openalex-snapshot
Packing R-trees with Space-filling Curves
inferred← citeshttps://doi.org/10.1145/355274.355296openalex-snapshot
A mechanism to detect changing access patterns and automatically migrate distributed R-tree indexed multidimensional data
inferred← citeshttps://doi.org/10.1184/r1/6607868openalex-snapshot
On Multidimensional Data and Modern Disks
inferred← citeshttps://doi.org/10.1184/r1/6619700openalex-snapshot
MultiMap: Preserving Disk Locality for Multidimensional Datasets (CMU-PDL-05-102)
inferred← citeshttps://doi.org/10.1587/transinf.e96.d.2776openalex-snapshot
Accelerating Range Query Processing on R-Tree Using Graphics Processing Units
inferred← citeshttps://doi.org/10.3745/kipstd.2012.19d.2.151openalex-snapshot
Performance Enhancement of a DVA-tree by the Independent Vector Approximation
inferred← citeshttps://doi.org/10.5753/jidm.2015.1556openalex-snapshot
A New Technique for Verifying the Consistency of Distributed R-Trees
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.