On the public citation graph
Performance Comparison of the {\rm R}^{\ast}-Tree and the Quadtree for kNN and Distance Join Queries
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/11547686_12openalex-snapshot
VA-Files vs. R*-Trees in Distance Join Queries
inferredcites →https://doi.org/10.1007/3-540-38076-0_1openalex-snapshot
Processing Distance-Based Queries in Multidimensional Data Spaces Using R-trees
inferredcites →https://doi.org/10.1007/3-540-57301-1_5openalex-snapshot
Efficient similarity search in sequence databases
inferredcites →https://doi.org/10.1007/978-1-84628-293-5openalex-snapshot
R-Trees: Theory and Applications
inferredcites →https://doi.org/10.1007/bf00962238openalex-snapshot
Efficient and effective Querying by Image Content
inferredcites →https://doi.org/10.1007/bf01231606openalex-snapshot
The TV-tree: An index structure for high-dimensional data
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.1016/j.datak.2003.08.007openalex-snapshot
Algorithms for processing K-closest-pair queries in spatial databases
inferredcites →https://doi.org/10.1016/j.ins.2006.12.012openalex-snapshot
A performance comparison of distance-based query algorithms using R-trees in spatial databases
inferredcites →https://doi.org/10.1093/bioinformatics/bth113openalex-snapshot
Efficient similarity search in protein structure databases by k-clique hashing
inferredcites →https://doi.org/10.1109/icde.1997.582015openalex-snapshot
STR: a simple and efficient algorithm for R-tree packing
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/icde.2001.914837openalex-snapshot
Duality-based subsequence matching in time-series databases
inferredcites →https://doi.org/10.1109/icdm.2002.1183884openalex-snapshot
High performance data mining using the nearest neighbor join
inferredcites →https://doi.org/10.1109/tkde.2003.1245293openalex-snapshot
Adaptive and incremental processing for distance join queries
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.191915openalex-snapshot
Shoring up persistent applications
inferredcites →https://doi.org/10.1145/191843.191915openalex-snapshot
Shoring up persistent applications
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/280277.280279openalex-snapshot
Multidimensional access methods
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/320134.320162openalex-snapshot
Improved bulk-loading algorithms for quadtrees
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.335428openalex-snapshot
Adaptive multi-stage distance join processing
inferredcites →https://doi.org/10.1145/342009.335414openalex-snapshot
Closest pair queries in spatial databases
inferredcites →https://doi.org/10.1145/342009.335428openalex-snapshot
Adaptive multi-stage distance join processing
inferredcites →https://doi.org/10.1145/354756.354832openalex-snapshot
High performance clustering based on the similarity join
inferredcites →https://doi.org/10.1145/356924.356930openalex-snapshot
The Quadtree and Related Hierarchical Data Structures
inferredcites →https://doi.org/10.1145/564691.564755openalex-snapshot
Quadtree and R-tree indexes in oracle spatial
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.1145/971699.318900openalex-snapshot
Direct spatial search on pictorial databases using packed R-trees
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-031-21595-7_15openalex-snapshot
Compact Data Structures for Efficient Processing of Distance-Based Join Queries
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-319-22849-5_4openalex-snapshot
The xBR$$^+$$-tree: An Efficient Access Method for Points
inferred← citeshttps://doi.org/10.1007/978-3-319-28031-8_18openalex-snapshot
Application of Hexagonal Coordinate Systems for Searching the K-NN in 2D Space
inferred← citeshttps://doi.org/10.1007/978-3-642-18381-2_44openalex-snapshot
Join-Queries between Two Spatial Datasets Indexed by a Single R*-Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-23737-9_17openalex-snapshot
Performance Comparison of xBR-trees and R*-trees for Single Dataset Spatial Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-40235-7_11openalex-snapshot
PL-Tree: An Efficient Indexing Method for High-Dimensional Data
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/s10044-015-0527-6openalex-snapshot
A novel supervised cluster adjustment method using a fast exact nearest neighbor search algorithm
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.1016/j.aej.2020.03.045openalex-snapshot
Intelligent traffic analysis: A heuristic high-dimensional image search algorithm based on spatiotemporal probability for constrained environments
inferred← citeshttps://doi.org/10.1016/j.compbiomed.2016.05.006openalex-snapshot
Heterogeneous recurrence analysis of heartbeat dynamics for the identification of sleep apnea events
inferred← citeshttps://doi.org/10.1016/j.compenvurbsys.2013.11.002openalex-snapshot
OPALS – A framework for Airborne Laser Scanning data analysis
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.1016/j.jss.2023.111872openalex-snapshot
Database management system performance comparisons: A systematic literature review
inferred← citeshttps://doi.org/10.1016/j.patcog.2010.01.003openalex-snapshot
Fast exact k nearest neighbors search using an orthogonal search tree
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.012openalex-snapshot
Efficient computation of spatial queries over points stored in k2-tree compact data structures
inferred← citeshttps://doi.org/10.1080/24725854.2022.2148779openalex-snapshot
Virtual sensing network for statistical process monitoring
inferred← citeshttps://doi.org/10.1088/1742-6596/1646/1/012047openalex-snapshot
Research on KNN Algorithm of Charging Device Based on Attack Recognition Method
inferred← citeshttps://doi.org/10.1109/coase.2015.7294240openalex-snapshot
Heterogeneous recurrence T2 charts for monitoring and control of nonlinear dynamic processes
inferred← citeshttps://doi.org/10.1109/ic3.2014.6897170openalex-snapshot
GPU based geometric hashing for space partioning
inferred← citeshttps://doi.org/10.1109/icds47004.2019.8942360openalex-snapshot
Determining Spatial Co-Location Graph Influencing Factors using Mobile Applications Data
inferred← citeshttps://doi.org/10.1109/icpca.2011.6106536openalex-snapshot
A Hybrid Spatial-Temporal Index for location based service
inferred← citeshttps://doi.org/10.1109/ijcnn.2011.6033373openalex-snapshot
A fast exact k-nearest neighbors algorithm for high dimensional search using k-means clustering and triangle inequality
inferred← citeshttps://doi.org/10.1109/pci.2011.22openalex-snapshot
Nearest Neighbor Algorithms Using xBR-Trees
inferred← citeshttps://doi.org/10.1109/tase.2021.3052483openalex-snapshot
Constrained Markov Decision Process Modeling for Optimal Sensing of Cardiac Events in Mobile Health
inferred← citeshttps://doi.org/10.1140/epjb/e2016-60850-yopenalex-snapshot
Heterogeneous recurrence representation and quantification of dynamic transitions in continuous nonlinear processes
inferred← citeshttps://doi.org/10.1145/2490428.2490462openalex-snapshot
Cache based approach for improving location based query processing in mobile environment
inferred← citeshttps://doi.org/10.3233/jifs-169516openalex-snapshot
Indexing and searching point clouds
inferred← citeshttps://doi.org/10.3390/ijgi14050193openalex-snapshot
PixelQuery: Efficient Distance Range Join Query Technique for Visualization Analysis
inferred← citeshttps://doi.org/10.3390/ijgi2041038openalex-snapshot
Georeferenced Point Clouds: A Survey of Features and Point Cloud Management
inferred← citeshttps://doi.org/10.5194/isprsannals-i-3-153-2012openalex-snapshot
THE OPALS DATA MANAGER – EFFICIENT DATA MANAGEMENT FOR PROCESSING LARGE AIRBORNE LASER SCANNING PROJECTS
inferred← citeshttps://doi.org/10.5220/0004952603750382openalex-snapshot
Database Design of a Geo-environmental Information System
inferred← citeshttps://doi.org/10.5626/jok.2015.42.3.390openalex-snapshot
An Efficient Retrieval Technique for Spatial Web Objects
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.