Taming the Expressiveness and Programmability of Graph Analytical Queries.

Qin, L

Lai, L Hao, K Zhou, Z Zhao, Y Han, Y Lin, X Qian, Z Zhou, J

Permalink

Open Access

Copyright Clearance Process

This item is open access.

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Qin, L https://orcid.org/0000-0001-6068-5062
dc.contributor.author	Lai, L
dc.contributor.author	Hao, K
dc.contributor.author	Zhou, Z
dc.contributor.author	Zhao, Y
dc.contributor.author	Han, Y
dc.contributor.author	Lin, X
dc.contributor.author	Qian, Z
dc.contributor.author	Zhou, J
dc.date.accessioned	2022-01-31T03:58:11Z
dc.date.available	2022-01-31T03:58:11Z
dc.date.issued	2021-01-01
dc.identifier.citation	CoRR, 2021, abs/2004.09045
dc.identifier.uri	http://hdl.handle.net/10453/153933
dc.language	en
dc.relation.ispartof	CoRR
dc.rights	info:eu-repo/semantics/openAccess
dc.title	Taming the Expressiveness and Programmability of Graph Analytical Queries.
dc.type	Journal Article
utslib.citation.volume	abs/2004.09045
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - AAII - Australian Artificial Intelligence Institute
utslib.copyright.status	open_access	*
pubs.consider-herdc	false
dc.date.updated	2022-01-31T03:58:10Z
pubs.publication-status	Published online
pubs.volume	abs/2004.09045

Please use this identifier to cite or link to this item: