(note: I'm not sure this will get through all the aliases -- I don't think
this email addr is registered with the UPS list, for example)
On Thu, 2 Nov 2000, Steve Hitchcock wrote:
> NCSTRL was effectively the model for OAi. Greg Kuperberg suggests that
> NCSTRL has not been successful. It would be useful to have some meaningful
> measure of whether NCSTRL has been successful or not, and to hear the views
> of the NCSTRL developers (who are also involved in OAi). Maybe real
> evidence will yield clues to the ultimate destiny of OAi - central or
> distributed.
>
just a point of clarification: NCSTRL was not directly the model for OAI,
at least architecturally.
OAI has more in common with:
- RePEc (http://www.repec.org/)
- SODA (http://www.dlib.org/dlib/march99/maly/03maly.html)
and similar architectures.
A subset of the Dienst protocol gave us a starting ground for defining a
harvesting protocol, but even that has been relaxed to allow Dienst and
OAI to progress independently.
Most OAI service providers will probably assume a distributed storage
model, because it is certainly easier to build. But technically OAI is
agnostic with respect to centralized vs. distributed storage of data.
OAI focuses only on metadata.
Regarding centralized vs. distributed, I would submit CiteSeer
http://citeseer.nj.nec.com/cs
as an exemplary DL that seems to have resolved the tension between the two
models - providing both links to distributed copies and cached centralized
copies.
regards,
Michael
> The Harnad-Kuperberg dialogue has been fascinating but, to my mind, hasn't
> resolved the issue conclusively. It will be critical to understand what the
> user wants.
>
> Steve
>
>
> ------------------------------------------------------
> UPS mail list
> Mail submissions to u...@vole.lanl.gov
> To subscribe or unsubscribe visit http://vole.lanl.gov/mailman/listinfo/ups
>
---
Michael L. Nelson
207 Manning Hall, School of Information and Library Science
University of North Carolina m...@ils.unc.edu
Chapel Hill, NC 27599 http://ils.unc.edu/~mln/
+1 919 966 5042 +1 919 962 8071 (f)
