On the public citation graph

Indexing high-dimensional data for efficient in-memory similarity search

0 signed · 58 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.
Claim with ORCID
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.
See reference health

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/978-1-4757-1904-8openalex-snapshot
Principal Component Analysis
inferredcites →https://doi.org/10.1007/bf01231606openalex-snapshot
The TV-tree: An index structure for high-dimensional data
inferredcites →https://doi.org/10.1080/00401706.1988.10488412openalex-snapshot
Principal Component Analysis
inferredcites →https://doi.org/10.1109/69.991715openalex-snapshot
Fast indexing and visualization of metric data sets using slim-trees
inferredcites →https://doi.org/10.1109/icde.2001.914877openalex-snapshot
Similarity search without tears: the OMNI-family of all-purpose access methods
inferredcites →https://doi.org/10.1109/icde.2003.1260784openalex-snapshot
An adaptive and efficient dimensionality reduction algorithm for high-dimensional indexing
inferredcites →https://doi.org/10.1109/tkde.2004.1318568openalex-snapshot
Main Memory Indexing: The Case for BD-Tree
inferredcites →https://doi.org/10.1145/253260.253345openalex-snapshot
Distance-based indexing for high-dimensional metric spaces
inferredcites →https://doi.org/10.1145/253262.253345openalex-snapshot
Distance-based indexing for high-dimensional metric spaces
inferredcites →https://doi.org/10.1145/276304.276318openalex-snapshot
The pyramid-technique
inferredcites →https://doi.org/10.1145/276305.276318openalex-snapshot
The pyramid-technique
inferredcites →https://doi.org/10.1145/335191.335449openalex-snapshot
Making B+- trees cache conscious in main memory
inferredcites →https://doi.org/10.1145/342009.335449openalex-snapshot
Making B+- trees cache conscious in main memory
inferredcites →https://doi.org/10.1145/375663.375679openalex-snapshot
Optimizing multidimensional index trees for main memory access
inferredcites →https://doi.org/10.1145/375663.375681openalex-snapshot
Main-memory index structures with fixed-size partial keys
inferredcites →https://doi.org/10.1145/375663.375688openalex-snapshot
Improving index performance through prefetching
inferredcites →https://doi.org/10.1145/376284.375679openalex-snapshot
Optimizing multidimensional index trees for main memory access
inferredcites →https://doi.org/10.1145/376284.375681openalex-snapshot
Main-memory index structures with fixed-size partial keys
inferredcites →https://doi.org/10.1145/376284.375688openalex-snapshot
Improving index performance through prefetching
inferredcites →https://doi.org/10.1145/502807.502809openalex-snapshot
Searching in high-dimensional spaces
inferredcites →https://doi.org/10.1145/872757.872815openalex-snapshot
Contorting high dimensional data for efficient main memory KNN processing
inferredcites →https://doi.org/10.56021/9781421407944openalex-snapshot
Matrix Computations

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-1-4614-8265-9_804openalex-snapshot
High-Dimensional Indexing
inferred← citeshttps://doi.org/10.1007/978-1-4899-7993-3_804-2openalex-snapshot
High-Dimensional Indexing
inferred← citeshttps://doi.org/10.1007/s00778-022-00729-1openalex-snapshot
Fast, exact, and parallel-friendly outlier detection algorithms with proximity graph in metric spaces
inferred← citeshttps://doi.org/10.1007/s10115-008-0190-yopenalex-snapshot
Effectiveness of NAQ-tree as index structure for similarity search in high-dimensional metric space
inferred← citeshttps://doi.org/10.1007/s11280-016-0392-2openalex-snapshot
Multiple k nearest neighbor search
inferred← citeshttps://doi.org/10.1007/s11280-023-01204-9openalex-snapshot
Efficient continuous kNN join over dynamic high-dimensional data
inferred← citeshttps://doi.org/10.1016/b978-0-32-390796-5.00017-6openalex-snapshot
Database parallelism, big data and analytics, deep learning
inferred← citeshttps://doi.org/10.1016/b978-0-32-390796-5.00023-1openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.eswa.2010.02.141openalex-snapshot
Effectiveness of optimal incremental multi-step nearest neighbor search
inferred← citeshttps://doi.org/10.1016/j.is.2010.05.001openalex-snapshot
Indexing high-dimensional data for main-memory similarity search
inferred← citeshttps://doi.org/10.1016/j.mcm.2006.12.035openalex-snapshot
Generalizing the k -Windows clustering algorithm in metric spaces
inferred← citeshttps://doi.org/10.1088/1361-6501/adead1openalex-snapshot
A data-driven method for IGBT open-circuit fault diagnosis of NPC inverters in three-phase photovoltaic grid-connected systems
inferred← citeshttps://doi.org/10.1093/comjnl/bxl022openalex-snapshot
The Stepwise Dimensionality Increasing (SDI) Index for High-Dimensional Data
inferred← citeshttps://doi.org/10.1093/comjnl/bxl035openalex-snapshot
Persistent Semi-Dynamic Ordered Partition Index
inferred← citeshttps://doi.org/10.1109/bdcat63179.2024.00044openalex-snapshot
Magellan: Enabling Effective Search Over Voluminous, High-dimensional Scientific Datasets
inferred← citeshttps://doi.org/10.1109/ictai.2008.25openalex-snapshot
Quantized Indexing Tree for Frequent Updates over Data Streams
inferred← citeshttps://doi.org/10.1109/is.2008.4670504openalex-snapshot
Novel approach for nearest neighbor search in high dimensional space
inferred← citeshttps://doi.org/10.1109/ssdbm.2007.9openalex-snapshot
CSR+-tree: Cache-conscious Indexing for High-dimensional Similarity Search
inferred← citeshttps://doi.org/10.1109/tkde.2009.171openalex-snapshot
Adaptive Subspace Symbolization for Content-Based Video Detection
inferred← citeshttps://doi.org/10.1109/tkde.2014.5openalex-snapshot
\(\mathsf{B}^{p}\) - \(\mathsf{Tree}\) : A Predictive \(\mathsf{B}^{+}\) - \(\mathsf{Tree}\) for Reducing Writes on Phase Change Memory
inferred← citeshttps://doi.org/10.1145/1071610.1071612openalex-snapshot
iDistance
inferred← citeshttps://doi.org/10.1145/2020408.2020607openalex-snapshot
Scalable kNN search on vertically stored time series
inferred← citeshttps://doi.org/10.1145/2348283.2348294openalex-snapshot
Boosting multi-kernel locality-sensitive hashing for scalable image retrieval
inferred← citeshttps://doi.org/10.1145/3588715openalex-snapshot
LiteHST: A Tree Embedding based Method for Similarity Search
inferred← citeshttps://doi.org/10.1145/3736716openalex-snapshot
Graph Based K-Nearest Neighbor Search Revisited
inferred← citeshttps://doi.org/10.1186/s40537-024-00973-yopenalex-snapshot
Enhancing K-nearest neighbor algorithm: a comprehensive review and performance analysis of modifications
inferred← citeshttps://doi.org/10.14778/2350229.2350255openalex-snapshot
Publishing microdata with a robust privacy guarantee
inferred← citeshttps://doi.org/10.14778/2850583.2850589openalex-snapshot
Neighbor-sensitive hashing
inferred← citeshttps://doi.org/10.32657/10356/61755openalex-snapshot
Learning with multiple kernels : algorithms and applications
inferred← citeshttps://doi.org/10.3390/ijgi8030151openalex-snapshot
Finding Visible kNN Objects in the Presence of Obstacles within the User’s View Field †
inferred← citeshttps://doi.org/10.3390/s23020629openalex-snapshot
Survey on Exact kNN Queries over High-Dimensional Data Space
inferred← citeshttps://doi.org/10.4018/978-1-60566-174-2.ch006openalex-snapshot
Content-Based Image Retrieval
inferred← citeshttps://doi.org/10.4018/ijoci.2016070103openalex-snapshot
RSSMSO Rapid Similarity Search on Metric Space Object Stored in Cloud Environment
inferred← citeshttps://doi.org/10.4304/jsw.6.12.2521-2527openalex-snapshot
Improvement of Filtering Algorithm for RFID Middleware Using KDB-tree Query Index
inferred← citeshttps://doi.org/10.7763/ijeeee.2013.v3.279openalex-snapshot
Processing Multiple k Nearest Neighbor Queries
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.