Zaw Win Htet Picture

Zaw Win Htet

Staff Writer, Neo4j

Zaw Win Htet is a writer based in Yangon, Myanmar. Seeking to make sense of the world, he finds himself compelled by boundless opportunities to learn the previously unheard by simply connecting the dots. In his spare time, he likes to muse over literary classics and mess with philosophy. He is also an activist engaged in environmental advocacy and change-making.


Latest Posts by Zaw Win Htet


Catch this week's GraphCast: A high-level explainer of what a native graph database is in 10 minutes

#GraphCast: What Is a Graph Database in 10 Minutes

Welcome to this week's #GraphCast – our series featuring what you might have missed in Neo4j media from the past fortnight. Last time, our Editor-in-Chief, Bryce Merkl Sasaki, showed us how graph-powered drug discovery and pharmaceutical research helps in the fight against... read more


Catch this week's GraphCast: Graphs4Good Community Effort to Fight COVID-19 with Knowledge Graph

#GraphCast: Graphs4Good Knowledge Graph to Fight COVID-19

Welcome to this week's #GraphCast – our series featuring what you might have missed in Neo4j media from the past fortnight. Last time, our News Editor, Jessica Baumgardner, showed us how a social knowledge graph improves remote collaboration for the home workforce in these very remote... read more


Learn how ETL tools work, including basics of graph ETL which converts RDBMS to graph databases.

Graph Databases for Beginners: The Basics of Graph ETL

他每天下午都在学校踢球。 Oh, sorry, you didn’t catch that? Unless you read Chinese, it's perfectly normal to be a little confused. No one understands all 6,500 existing languages on earth. Let’s go ahead and translate the sentence into something English speakers can... read more




Learn the definition of a graph (vs. a chart), including nodes, relationships, graph theory and more

Graph Databases for Beginners: Wait, What Do You Mean by “Graph”?

When I was in college mathematics class, I was given a Traveling Salesman Problem for the first time. It's a classic problem that asks: Given a list of destinations and the distances between each one, what is the shortest possible path a salesman could take to visit each city and then return... read more