You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Jan 30, 2024. It is now read-only.
For the Nuremberg Time Machine Project we want to find all pictorial representations (and subclasses of it) that have a connection to Nuremberg.
It could be helpful to split the query programmatically into smaller ones, going recursively through the data, because of the size of the dataset, the depth of the query and the structure of the database.
The text was updated successfully, but these errors were encountered:
Latest Version of the mindmap I created to get a better overview.
The project turns out to be more difficult than expected.
I have to do some more concept work before writing some code in R to solve this Problem.
Because of that the Issue can be (at least temporarily) closed.
I'm guessing that the fundamental limitations (compute time for deep queries) that you identified still apply, but it might be worth reaching out to the people who were working on this to see what their thoughts are.
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
For the Nuremberg Time Machine Project we want to find all pictorial representations (and subclasses of it) that have a connection to Nuremberg.
It could be helpful to split the query programmatically into smaller ones, going recursively through the data, because of the size of the dataset, the depth of the query and the structure of the database.
The text was updated successfully, but these errors were encountered: