Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Scale, federation, and a preexisting query language #6

Open
JeffreyBenjaminBrown opened this issue Oct 3, 2017 · 0 comments
Open

Comments

@JeffreyBenjaminBrown
Copy link
Owner

JeffreyBenjaminBrown commented Oct 3, 2017

Currently DWT runs on a single machine. Federated queries such as "What expressions on any of my friends' computers involve wedding, invitation and Smith?" would be useful.

Some powerful pattern-matching graph query languages (Sparql, Gremlin, Datalog ..) already exist. Implementing DWT's (easier) query language using those would make it more expressive and faster.

Among open-source graph databases, JanusGraph is uniquely scalable, because it offers vertex-centric indices. It uses Gremlin, a meta-language, so if we decided to switch to something else like Neo4j, it would take minimal work.

Among Haskell web toolkits, Servant is magically beautiful, but I haven't thoroughly studied the alternatives.

@JeffreyBenjaminBrown JeffreyBenjaminBrown changed the title Scale and federation Scale, federation, and a preexisting query language Oct 3, 2017
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant