PM-LSH: a fast and accurate in-memory framework for high-dimensional approximate NN and closest pair search
- 3 July 2021
- journal article
- research article
- Published by Springer Nature in The VLDB Journal
- Vol. 31 (6) , 1339-1363
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (61902134, 62011530437)
- Natural Science Foundation of Hubei Province (2020CFB871)
- Fundamental Research Funds for the Central Universities (HUST: 2019kfyXJJS091, HUST: 2019kfyXKJC021)
This publication has 41 references indexed in Scilit:
- Quicker Similarity Joins in Metric Spaces2013
- The k closest pairs in spatial databasesGeoInformatica, 2012
- Efficient and accurate nearest neighbor and closest pair search in high-dimensional spaceACM Transactions on Database Systems, 2010
- Exact Discovery of Time Series Motifs2009
- Solving similarity joins and range queries in metric spaces with the list of twin clustersJournal of Discrete Algorithms, 2009
- An approximate algorithm for top-k closest pairs join query in large high dimensional dataData & Knowledge Engineering, 2005
- Algorithms for processing K-closest-pair queries in spatial databasesData & Knowledge Engineering, 2004
- Closest pair queries in spatial databasesACM SIGMOD Record, 2000
- Incremental distance join algorithms for spatial databasesACM SIGMOD Record, 1998
- The R*-tree: an efficient and robust access method for points and rectanglesACM SIGMOD Record, 1990