Distributed processing of similarity queries
From MaRDI portal
Recommendations
Cited in
(11)- Parallel query processing on distributed clustering indexes
- Approximate similarity search: a multi-faceted problem
- PROM: efficient matching query processing on high-dimensional data
- Approximated trial and error analysis in scientific databases.
- An efficient index structure for distributed \(k\)-nearest neighbours query processing
- Fast filtering false active subspaces for efficient high dimensional similarity processing
- scientific article; zbMATH DE number 1223034 (Why is no real title available?)
- scientific article; zbMATH DE number 1953852 (Why is no real title available?)
- Adaptable similarity search using vector quantization
- String Processing and Information Retrieval
- Sync/Async parallel search for the efficient design and construction of web search engines
This page was built for publication: Distributed processing of similarity queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4792544)