2022 IEEE International Conference on Big Data (Big Data) 2022
DOI: 10.1109/bigdata55660.2022.10020276
|View full text |Cite
|
Sign up to set email alerts
|

Role-Oriented Dynamic Network Embedding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 42 publications
0
1
0
Order By: Relevance
“…These benchmarks demonstrate the substantial performance gains provided by FAISS, particularly when dealing with large-scale datasets.If I/O efficiency is the priority during the indexing process, DISK-ANN is an algorithm to look out for. DiskANN, and its improved version LM-DiskANN[25], are graph-based Approximate Nearest Neighbour (ANN) search algorithms designed to handle extremely large datasets that cannot fit entirely in memory. Unlike traditional graph-based indexes that reside solely in memory, DiskANN leverages disk storage for storing the index structure, loading portions into memory on-demand during search.…”
mentioning
confidence: 99%
“…These benchmarks demonstrate the substantial performance gains provided by FAISS, particularly when dealing with large-scale datasets.If I/O efficiency is the priority during the indexing process, DISK-ANN is an algorithm to look out for. DiskANN, and its improved version LM-DiskANN[25], are graph-based Approximate Nearest Neighbour (ANN) search algorithms designed to handle extremely large datasets that cannot fit entirely in memory. Unlike traditional graph-based indexes that reside solely in memory, DiskANN leverages disk storage for storing the index structure, loading portions into memory on-demand during search.…”
mentioning
confidence: 99%