Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908448829997056 |
|---|---|
| author | de Almeida, Filipe Miguel Gonçalves Carey, CJ Fichtenberger, Hendrik Halcrow, Jonathan Lattanzi, Silvio Linhares, André Meng, Tao Norouzi-Fard, Ashkan Parotsidis, Nikos Perozzi, Bryan Simcha, David |
| author_facet | de Almeida, Filipe Miguel Gonçalves Carey, CJ Fichtenberger, Hendrik Halcrow, Jonathan Lattanzi, Silvio Linhares, André Meng, Tao Norouzi-Fard, Ashkan Parotsidis, Nikos Perozzi, Bryan Simcha, David |
| contents | Learning and constructing large-scale graphs has attracted attention in recent decades, resulting in a rich literature that introduced various systems, tools, and algorithms. Grale is one of such tools that is designed for offline environments and is deployed in more than 50 different industrial settings at Google. Grale is widely applicable because of its ability to efficiently learn and construct a graph on datasets with multiple types of features. However, it is often the case that applications require the underlying data to evolve continuously and rapidly and the updated graph needs to be available with low latency. Such setting make the use of Grale prohibitive. While there are Approximate Nearest Neighbor (ANN) systems that handle dynamic updates with low latency, they are mostly limited to similarities over a single embedding.
In this work, we introduce a system that inherits the advantages and the quality of Grale, and maintains a graph construction in a dynamic setting with tens of milliseconds of latency per request. We call the system Dynamic Grale Using ScaNN (Dynamic GUS). Our system has a wide range of applications with over 10 deployments at Google. One of the applications is in Android Security and Privacy, where Dynamic Grale Using ScaNN enables capturing harmful applications 4 times faster, before they can reach users. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_10139 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality de Almeida, Filipe Miguel Gonçalves Carey, CJ Fichtenberger, Hendrik Halcrow, Jonathan Lattanzi, Silvio Linhares, André Meng, Tao Norouzi-Fard, Ashkan Parotsidis, Nikos Perozzi, Bryan Simcha, David Distributed, Parallel, and Cluster Computing Machine Learning Learning and constructing large-scale graphs has attracted attention in recent decades, resulting in a rich literature that introduced various systems, tools, and algorithms. Grale is one of such tools that is designed for offline environments and is deployed in more than 50 different industrial settings at Google. Grale is widely applicable because of its ability to efficiently learn and construct a graph on datasets with multiple types of features. However, it is often the case that applications require the underlying data to evolve continuously and rapidly and the updated graph needs to be available with low latency. Such setting make the use of Grale prohibitive. While there are Approximate Nearest Neighbor (ANN) systems that handle dynamic updates with low latency, they are mostly limited to similarities over a single embedding. In this work, we introduce a system that inherits the advantages and the quality of Grale, and maintains a graph construction in a dynamic setting with tens of milliseconds of latency per request. We call the system Dynamic Grale Using ScaNN (Dynamic GUS). Our system has a wide range of applications with over 10 deployments at Google. One of the applications is in Android Security and Privacy, where Dynamic Grale Using ScaNN enables capturing harmful applications 4 times faster, before they can reach users. |
| title | Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality |
| topic | Distributed, Parallel, and Cluster Computing Machine Learning |
| url | https://arxiv.org/abs/2507.10139 |