Minutes from yesterday’s call
-
Discussion
-
Dear all,
here are the merged minutes from yesterdays’ group call. The next call
will take place in 2 weeks at the usual timeslot: Tuesday June 14, 13:00
GMT.
Best, Tobias
Attendees: Frederik, Ulrich, Christopher, Tobias
Notes:
* Formal definitions – set theory:
o potentially use ADT as intermediate step between model and
implementation
o Look into Haskell docs, use that to get to a small core def for
sorted/unsorted, multimembership/unique
* Models are essentially a set of attributes and rules about them
(plus operations)
o Traits are then useful because they group things together and
make it simpler to explain what a certain formal concept (like
sorting) implies in terms of practically useful properties and
methods
o The clone operation (i.e. cache a snapshot of elements in
recursive collections) is useful because it may solve the
complexity issues that arise once we have recursion
o for citation use case: the copy/clone method (i.e. making
snapshots) may solve the issue that collections whose deep
membership changes may not remain citable
+ citation use case is present in many communities, and we
need to cover their differences. Snapshotting may not be
possible for everyone.
+ but we may figure out a way to compress the snapshotting
process so we can reconstruct a snapshot on request.
o for very dynamic data we may want to state that there are
policies that must be observed (basic versioning)
+ Christopher Harrison: use case with high volume and lots of
change every day – not possible to statically snapshot it –
need a UC description and see where the gaps are wrt the
formal model we end up with
* Collection API – what about a member API? Such an API would answer
e.g. “which collection(s) does this object belong to?” – different
from scope of current swagger API
o Might be solvable through PIT + registered property, but not
sure whether this is the only action of that API
o Close to a global search, so costly/difficult – might not be
implementable by all use cases, but perhaps relevant across
multiple RDA use cases
o Ulrich: nice if every member of a collection has a pinned PID to
its parent; but only feasible for static collections inside a
repository
+ across repositories, you will need a crawler that then
creates a graph; the query however then deviates to “which
subcollection(s) of a given (entry point) collection does
this object belong to?” which actually will lead to a two
parameter function
SubcollectionsMemberBelongsTo(member,collection) – we can
include this in the hierarchy trait
+ actually, the pointer to parents is a collection in itself
o Christopher: Subscription model could help with dynamic data as well
o Frederik: RSS or blog pingback might provide useful ideas and
infrastructure
—
Tobias Weigel
Abteilung Datenmanagement
Deutsches Klimarechenzentrum GmbH (DKRZ)
Bundesstraße 45 a • 20146 Hamburg • Germany
Phone: +49 40 460094-104
Email: ***@***.***
URL: http://www.dkrz.de
ORCID: orcid.org/0000-0002-4040-0215
Geschäftsführer: Prof. Dr. Thomas Ludwig
Sitz der Gesellschaft: Hamburg
Amtsgericht Hamburg HRB 39784
Log in to reply.