Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search

Summary: FLASH: CPU-GPU accelerated LSH-style similarity search for ultra-high dimensional data on a single node. Fuses reservoir sampling, minwise hashing, and count-based estimations with HPC optimizations to cut compute, delivering sub-10s full k-NN on webspam. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 5633
Venue: SIGMOD
Year: 2018
Pagerank: 5.6643589e-05
Overall Rank: 7,240 | 50.33%
DOI: 10.1145/3183713.3196925

Incoming Non-self Citations Over Time

Authors

1. Yiqiu Wang (Rice University)
2. Anshumali Shrivastava (Rice University)
3. Jonathan Wang (Rice University)
4. Junghee Ryu (Rice University)

BibTeX Citation

@inproceedings{wang_sigmod18,
        title = {{Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search}},
        author = {Wang, Yiqiu and Shrivastava, Anshumali and Wang, Jonathan and Ryu, Junghee},
        series = {{SIGMOD} '18},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3183713.3196925},
        url = {https://dl.acm.org/doi/10.1145/3183713.3196925},
        year = {2018}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
3,279	Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring	2020	SIGMOD	7.5711218e-05
10,393	Query-Aware Path Inference from Spatial Videos	2026	SIGMOD	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
46	A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces	1998	VLDB	0.00044853085
287	Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search	2007	VLDB	0.00022323585
369	Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting	2012	SIGMOD	0.00019945234
2,390	Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing	2013	VLDB	8.6438351e-05
3,721	Database-friendly Random Projections	2001	PODS	7.1736703e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	580	SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index	2015	VLDB
2	287	Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search	2007	VLDB
3	2,519	Similarity search in the blink of an eye with compressed indices	2023	VLDB
4	6,597	Similarity Search and Locality Sensitive Hashing using Ternary Content Addressable Memories	2010	SIGMOD
5	10,227	Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search	2026	SIGMOD
6	2,673	DSH: Data Sensitive Hashing for High-Dimensional k-NN Search	2014	SIGMOD
7	2,390	Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing	2013	VLDB
8	21	Similarity Search in High Dimensions via Hashing	1999	VLDB
9	10,456	FlashANNS: GPU-Driven Asynchronous I/O Pipelining for Eliminating Storage-Compute Bottlenecks in Billion-Scale Similarity Search	2026	SIGMOD
10	7,166	Accelerating Graph Indexing for ANNS on Modern CPUs	2025	SIGMOD