FAST and NESTOR: How to exploit annotation hierarchies

Abstract

In this paper we present the annotation model implemented by FAST and the set-theoretical data models defined in the NESTOR framework. We show how annotations assume a tree structure that can be exploited by NESTOR to improve access and exchange of Digital Objects (DOs) between DLs in a distributed environment. © 2010 Springer-Verlag.