On the public citation graph
A novel approach for high‐dimensional vector similarity join query
0 signed · 38 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/pl00011669openalex-snapshot
Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases
inferredcites →https://doi.org/10.1109/69.842246openalex-snapshot
High dimensional similarity joins: algorithms and performance evaluation
inferredcites →https://doi.org/10.1109/clustr.2009.5289178openalex-snapshot
SJMR: Parallelizing spatial join with MapReduce on clusters
inferredcites →https://doi.org/10.1109/icde.1997.581814openalex-snapshot
High-dimensional similarity joins
inferredcites →https://doi.org/10.1109/icde.2006.9openalex-snapshot
A Primitive Operator for Similarity Joins in Data Cleaning
inferredcites →https://doi.org/10.1109/icde.2012.87openalex-snapshot
Parallel Top-K Similarity Join Algorithms Using MapReduce
inferredcites →https://doi.org/10.1109/icde.2014.6816701openalex-snapshot
PHiDJ: Parallel similarity self-join for high-dimensional vector data with MapReduce
inferredcites →https://doi.org/10.1109/mdm.2012.25openalex-snapshot
Efficient Similarity Joins on Massive High-Dimensional Datasets Using MapReduce
inferredcites →https://doi.org/10.1109/tkde.2012.195openalex-snapshot
Efficient and Scalable Processing of String Similarity Join
inferredcites →https://doi.org/10.1145/1071246.1071259openalex-snapshot
Efficient trajectory joins using symbolic representations
inferredcites →https://doi.org/10.1145/1242572.1242591openalex-snapshot
Scaling up all pairs similarity search
inferredcites →https://doi.org/10.1145/1366102.1366104openalex-snapshot
Metric space similarity joins
inferredcites →https://doi.org/10.1145/1571941.1571970openalex-snapshot
Brute force and indexed approaches to pairwise document similarity comparisons with MapReduce
inferredcites →https://doi.org/10.1145/1807167.1807222openalex-snapshot
Efficient parallel set-similarity joins using MapReduce
inferredcites →https://doi.org/10.1145/1929934.1929935openalex-snapshot
Output privacy in data mining
inferredcites →https://doi.org/10.1145/2000824.2000825openalex-snapshot
Efficient similarity joins for near-duplicate detection
inferredcites →https://doi.org/10.1145/2247596.2247602openalex-snapshot
Efficient parallel kNN joins for large data in MapReduce
inferredcites →https://doi.org/10.1145/882082.882086openalex-snapshot
A symbolic representation of time series, with implications for streaming algorithms
inferredcites →https://doi.org/10.14778/2336664.2336674openalex-snapshot
Efficient processing of k nearest neighbor joins using MapReduce
inferredcites →https://doi.org/10.3115/1557690.1557767openalex-snapshot
Pairwise document similarity in large collections with MapReduce
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.1016/j.is.2019.06.006openalex-snapshot
Pivot-based approximate k-NN similarity joins for big high-dimensional data
inferred← citeshttps://doi.org/10.1109/access.2020.3007028openalex-snapshot
Projection Based Large Scale High-Dimensional Data Similarity Join Using MapReduce Framework
inferred← citeshttps://doi.org/10.1145/3299869.3319859openalex-snapshot
Cache-oblivious High-performance Similarity Join
inferred← citeshttps://doi.org/10.1145/3357384.3357863openalex-snapshot
Efficient Join Processing Over Incomplete Data Streams
inferred← citeshttps://doi.org/10.1145/3654953openalex-snapshot
Low-Latency Adaptive Distributed Stream Join System Based on a Flexible Join Model
inferred← citeshttps://doi.org/10.1155/2022/1249393openalex-snapshot
k Nearest Neighbor Similarity Join Algorithm on High-Dimensional Data Using Novel Partitioning Strategy
inferred← citeshttps://doi.org/10.14778/3231751.3231760openalex-snapshot
Set similarity joins on mapreduce
inferred← citeshttps://doi.org/10.14778/3827998.3828008openalex-snapshot
TEngineDB-V: An OLAP-Native Vector Search System for Large- k Workloads at Tencent
inferred← citeshttps://doi.org/10.48550/arxiv.2103.01888openalex-snapshot
DM algorithms in health industry
inferred← citeshttps://doi.org/10.48550/arxiv.2104.09395openalex-snapshot
Algoritmos de minería de datos en la industria sanitaria
inferred← citeshttps://doi.org/10.48550/arxiv.2111.08344openalex-snapshot
Mathematical Models for Local Sensing Hashes
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.