4 ms·

So I timed the compile step and it gets quite long at one second for 10,000 facts, about a 1/10th of a second per 1000 entries. I wasn't expecting my first atte

So I timed the compile step and it gets quite long at one second for 10,000 facts, about a 1/10th of a second per 1000 entries. I wasn't expecting my first attempt at a database to be able to handle 100,000 facts or to be able to compare with SQL, but I did think GCC would be a little bit faster than that. Interestingly, when I created arbitrary relations between the data and queried them, the queries themselves executed in 5ms no matter how large the data set. I think I might convert nebula back into a graph-based logic programming language and try to make a triple-store without a compile step.

danbruc 12y ago
Just to put this into perspective, 100,000 facts is a tiny amount for a databases. If you use it for a blog having 250 users with 20 articles per user and 20 comments per article you have already reached 100,000 comments. If you add the date of and the user writing the comment you are at 300,000 facts. And we haven't yet stored any information about the users or articles.