2022
DOI: 10.1109/access.2022.3182802
|View full text |Cite
|
Sign up to set email alerts
|

LayerLSH: Rebuilding Locality-Sensitive Hashing Indices by Exploring Density of Hash Values

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 40 publications
0
1
0
Order By: Relevance
“…In addition to using a Log‐Structured Merge (LSM) tree, KVRangeDB, 19 on the other hand, reduces compaction I/O and merges keys to optimize performance, which is essential for managing large data sets. LayerLSH 20 improves the scalability and accuracy of LSH by partitioning data points into multiple layers and applying different LSH functions to each layer, which is useful for high‐dimensional data. The new hash index structure minimizes the number of write operations required by traditional hash index structures, making it well‐suited for flash‐based storage systems 21 .…”
Section: Related Workmentioning
confidence: 99%
“…In addition to using a Log‐Structured Merge (LSM) tree, KVRangeDB, 19 on the other hand, reduces compaction I/O and merges keys to optimize performance, which is essential for managing large data sets. LayerLSH 20 improves the scalability and accuracy of LSH by partitioning data points into multiple layers and applying different LSH functions to each layer, which is useful for high‐dimensional data. The new hash index structure minimizes the number of write operations required by traditional hash index structures, making it well‐suited for flash‐based storage systems 21 .…”
Section: Related Workmentioning
confidence: 99%