Graph query language is the key to unleash the value from connected data. Mingxi Wu outlines the eight prerequisites of a practical graph query language, drawn from six years’ experience dealing with real-world graph analytical use cases. Along the way, Mingxi compares GSQL, Gremlin, Cypher, and SPARQL, pointing out their respective pros and cons.
You’ll learn why Gremlin isn’t ideal for complicated real-life use cases—mainly due to its programming model requiring a runtime traversal tree; the benefits of Cypher’s pattern match style programming model; and why SPARQL is insufficient for property graph analytics. Mingxi concludes with an overview of GSQL, a Turing-complete query language that has the merits of Cypher—pattern match style query model plus another easy-to-think programming model—and provides multiple passes on a static topology with runtime attributes decoration capability.
Mingxi Wu is the vice president of engineering at TigerGraph, a Silicon Valley-based startup building a world-leading real-time graph database. Over his career, Mingxi has focused on database research and data management software. Previously, he worked in Microsoft’s SQL Server Group, Oracle’s Relational Database Optimizer Group, and Turn Inc.‘s Big Data Management Group. Lately, his interest has turned to building an easy-to-use and highly expressive graph query language. He’s won research awards from the most prestigious publication venues in database and data mining, including SIGMOD, KDD, and VLDB, and has authored five US patents with three more international patents pending. Mingxi holds a PhD specializing in both database and data mining from the University of Florida.
For exhibition and sponsorship opportunities, email strataconf@oreilly.com
For information on trade opportunities with O'Reilly conferences, email partners@oreilly.com
View a complete list of Strata Data Conference contacts
©2019, O’Reilly UK Ltd • (800) 889-8969 or (707) 827-7019 • Monday-Friday 7:30am-5pm PT • All trademarks and registered trademarks appearing on oreilly.com are the property of their respective owners. • confreg@oreilly.com