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

Shortest path implemented in TP3, but really slow #18

Open
amcp opened this issue Apr 7, 2016 · 6 comments
Open

Shortest path implemented in TP3, but really slow #18

amcp opened this issue Apr 7, 2016 · 6 comments

Comments

@amcp
Copy link
Contributor

amcp commented Apr 7, 2016

Original shortest path traversal:

Original list of randomly chosen target nodes (range 2-1000, choose 100):

TP3 shortest path traversal:
https://github.com/amcp/graphdb-benchmarks/blob/tp3/src/main/java/eu/socialsensor/graphdatabases/TitanGraphDatabase.java#L281

New method to choose source node:
https://github.com/amcp/graphdb-benchmarks/blob/tp3/src/main/java/eu/socialsensor/graphdatabases/GraphDatabaseBase.java#L128

New method to choose target nodes (choose from entire range of vertices in dataset):
https://github.com/amcp/graphdb-benchmarks/blob/tp3/src/main/java/eu/socialsensor/dataset/Dataset.java#L28

New method to choose number of random target nodes (set the number in configuration file):
https://github.com/amcp/graphdb-benchmarks/blob/tp3/src/test/resources/META-INF/input.properties#L86

@amcp
Copy link
Contributor Author

amcp commented Apr 7, 2016

I am asking for help from the experts on the forum...
https://groups.google.com/forum/#!topic/gremlin-users/rhIhEY9R4E0

@amcp
Copy link
Contributor Author

amcp commented Apr 7, 2016

I made progress and have fixed the traversal, but the QW-FS workload results are not consistent with the findings in your paper. Can you checkout my branch and confirm please?

@sarovios
Copy link
Contributor

sarovios commented Apr 7, 2016

I'll do asap.

@amcp
Copy link
Contributor Author

amcp commented Apr 9, 2016

I've fixed the performance issue with QW-FS but the results still do not line up with the paper.
There is also a bug I need to track down with the natural data sets - they hang on the first shortest path query, both for Enron and for Amazon.

For the time being, please take a look at the synthetic data set QW-FS results and let me know if you think they are reasonable.

Finally, I still cannot seem to make the Neo4J QW-FS work - it crashes. So that is still up for grabs.
https://github.com/amcp/graphdb-benchmarks#miw--qw-results

@sarovios
Copy link
Contributor

I am trying to run the Benchmark but I am having this exception: com.amazonaws.AmazonClientException: Unable to load AWS credentials from any provider in the chain. I am not very familiar with AWS cloud services or dynamo-db so can you please supply instruction of how I can run it?

@amcp
Copy link
Contributor Author

amcp commented Apr 11, 2016

Sotiri, for the purposes of this test I think you can comment out eu.socialsensor.databases=tddb in input.properties; we are working with a graph (Enron) that fits in memory so i think tbdb would be enough for Titan in this case.

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

2 participants