April 2025
Intermediate to advanced
238 pages
7h 7m
Italian
Content preview from Database grafici, 2a edizione
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Capitolo 7. Analisi predittiva con la teoria dei grafi
Questo lavoro è stato tradotto utilizzando l'AI. Siamo lieti di ricevere il tuo feedback e i tuoi commenti: translation-feedback@oreilly.com
In questo capitolo esamineremo alcune tecniche analitiche e algoritmi per l'elaborazione di dati grafici. Sia la teoria dei grafi che gli algoritmi dei grafi sono campi maturi e ben compresi della scienza informatica e dimostreremo come entrambi possano essere utilizzati per estrarre informazioni sofisticate dai database di grafi. Anche se il lettore con un background in informatica riconoscerà senza dubbio questi algoritmi e queste tecniche, la discussione in questo capitolo è gestita senza ricorrere alla matematica, per incoraggiare i profani curiosi a tuffarsi.
Ricerca Depth-First e Breadth-First
Prima di esaminare le tecniche analitiche di ordine superiore, dobbiamo riapprendere il fondamentale algoritmo di ricerca breadth-first, che è alla base dell'iterazione su un intero grafo. La maggior parte delle query che abbiamo visto in questo libro sono di natura depth-first piuttosto che breadth-first. In altre parole, esse attraversano il grafo da un nodo iniziale a un nodo finale prima di ripetere una ricerca simile lungo un percorso diverso a partire dallo stesso nodo iniziale. La ricerca in profondità è una buona strategia quando cerchiamo di seguire un percorso per scoprire informazioni discrete.
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.