检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国防科技大学信息系统与管理学院,湖南长沙410073
出 处:《国防科技大学学报》2008年第6期78-82,共5页Journal of National University of Defense Technology
基 金:国家部委资助项目(513190801)
摘 要:Z39.50被广泛应用在异构数据源的检索中,由于数据源的动态性和自治性,无法准确获得其语义,很难建立Z39.50与数据源的映射关系,为进行准确的信息检索操作,提出扩展超图数据模型(EHDM),对EHDM进行层次抽象,以EHDM的两类节点和边作为Z39.50协议的访问点,通过在EHDM和Z39.50之间建立DL层,将DL系统的概念、导出概念分别映射到Z39.50协议包装器上,解决Z39.50协议查询对结构化数据源支持不好、出现错误查询结果集等问题,定义类DataSpace的三层结构实现根据需求进行集成的"量入为出"的数据集成策略。Z39.50 is widely used for searching and retrieving information spread over a number of heterogeneous sources, but it is hard to construct the mapping relationships between Z39.50 and the data sources, since the semantics of the dynamic and autonomy data sources cannot be exactly derived so as to achieve an exact information retrieval operation. This paper proposes the extend hyper graph data model based on HDM, which can be abstracted into levels, taking two kinds of nodes and edges of EHDM as access points of Z39.50. It can solve the problems of badly supporting of querying on struetured data sources and query failures by constructing the DL layer between EHDM and Z39.50, in which the concepts and derived concepts are mapped onto Z39.50 wrappers. Thus, defining three layers structure as in dataspaee systems can realize the data integration strategy named "integrate when needed".
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.188.99.196