In the last few years social networks have reached an ubiquitous diffusion. Facebook, LinkedIn, and Twitter now have billions of users, that daily interact together and establish new connections. Users and interactions among them can be naturally represented as data graphs, whose vertices denote users and whose edges are labelled with information about the different interactions. In this paper we sketch a novel approach for processing regular path queries on very large graphs. Our approach exploits Brzozowski’s derivation of regular expressions to allow for a vertex-centric, message-passing-based evaluation of path queries on top of Apache Giraph.

Processing Regular Path Queries on Giraph

SARTIANI, CARLO
2014-01-01

Abstract

In the last few years social networks have reached an ubiquitous diffusion. Facebook, LinkedIn, and Twitter now have billions of users, that daily interact together and establish new connections. Users and interactions among them can be naturally represented as data graphs, whose vertices denote users and whose edges are labelled with information about the different interactions. In this paper we sketch a novel approach for processing regular path queries on very large graphs. Our approach exploits Brzozowski’s derivation of regular expressions to allow for a vertex-centric, message-passing-based evaluation of path queries on top of Apache Giraph.
File in questo prodotto:
File Dimensione Formato  
bmr2014.pdf

solo utenti autorizzati

Tipologia: Pdf editoriale
Licenza: DRM non definito
Dimensione 932.19 kB
Formato Adobe PDF
932.19 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11563/99097
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 9
  • ???jsp.display-item.citation.isi??? ND
social impact