On the public citation graph
Top-k spatial joins
0 signed · 78 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-36285-1_10openalex-snapshot
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries
inferredcites →https://doi.org/10.1007/3-540-36389-0_21openalex-snapshot
Mobiscope: A Scalable Spatial Discovery Service for Mobile Network Resources
inferredcites →https://doi.org/10.1007/3-540-47724-1_23openalex-snapshot
Efficient OLAP Operations in Spatial Data Warehouses
inferredcites →https://doi.org/10.1007/3-540-48482-5_18openalex-snapshot
A Performance Evaluation of Spatial Join Processing Strategies
inferredcites →https://doi.org/10.1007/978-3-540-45072-6_15openalex-snapshot
On Spatial-Range Closest-Pair Query
inferredcites →https://doi.org/10.1007/978-3-540-45072-6_16openalex-snapshot
Evaluation of Iceberg Distance Joins
inferredcites →https://doi.org/10.1007/s00778-004-0128-2openalex-snapshot
Supporting top-k join queries in relational databases
inferredcites →https://doi.org/10.1016/b978-012722442-8/50072-0openalex-snapshot
Supporting Top-k Join Queries in Relational Databases
inferredcites →https://doi.org/10.1016/b978-155860651-7/50124-8openalex-snapshot
The X-tree: An Index Structure for High-Dimensional Data Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and…
inferredcites →https://doi.org/10.1109/icde.2002.994786openalex-snapshot
A non-blocking parallel spatial join algorithm
inferredcites →https://doi.org/10.1109/ssdm.1999.787623openalex-snapshot
PISA: Performance models for Index Structures with and without Aggregated data
inferredcites →https://doi.org/10.1109/tkde.2004.93openalex-snapshot
Range aggregate processing in spatial databases
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/191839.191881openalex-snapshot
Spatial joins using seeded trees
inferredcites →https://doi.org/10.1145/191843.191881openalex-snapshot
Spatial joins using seeded trees
inferredcites →https://doi.org/10.1145/233269.233338openalex-snapshot
Partition based spatial-merge join
inferredcites →https://doi.org/10.1145/235968.233338openalex-snapshot
Partition based spatial-merge join
inferredcites →https://doi.org/10.1145/276304.276326openalex-snapshot
Incremental distance join algorithms for spatial databases
inferredcites →https://doi.org/10.1145/276305.276326openalex-snapshot
Incremental distance join algorithms for spatial databases
inferredcites →https://doi.org/10.1145/320248.320255openalex-snapshot
Distance browsing in spatial databases
inferredcites →https://doi.org/10.1145/335191.335414openalex-snapshot
Closest pair queries in spatial databases
inferredcites →https://doi.org/10.1145/335191.335427openalex-snapshot
Indexing the positions of continuously moving objects
inferredcites →https://doi.org/10.1145/342009.335414openalex-snapshot
Closest pair queries in spatial databases
inferredcites →https://doi.org/10.1145/342009.335427openalex-snapshot
Indexing the positions of continuously moving objects
inferredcites →https://doi.org/10.1145/543613.543629openalex-snapshot
Efficient aggregation over objects with extent
inferredcites →https://doi.org/10.1145/585147.585179openalex-snapshot
Performance of multi-dimensional space-filling curves
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/93605.98741openalex-snapshot
The R*-tree: an efficient and robust access method for points and rectangles
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.1002/cpe.5303openalex-snapshot
An efficient similarity join approach on large‐scale high‐dimensional data using random projection
inferred← citeshttps://doi.org/10.1007/11535331_14openalex-snapshot
Evaluation of Top-k OLAP Queries Using Aggregate R–Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-26075-0_21openalex-snapshot
An Efficient Top-k Spatial Join Query Processing Algorithm on Big Spatial Data
inferred← citeshttps://doi.org/10.1007/978-3-030-30952-7_60openalex-snapshot
Similarity Histogram Estimation Based Top-k Similarity Join Algorithm on High-Dimensional Data
inferred← citeshttps://doi.org/10.1007/978-3-642-02279-1_43openalex-snapshot
Identifying the Most Endangered Objects from Spatial Datasets
inferred← citeshttps://doi.org/10.1007/978-3-642-17551-0_7openalex-snapshot
Towards Adaptively Approximated Search in Distributed Architectures
inferred← citeshttps://doi.org/10.1007/978-3-642-23737-9_15openalex-snapshot
A Recommendation Technique for Spatial Data
inferred← citeshttps://doi.org/10.1007/978-3-642-28323-9_5openalex-snapshot
Approximate Queries for Spatial Data
inferred← citeshttps://doi.org/10.1007/978-3-642-40235-7_1openalex-snapshot
Efficient Top-k Spatial Distance Joins
inferred← citeshttps://doi.org/10.1007/s00500-020-04807-wopenalex-snapshot
SETJoin: a novel top-k similarity join algorithm
inferred← citeshttps://doi.org/10.1007/s00778-022-00759-9openalex-snapshot
Reverse spatial top-k keyword queries
inferred← citeshttps://doi.org/10.1007/s10707-011-0124-9openalex-snapshot
Topological operators: a relaxed query processing approach
inferred← citeshttps://doi.org/10.1007/s10707-020-00393-zopenalex-snapshot
Top-k spatial distance joins
inferred← citeshttps://doi.org/10.1007/s10844-009-0078-7openalex-snapshot
Processing top-N relational queries by learning
inferred← citeshttps://doi.org/10.1016/j.datak.2007.09.004openalex-snapshot
Region clustering based evaluation of multiple top-N selection queries
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.03.015openalex-snapshot
Spatial joins based on NA-trees
inferred← citeshttps://doi.org/10.1016/j.is.2018.06.001openalex-snapshot
Querying spatial data by dominators in neighborhood
inferred← citeshttps://doi.org/10.1016/j.is.2019.101419openalex-snapshot
A top- k spatial join querying processing algorithm based on spark
inferred← citeshttps://doi.org/10.1109/hipc.2015.43openalex-snapshot
Load Balancing and Accelerating Parallel Spatial Join Operations Using Bitmap Indexing
inferred← citeshttps://doi.org/10.1109/icde.2012.87openalex-snapshot
Parallel Top-K Similarity Join Algorithms Using MapReduce
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00050openalex-snapshot
Joinable Search Over Multi-Source Spatial Datasets: Overlap, Coverage, and Efficiency
inferred← citeshttps://doi.org/10.1109/iciicii.2016.0012openalex-snapshot
Accelerating Spatial Join Aggregation with R-Tree for MapReduce
inferred← citeshttps://doi.org/10.1109/mic.2013.6758032openalex-snapshot
New hybrid index structure RBRT tree
inferred← citeshttps://doi.org/10.1109/tkde.2009.81openalex-snapshot
Optimal-Location-Selection Query Processing in Spatial Databases
inferred← citeshttps://doi.org/10.1145/1247480.1247494openalex-snapshot
Progressive and selective merge
inferred← citeshttps://doi.org/10.1145/1653771.1653809openalex-snapshot
Design and evaluation of trajectory join algorithms
inferred← citeshttps://doi.org/10.1145/1807167.1807263openalex-snapshot
Finding maximum degrees in hidden bipartite graphs
inferred← citeshttps://doi.org/10.1145/2188349.2188354openalex-snapshot
Exact and approximate algorithms for the most connected vertex problem
inferred← citeshttps://doi.org/10.5897/jeci11.008openalex-snapshot
Optimization of spatial join using constraints based- clustering techniques
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.