检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王青[1]
出 处:《情报杂志》2012年第9期92-97,共6页Journal of Intelligence
摘 要:传统意义上,书目关系被理解为书目记录间的关系,然而书目记录的细粒度往往较大,不能满足网络环境下用户准确、高效、清晰的信息需求,同时不利于信息资源在结构上的序化与内容上的深化。为此,基于原有书目关系体系提出其扩展关系及关联方法,并构建元数据方案与扩展关系的映射方案,将揭示范围、细粒度予以扩展与细化,并以图书馆应用最广泛的MARC元数据为例提出书目关系扩展实现。Bibliographic relationships are thought to be the relationships between bibliographic records, however, granularity of biblio- graphic records are always not small enough, which fails to meet the information demands under the web age for accuracy, efficiency and clarity of library users, and to help the structure of the information resource to be ordered and the content to be deepened. Therefore, this paper raises expanding relationships and the ways to build the relation based on former bibliographic relationships. At the same time, this paper proposes a scheme of how the metadata and expanding relationships map together which has a larger describing range and a finer granularity. The paper also uses MARC as a sample of metadata to describe how the scheme can be realiTed_
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.124.77