On the public citation graph
An efficient cost model for optimization of nearest neighbor search in low and medium dimensional spaces
0 signed · 112 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-44503-x_28openalex-snapshot
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
inferredcites →https://doi.org/10.1007/3-540-46439-5_3openalex-snapshot
Dynamically Optimizing High-Dimensional Index Structures
inferredcites →https://doi.org/10.1007/3-540-47724-1_14openalex-snapshot
Constrained Nearest Neighbor Queries
inferredcites →https://doi.org/10.1007/3-540-49257-7_15openalex-snapshot
When Is “Nearest Neighbor” Meaningful?
inferredcites →https://doi.org/10.1007/3-540-62222-5_59openalex-snapshot
Performance of nearest neighbor queries in R-trees
inferredcites →https://doi.org/10.1007/bf01759061openalex-snapshot
Refinements to nearest-neighbor searching ink-dimensional trees
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/b978-155860869-6/50044-5openalex-snapshot
Adaptive Index Structures
inferredcites →https://doi.org/10.1109/69.908983openalex-snapshot
On the "dimensionality curse" and the "self-similarity blessing"
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.2000.839457openalex-snapshot
Deflating the dimensionality curse using multiple fractal dimensions
inferredcites →https://doi.org/10.1145/182591.182593openalex-snapshot
Beyond uniformity and independence
inferredcites →https://doi.org/10.1145/191839.191925openalex-snapshot
Fast subsequence matching in time-series databases
inferredcites →https://doi.org/10.1145/191843.191925openalex-snapshot
Fast subsequence matching in time-series databases
inferredcites →https://doi.org/10.1145/220279.220315openalex-snapshot
Accounting for boundary effects in nearest neighbor searching
inferredcites →https://doi.org/10.1145/237661.237705openalex-snapshot
A model for the prediction of R-tree performance
inferredcites →https://doi.org/10.1145/263661.263671openalex-snapshot
A cost model for nearest neighbor search in high-dimensional data space
inferredcites →https://doi.org/10.1145/275487.275495openalex-snapshot
A cost model for similarity queries in metric spaces
inferredcites →https://doi.org/10.1145/276304.276344openalex-snapshot
Wavelet-based histograms for selectivity estimation
inferredcites →https://doi.org/10.1145/276305.276344openalex-snapshot
Wavelet-based histograms for selectivity estimation
inferredcites →https://doi.org/10.1145/304181.304184openalex-snapshot
Selectivity estimation in spatial databases
inferredcites →https://doi.org/10.1145/304181.304200openalex-snapshot
Multi-dimensional selectivity estimation using compressed histogram information
inferredcites →https://doi.org/10.1145/304182.304184openalex-snapshot
Selectivity estimation in 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.335448openalex-snapshot
Approximating multi-dimensional aggregate range queries over real attributes
inferredcites →https://doi.org/10.1145/342009.335414openalex-snapshot
Closest pair queries in spatial databases
inferredcites →https://doi.org/10.1145/342009.335448openalex-snapshot
Approximating multi-dimensional aggregate range queries over real attributes
inferredcites →https://doi.org/10.1145/355744.355745openalex-snapshot
An Algorithm for Finding Best Matches in Logarithmic Expected Time
inferredcites →https://doi.org/10.1145/355826.355832openalex-snapshot
Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space
inferredcites →https://doi.org/10.1145/357775.357776openalex-snapshot
A cost model for query processing in high dimensional data spaces
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
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.4426openalex-snapshot
Context‐aware search optimization framework on the internet of things
inferred← citeshttps://doi.org/10.1007/0-387-27544-4_4openalex-snapshot
Analysis of Nearest Neighbor Queries
inferred← citeshttps://doi.org/10.1007/11424918_14openalex-snapshot
A Comparative Study of Two Density-Based Spatial Clustering Algorithms for Very Large Datasets
inferred← citeshttps://doi.org/10.1007/11535331_16openalex-snapshot
On Trip Planning Queries in Spatial Databases
inferred← citeshttps://doi.org/10.1007/11535331_23openalex-snapshot
Probabilistic Spatial Queries on Existentially Uncertain Data
inferred← citeshttps://doi.org/10.1007/11546849_24openalex-snapshot
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
inferred← citeshttps://doi.org/10.1007/978-3-319-17885-1_610openalex-snapshot
Indexing of Moving Objects, Bx-Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-72524-4_56openalex-snapshot
Efficient Difference NN Queries for Moving Objects
inferred← citeshttps://doi.org/10.1007/978-3-642-12098-5_1openalex-snapshot
$\textrm{B}^s$ -tree: A Self-tuning Index of Moving Objects
inferred← citeshttps://doi.org/10.1007/978-3-642-25646-2_25openalex-snapshot
An Efficient Path Planning Method Based on State Automata Model for Mobile Robots
inferred← citeshttps://doi.org/10.1007/978-3-642-40235-7_23openalex-snapshot
Cost Models for Nearest Neighbor Query Processing over Existentially Uncertain Spatial Data
inferred← citeshttps://doi.org/10.1007/s00778-006-0038-6openalex-snapshot
The optimal sequenced route query
inferred← citeshttps://doi.org/10.1007/s00778-009-0163-0openalex-snapshot
Analysis and evaluation of V*-kNN: an efficient algorithm for moving kNN queries
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-015-0400-7openalex-snapshot
Geo-Social Ranking: functions and query processing
inferred← citeshttps://doi.org/10.1007/s10619-017-7194-0openalex-snapshot
M-Grid: a distributed framework for multidimensional indexing and querying of location based data
inferred← citeshttps://doi.org/10.1007/s10707-006-0341-9openalex-snapshot
Indexing Fast Moving Objects for kNN Queries Based on Nearest Landmarks
inferred← citeshttps://doi.org/10.1007/s10707-008-0055-2openalex-snapshot
Web data retrieval: solving spatial range queries using k-nearest neighbor searches
inferred← citeshttps://doi.org/10.1007/s10707-016-0245-2openalex-snapshot
The direction-constrained k nearest neighbor query
inferred← citeshttps://doi.org/10.1007/s11280-015-0351-3openalex-snapshot
Efficient moving k nearest neighbor queries over line segment objects
inferred← citeshttps://doi.org/10.1007/s11390-008-9185-0openalex-snapshot
Adaptive Indexing of Moving Objects with Highly Variable Update Frequencies
inferred← citeshttps://doi.org/10.1016/b978-012088469-8.50068-1openalex-snapshot
+Query and Update Efficient B-Tree Based Indexing of Moving Objects
inferred← citeshttps://doi.org/10.1016/j.datak.2005.03.004openalex-snapshot
Cost models for distance joins queries using R-trees
inferred← citeshttps://doi.org/10.1016/j.datak.2005.07.008openalex-snapshot
IMPACT: A twin-index framework for efficient moving object query processing
inferred← citeshttps://doi.org/10.1016/j.datak.2006.08.013openalex-snapshot
Genetic algorithms for approximate similarity queries
inferred← citeshttps://doi.org/10.1016/j.datak.2008.03.004openalex-snapshot
A privacy preserving technique for distance-based classification with worst case privacy guarantees
inferred← citeshttps://doi.org/10.1016/j.datak.2011.06.003openalex-snapshot
On multi-type reverse nearest neighbor search
inferred← citeshttps://doi.org/10.1016/j.datak.2017.09.003openalex-snapshot
The Merkurion approach for similarity searching optimization in Database Management Systems
inferred← citeshttps://doi.org/10.1016/j.dss.2011.05.006openalex-snapshot
Efficient construction of histograms for multidimensional data using quad-trees
inferred← citeshttps://doi.org/10.1016/j.ins.2012.03.001openalex-snapshot
Spatial indexing for massively update intensive applications
inferred← citeshttps://doi.org/10.1016/j.is.2010.05.004openalex-snapshot
Optimized algorithms for predictive range and KNN queries on moving objects
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.07.007openalex-snapshot
Peer-to-peer bichromatic reverse nearest neighbours in mobile ad-hoc networks
inferred← citeshttps://doi.org/10.1080/00207179.2012.762121openalex-snapshot
Approximate model predictive control laws for constrained nonlinear discrete-time systems: analysis and offline design
inferred← citeshttps://doi.org/10.1109/bigdata.2015.7363948openalex-snapshot
Indexing historical spatio-temporal data in the cloud
inferred← citeshttps://doi.org/10.1109/icde.2007.367884openalex-snapshot
Clustering wavelets to speed-up data dissemination in structured P2P MANETs
inferred← citeshttps://doi.org/10.1109/icpads.2013.34openalex-snapshot
Peer-to-Peer Group k-Nearest Neighbours in Mobile Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1109/mdm.2014.37openalex-snapshot
ToSS-it: A Cloud-Based Throwaway Spatial Index Structure for Dynamic Location Data
inferred← citeshttps://doi.org/10.1109/mdm.2016.46openalex-snapshot
D-Grid: An In-Memory Dual Space Grid Index for Moving Object Databases
inferred← citeshttps://doi.org/10.1109/pci.2008.36openalex-snapshot
Cost Models and Efficient Algorithms on Existentially Uncertain Spatial Data
inferred← citeshttps://doi.org/10.1109/tasl.2008.925883openalex-snapshot
Analysis of Minimum Distances in High-Dimensional Musical Spaces
inferred← citeshttps://doi.org/10.1109/tkde.2008.164openalex-snapshot
On the Effect of Location Uncertainty in Spatial Querying
inferred← citeshttps://doi.org/10.1109/tkde.2008.225openalex-snapshot
Managing Frequent Updates in R-Trees for Update-Intensive Applications
inferred← citeshttps://doi.org/10.1109/tkde.2011.172openalex-snapshot
Joint Top-K Spatial Keyword Query Processing
inferred← citeshttps://doi.org/10.1109/tkde.2016.2572697openalex-snapshot
D-ToSS: A Distributed Throwaway Spatial Index Structure for Dynamic Location Data
inferred← citeshttps://doi.org/10.1145/1071610.1071616openalex-snapshot
Aggregate nearest neighbor queries in spatial databases
inferred← citeshttps://doi.org/10.1145/1097064.1097092openalex-snapshot
Two ellipse-based pruning methods for group nearest neighbor queries
inferred← citeshttps://doi.org/10.1145/1806907.1806909openalex-snapshot
Continuous online index tuning in moving object databases
inferred← citeshttps://doi.org/10.1145/1807167.1807232openalex-snapshot
Indexing multi-dimensional data in a cloud system
inferred← citeshttps://doi.org/10.1145/1966385.1966388openalex-snapshot
Design and analysis of a ranking approach to private location-based services
inferred← citeshttps://doi.org/10.1145/2576232openalex-snapshot
Efficient Algorithms and Cost Models for Reverse Spatial-Keyword k -Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/2723372.2749450openalex-snapshot
Real-Time Multi-Criteria Social Graph Partitioning
inferred← citeshttps://doi.org/10.1145/2820783.2820815openalex-snapshot
Spatial queries with k-nearest-neighbor and relational predicates
inferred← citeshttps://doi.org/10.1145/3555811openalex-snapshot
A Query Optimizer for Range Queries over Multi-Attribute Trajectories
inferred← citeshttps://doi.org/10.14778/1687627.1687761openalex-snapshot
Workload-aware indexing of continuously moving objects
inferred← citeshttps://doi.org/10.14778/2047485.2047489openalex-snapshot
A moving-object index for efficient query processing with peer-wise location privacy
inferred← citeshttps://doi.org/10.14778/3551793.3551810openalex-snapshot
Interactive mining with ordered and unordered attributes
inferred← citeshttps://doi.org/10.1541/ieejeiss.131.1377openalex-snapshot
Construction-and-extraction Based Index for Images Retrieval
inferred← citeshttps://doi.org/10.17192/z2007.0676openalex-snapshot
Advanced Indexing und Query Processing für MultidimensionaleDatenbanken
inferred← citeshttps://doi.org/10.21936/si2007_v28.n4.542openalex-snapshot
Modele kosztowe dla indeksu STCAT
inferred← citeshttps://doi.org/10.21936/si2009_v30.n3b.435openalex-snapshot
Zaawansowane hurtownie danych
inferred← citeshttps://doi.org/10.2200/s00394ed1v01y201111dtm021openalex-snapshot
Spatial Data Management
inferred← citeshttps://doi.org/10.25549/usctheses-c40-198621openalex-snapshot
Partitioning, Indexing and Querying Spatial Data on Cloud
inferred← citeshttps://doi.org/10.25904/1912/931openalex-snapshot
Indexing Multidimensional Point Data
inferred← citeshttps://doi.org/10.3390/ijgi11070392openalex-snapshot
General Data Search Algorithms for Earth Simulation Systems with Cyclic Boundaries
inferred← citeshttps://doi.org/10.3390/math12132032openalex-snapshot
FurMoLi: A Future Query Technique for Moving Objects Based on a Learned Index
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2008.01401openalex-snapshot
Cluster Splitting Based High Dimensional Metric Space Index B+-Tree
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2010.01359openalex-snapshot
A Continuous Nearest Neighbor Query Method for Uncertain Data in Obstructed Spaces
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.403-408.3315openalex-snapshot
Optimized Cost Model for k-NN Queries in R*-Trees over Random Distribution
inferred← citeshttps://doi.org/10.5120/7716-0954openalex-snapshot
Reachable Nearest Neighbour Query Processing of R-Trees for Moving Query Object
inferred← citeshttps://doi.org/10.5441/002/edbt.2015.40openalex-snapshot
Cost Estimation of Spatial k-Nearest-Neighbor Operators
inferred← citeshttps://doi.org/10.5441/002/edbt.2015.43openalex-snapshot
K-Nearest Neighbor Temporal Aggregate Queries
inferred← citeshttps://doi.org/10.5815/ijieeb.2016.03.08openalex-snapshot
Metadata Management System for E-learning Objects using Cloud
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.