A Survey On Efficient Processing Of Similarity Queries Over Neural Embeddings

Abstract

Similarity query is the family of queries based on some similarity metrics. Unlike the traditional database queries which are mostly based on value equality, similarity queries aim to find targets "similar enough to" the given data objects, depending on some similarity metric, e.g., Euclidean distance, cosine similarity and so on. To measure the similarity between data objects, traditional methods normally work on low level or syntax features(e.g., basic visual features on images or bag-of-word features of text), which makes them weak to compute the semantic similarities between objects. So for measuring data similarities semantically, neural embedding is applied. Embedding techniques work by representing the raw data objects as vectors (so called "embeddings" or "neural embeddings" since they are mostly generated by neural network models) that expose the hidden semantics of the raw data, based on which embeddings do show outstanding effectiveness on capturing data similarities, making

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keywang2022a

Related papers

• Evaluating The Impact Of Word Embeddings On Similarity Scoring In Practical Information Retrieval (2026)0.00
• Meta-path Guided Embedding For Similarity Search In Large-scale Heterogeneous Information Networks (2016)0.00
• Rethinking Similarity Search: Embracing Smarter Mechanisms Over Smarter Data (2023)0.00
• VERSE: Versatile Graph Embeddings From Similarity Measures (2018)17.42
• Efficient Optimization Methods For Extreme Similarity Learning With Nonlinear Embeddings (2020)3.58
• Visualizing Deep Similarity Networks (2019)11.85
• Representation Learning For Efficient And Effective Similarity Search And Recommendation (2021)0.00
• Simgnn: A Neural Network Approach To Fast Graph Similarity Computation (2018)0.00