This meetup featured one of Bitnine’s very own team members, Dehowe Feng as the key speaker.
Dehowe is a software developer with the AgensGraph team from the Bay Area. He is responsible for the front-end development of AgensGraph and has worked various projects including the AgensGraph website, import tools for AgensGraph, and connectors for third party software. In his spare time he enjoys Hiking, DJ-ing, going to the gym, and attending concerts.
George, Event Coordinator, opened up the night by greeting the attendees. Joshua, Meetup Member, provided a brief introduction of AgensGraph. Dehowe presented IMDb in the graph database.
Dehowe first introduced the IMDb dataset and talked about He drew comparisons between the data stored in a relational format to the data stored in the graph format. Since the data relies heavily on connections, using a graph database to store and query the data would allow it to be understood in a way that is intuitively visual.
After the presentation, Dehowe and the other Bitnine members fielded many questions from the audience.
Q. What kind of indexes are used in AgensGraph?
A. AgensGraph uses B-Tree indexing.
Q. Is there a way to examine further nodes in a graph database without having to draw a new node label to connect them?
A. Yes. The Cypher query language allows you to specify the degree of separation of the nodes you want to examine using the following syntax: (x)-[*n..m]->(y). n is the minimum degree and m is the maximum degree apart that your nodes are separated. Anything that is in the range will be examined.
Q. Is the graph database faster than relational database for queries with larger degrees of separation?
Include the slides shared at https://www.slideshare.net/JoshuaBae/imdb-import-presentation.
Please visit our meetup page and RSVP at https://www.meetup.com/Graph-Database-in-Silicon-Valley/
BITNINE GLOBAL INC., THE COMPANY SPECIALIZING IN GRAPH DATABASE