On the public citation graph
Adaptive and incremental processing for distance join queries
0 signed · 50 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.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/78.120795openalex-snapshot
Fast K-dimensional tree algorithms for nearest neighbor search with application to vector quantization encoding
inferredcites →https://doi.org/10.1109/icde.1998.655779openalex-snapshot
Fast nearest neighbor search in high-dimensional space
inferredcites →https://doi.org/10.1109/icde.2000.839456openalex-snapshot
Independent quantization: an index compression technique for high-dimensional data spaces
inferredcites →https://doi.org/10.1109/tcbb.2004.12openalex-snapshot
Sequencing-by-hybridization revisited: the analog-spectrum proposal
inferredcites →https://doi.org/10.1145/170035.170075openalex-snapshot
Efficient processing of spatial joins using R-trees
inferredcites →https://doi.org/10.1145/191839.191880openalex-snapshot
Multi-step processing of spatial joins
inferredcites →https://doi.org/10.1145/191839.191881openalex-snapshot
Spatial joins using seeded trees
inferredcites →https://doi.org/10.1145/191843.191880openalex-snapshot
Multi-step processing of spatial joins
inferredcites →https://doi.org/10.1145/220279.220315openalex-snapshot
Accounting for boundary effects in nearest neighbor searching
inferredcites →https://doi.org/10.1145/233269.233338openalex-snapshot
Partition based spatial-merge join
inferredcites →https://doi.org/10.1145/253260.253302openalex-snapshot
On saying “Enough already!” in SQL
inferredcites →https://doi.org/10.1145/276304.276319openalex-snapshot
Optimal multi-step k-nearest neighbor search
inferredcites →https://doi.org/10.1145/276304.276326openalex-snapshot
Incremental distance join algorithms for spatial databases
inferredcites →https://doi.org/10.1145/276305.276319openalex-snapshot
Optimal multi-step k-nearest neighbor search
inferredcites →https://doi.org/10.1145/303976.303981openalex-snapshot
Processing and optimization of multiway spatial joins using R-trees
inferredcites →https://doi.org/10.1145/304181.304199openalex-snapshot
Approximate computation of multidimensional aggregates of sparse data using wavelets
inferredcites →https://doi.org/10.1145/304182.304199openalex-snapshot
Approximate computation of multidimensional aggregates of sparse data using wavelets
inferredcites →https://doi.org/10.1145/335191.335412openalex-snapshot
Spatial join selectivity using power laws
inferredcites →https://doi.org/10.1145/335191.335414openalex-snapshot
Closest pair queries in spatial databases
inferredcites →https://doi.org/10.1145/342009.335412openalex-snapshot
Spatial join selectivity using power laws
inferredcites →https://doi.org/10.1145/342009.335414openalex-snapshot
Closest pair queries in spatial databases
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.98743openalex-snapshot
A comparison of spatial query processing techniques for native and parameter spaces
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/6605282openalex-snapshot
Estimating the Selectivity of Spatial Queries Using the 'Correlation' Fractal Dimension
inferredcites →https://doi.org/10.1184/r1/6605588openalex-snapshot
Fast Nearest Neighbor Search in Medical Image Databases
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-04298-5_42openalex-snapshot
A New Plane-Sweep Algorithm for the K-Closest-Pairs Query
inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_41openalex-snapshot
Stepwise Optimization Method for k-CNN Search for Location-Based Service
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/s00778-015-0383-4openalex-snapshot
Efficient $$k$$ k -closest pair queries in general metric spaces
inferred← citeshttps://doi.org/10.1007/s00778-021-00680-7openalex-snapshot
PM-LSH: a fast and accurate in-memory framework for high-dimensional approximate NN and closest pair search
inferred← citeshttps://doi.org/10.1007/s10707-016-0246-1openalex-snapshot
New plane-sweep algorithms for distance-based join queries in spatial databases
inferred← citeshttps://doi.org/10.1007/s10707-017-0309-yopenalex-snapshot
Efficient large-scale distance-based join queries in spatialhadoop
inferred← citeshttps://doi.org/10.1016/j.ins.2024.120732openalex-snapshot
Classic distance join queries using compact data structures
inferred← citeshttps://doi.org/10.1016/j.jss.2017.07.005openalex-snapshot
Efficient query processing on large spatial databases: A performance study
inferred← citeshttps://doi.org/10.1109/access.2020.2985103openalex-snapshot
Cloud-Based K-Closest Pairs Discovery in Dynamic Cyber-Physical-Social Systems
inferred← citeshttps://doi.org/10.1109/csae.2011.5952459openalex-snapshot
Spatial distance join query estimation without data access
inferred← citeshttps://doi.org/10.1109/gcc.2009.16openalex-snapshot
Spatial Queries Evaluation with MapReduce
inferred← citeshttps://doi.org/10.1109/mdm.2016.44openalex-snapshot
K-Closest Pairs Queries in Road Networks
inferred← citeshttps://doi.org/10.1109/tkde.2009.141openalex-snapshot
Performance Comparison of the {\rm R}^{\ast}-Tree and the Quadtree for kNN and Distance Join Queries
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.3390/ijgi7070270openalex-snapshot
Shared Execution Approach to ε-Distance Join Queries in Dynamic Road Networks
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.