jamie-vesoft's comments

jamie-vesoft | 5 years ago | on: Nebula Graph: A Linearly Scalable, Distributed Graph Database Written in C++

Graph databases are efficient in exploring multi-hop relationships which are common in many business scenarios. So basically if your application needs to query n-hop relationships all the time, then graph database is a better choice. Some main use cases include real-time recommendation (product/content/shop), risk management like fraud detection in the financial services industry, knowledge graph and machine learning, etc.

jamie-vesoft | 5 years ago | on: Nebula Graph: A Linearly Scalable, Distributed Graph Database Written in C++

Great digging! Thanks so much for paying attention to the benchmark report data. We apologize that you have to wait for so long!

Yes we have been working on the benchmark data for quite some time because we have been working with our clients to verify our capability. For example, one of our clients has inserted 300b records to 6 servers within 20 hours, then we are confident to say that Nebula Graph can manage 690k inserts/sec/server.

We will keep working and provide a trustworthy benchmark report for you as soon as we can.

Thanks again!

jamie-vesoft | 5 years ago | on: Nebula Graph: A Linearly Scalable, Distributed Graph Database Written in C++

Thanks so much for your suggestion regarding the website!I am thinking about the same thing as well. Will keep improving the site along the way. Really appreciate it.

As to the data for throughput, there are some PoC projects going on and according to data from production, for inserting, one of our clients has inserted 300b records to 6 servers within 20 hours, that is 690k inserts/sec/server.

We want the benchmark data to be verified by decent clients in their production environment. And will reveal more data in the future.

Thanks again!

jamie-vesoft | 6 years ago | on: Ask HN: Is RSS dead?

Totally agree that the nice thing is everything stays in one place. I use it for Stack Overflow as well. :) And will definitely add Reddit to my list.

jamie-vesoft | 6 years ago | on: Show HN: Nebula – a distributed graph database written in C++

Thanks so much for trying Nebula! We really appreciate it.

Sorry about the where clause issue. Do you mind bringing an issue in this regard on our GitHub repo? So that we can assign it to relevant staff.

As to the query language, thanks for your suggestion and nGQL will surely be aligned with the GQL standard. We are keeping a close eye on it. :)

We are planning to support OpenCypher in the first half of 2020 and TinkerPop would be the next.

Thanks again! Here's our slack group btw and you may raise any question there: https://join.slack.com/t/nebulagraph/shared_invite/enQtNjIzM...

jamie-vesoft | 6 years ago | on: Show HN: Nebula – a distributed graph database written in C++

Thanks for asking! Sorry I missed this question earlier.

Nebula doesn't store data multiple times for index.

And here's how the indexing works in Nebula Graph:

You are allowed to create multiple indexes for one tag or edge type in Nebula Graph. For example, if a vertex has 5 properties attached to it, then you can create one index for each if it's necessary for you. Both indexes and the raw data are stored in the same partition with their own data structure for quick query statement scanning. Whenever there are "where" clause/syntax in the queries, the index optimizer decides which index file should be traversed.

page 1