Graph query language for the archive (internship) - Revision history

StefanoZacchiroli at 15:08, 4 February 2024

2024-02-04T15:08:26Z

← Older revision		Revision as of 15:08, 4 February 2024
Line 22:		Line 22:
	\|mentors=		\|mentors=
	* [https://perso.liris.cnrs.fr/angela.bonifati/ Angela Bonifati] <angela.bonifati@univ-lyon1.fr>		* [https://perso.liris.cnrs.fr/angela.bonifati/ Angela Bonifati] <angela.bonifati@univ-lyon1.fr>
	* Stefano Zacchiroli <zack@upsilon.cc> (~~zack~~ on [[~~IRC~~]])		* Stefano Zacchiroli <zack@upsilon.cc> (Zack on [[Matrix]])
	}}		}}

	[[Category:Available internship]]		[[Category:Available internship]]

StefanoZacchiroli: re-enable

2024-02-04T15:06:20Z

re-enable

← Older revision		Revision as of 15:06, 4 February 2024
Line 25:		Line 25:
	}}		}}

	[[Category:~~Ongoing~~ internship]]		[[Category:Available internship]]

StefanoZacchiroli at 13:17, 10 November 2022

2022-11-10T13:17:12Z

← Older revision		Revision as of 13:17, 10 November 2022
Line 25:		Line 25:
	}}		}}

	[[Category:~~Available~~ internship]]		[[Category:Ongoing internship]]

StefanoZacchiroli: generalize target platforms to mention both Neo4J and TinkerPop

2021-10-05T14:00:22Z

generalize target platforms to mention both Neo4J and TinkerPop

← Older revision		Revision as of 14:00, 5 October 2021
Line 1:		Line 1:
	{{Internship		{{Internship
	\|description=The Software Heritage archive is structured as a graph (specifically, a [https://en.wikipedia.org/wiki/Merkle_tree Merkle DAG]) and is huge: ~~tens of~~ billion nodes, ~~hundreds of~~ billion edges.		\|description=The Software Heritage archive is structured as a graph (specifically, a [https://en.wikipedia.org/wiki/Merkle_tree Merkle DAG]) and is huge: 20 billion nodes, 200 billion edges.
	It has recently been verified that a compressed representation of the graph structure can fit in memory, whereas node/edge properties can be memory-mapped to secondary storage (see: [https://docs.softwareheritage.org/devel/swh-graph/ documentation] and in particular the [https://arxiv.org/abs/2001.08647 SANER 2020 paper referenced there]).		It has recently been verified that a compressed representation of the graph structure can fit in memory, whereas node/edge properties can be memory-mapped to secondary storage (see: [https://docs.softwareheritage.org/devel/swh-graph/ documentation] and in particular the [https://arxiv.org/abs/2001.08647 SANER 2020 paper referenced there]).
	An [https://docs.softwareheritage.org/devel/swh-graph/api.html ad hoc API] is available to traverse the graph, with very limited querying capabilities.		An [https://docs.softwareheritage.org/devel/swh-graph/api.html ad hoc API] is available to traverse the graph, with very limited querying capabilities.
	The goal of this internship is to experiment with the possibility of querying the archive graph via state-of-the-art [https://en.wikipedia.org/wiki/Graph_database#Graph_query-programming_languages graph query languages].		The goal of this internship is to experiment with the possibility of querying the archive graph via state-of-the-art [https://en.wikipedia.org/wiki/Graph_database#Graph_query-programming_languages graph query languages].

	The ideal outcome of the internship will be a prototype of query engine that answers queries on top of the compressed graph representation plus associated property maps.		The ideal outcome of the internship will be a prototype of query engine that answers queries on top of the compressed graph representation plus associated property maps.
	~~The tentative~~ target platform ~~for implementation is~~ [https://neo4j.com/ Neo4j] ~~extended with~~ a compatibility layer for WebGraph [http://webgraph.di.unimi.it/docs/it/unimi/dsi/webgraph/ImmutableGraph.html ImmutableGraph]~~, but other platforms might~~ be ~~considered during the internship~~.		A prototype implementation will be developed for a target platform to be chosen during the internship.
			Tentative target platforms include: [https://neo4j.com/ Neo4j] and [http://tinkerpop.apache.org/ Apache TinkerPop].
			In either case a backend/compatibility layer for WebGraph [http://webgraph.di.unimi.it/docs/it/unimi/dsi/webgraph/ImmutableGraph.html ImmutableGraph] will be developed.

	\|skills=		\|skills=
Line 12:		Line 15:

	Will be considered a plus:		Will be considered a plus:
			* experience with graph traversal languages (e.g., [https://en.wikipedia.org/wiki/Gremlin_(query_language) Gremlin])
	* experience with graph databases (e.g., [https://neo4j.com/ Neo4j])		* experience with graph databases (e.g., [https://neo4j.com/ Neo4j])

StefanoZacchiroli: add IRC nicknames

2021-03-02T10:33:32Z

add IRC nicknames

← Older revision		Revision as of 10:33, 2 March 2021
Line 18:		Line 18:
	\|mentors=		\|mentors=
	* [https://perso.liris.cnrs.fr/angela.bonifati/ Angela Bonifati] <angela.bonifati@univ-lyon1.fr>		* [https://perso.liris.cnrs.fr/angela.bonifati/ Angela Bonifati] <angela.bonifati@univ-lyon1.fr>
	* Stefano Zacchiroli <zack@upsilon.cc>		* Stefano Zacchiroli <zack@upsilon.cc> (zack on [[IRC]])
	}}		}}

	[[Category:Available internship]]		[[Category:Available internship]]

StefanoZacchiroli: mention remote opportunities

2020-12-14T09:42:28Z

mention remote opportunities

← Older revision		Revision as of 09:42, 14 December 2020
Line 14:		Line 14:
	* experience with graph databases (e.g., [https://neo4j.com/ Neo4j])		* experience with graph databases (e.g., [https://neo4j.com/ Neo4j])

	\|workplace=[https://liris.cnrs.fr/en LIRIS (Univ. Lyon 1, Lyon)] or [https://www.inria.fr/en/centre-inria-de-paris Inria Paris]		\|workplace=[https://liris.cnrs.fr/en LIRIS (Univ. Lyon 1, Lyon)] or [https://www.inria.fr/en/centre-inria-de-paris Inria Paris] or contact mentors for remote opportunities

	\|mentors=		\|mentors=

StefanoZacchiroli: add link to SANER 2020 preprint

2020-11-19T17:52:24Z

add link to SANER 2020 preprint

← Older revision		Revision as of 17:52, 19 November 2020
Line 1:		Line 1:
	{{Internship		{{Internship
	\|description=The Software Heritage archive is structured as a graph (specifically, a [https://en.wikipedia.org/wiki/Merkle_tree Merkle DAG]) and is huge: tens of billion nodes, hundreds of billion edges.		\|description=The Software Heritage archive is structured as a graph (specifically, a [https://en.wikipedia.org/wiki/Merkle_tree Merkle DAG]) and is huge: tens of billion nodes, hundreds of billion edges.
	It has recently been verified that a compressed representation of the graph structure can fit in memory, whereas node/edge properties can be memory-mapped to secondary storage (see: [https://docs.softwareheritage.org/devel/swh-graph/ documentation] and in particular the paper referenced there).		It has recently been verified that a compressed representation of the graph structure can fit in memory, whereas node/edge properties can be memory-mapped to secondary storage (see: [https://docs.softwareheritage.org/devel/swh-graph/ documentation] and in particular the [https://arxiv.org/abs/2001.08647 SANER 2020 paper referenced there]).
	An [https://docs.softwareheritage.org/devel/swh-graph/api.html ad hoc API] is available to traverse the graph, with very limited querying capabilities.		An [https://docs.softwareheritage.org/devel/swh-graph/api.html ad hoc API] is available to traverse the graph, with very limited querying capabilities.
	The goal of this internship is to experiment with the possibility of querying the archive graph via state-of-the-art [https://en.wikipedia.org/wiki/Graph_database#Graph_query-programming_languages graph query languages].		The goal of this internship is to experiment with the possibility of querying the archive graph via state-of-the-art [https://en.wikipedia.org/wiki/Graph_database#Graph_query-programming_languages graph query languages].

Abonifat at 08:13, 17 February 2020

2020-02-17T08:13:53Z

← Older revision		Revision as of 08:13, 17 February 2020
Line 17:		Line 17:

	\|mentors=		\|mentors=
	* [https://perso.liris.cnrs.fr/angela.bonifati/ Angela Bonifati] <angela.bonifati@~~gmail~~.~~com~~>		* [https://perso.liris.cnrs.fr/angela.bonifati/ Angela Bonifati] <angela.bonifati@univ-lyon1.fr>
	* Stefano Zacchiroli <zack@upsilon.cc>		* Stefano Zacchiroli <zack@upsilon.cc>
	}}		}}

	[[Category:Available internship]]		[[Category:Available internship]]

StefanoZacchiroli at 17:18, 16 February 2020

2020-02-16T17:18:58Z

← Older revision		Revision as of 17:18, 16 February 2020
Line 20:		Line 20:
	* Stefano Zacchiroli <zack@upsilon.cc>		* Stefano Zacchiroli <zack@upsilon.cc>
	}}		}}

			[[Category:Available internship]]

StefanoZacchiroli at 17:16, 16 February 2020

2020-02-16T17:16:26Z

← Older revision		Revision as of 17:16, 16 February 2020
Line 20:		Line 20:
	* Stefano Zacchiroli <zack@upsilon.cc>		* Stefano Zacchiroli <zack@upsilon.cc>
	}}		}}

	~~[[Category:Internship]]~~
	~~[[Category:Lang:English]]~~