ADMIRE: an adaptive data model for meta search engines

ADMIRE: an adaptive data model for meta search engines
复制标题

DOI:
10.1016/s1389-1286(00)00033-5
复制
发表时间:
2000-06-01
期刊:
影响因子:
5.6
通讯作者:
Neuhold, EJ
Neuhold, EJ
中科院分区:
计算机科学3区
文献类型:
--
作者:
Huang, LM;Hemmje, M;Neuhold, EJ

文献摘要

被引文献

相似文献

考虑到搜索引擎的多样性,有效地整合它们是一项重要而困难的工作。必须提供一个数据模型,它可以提供异构搜索引擎查询能力的详细描述。通过该模型,元数据挖掘能够更准确地将用户的查询映射到特定的数据源中,并能获得较好的查准率和查全率。此外,它将有利于目标源的选择和计算优先级。由于新的搜索引擎不断涌现,旧的搜索引擎也随着功能和内容的变化而不断更新,数据模型需要具有良好的适应性和可扩展性,以适应快速发展的万维网。本文给出了异构搜索引擎的查询能力的形式化描述,并给出了一种算法,用于将查询从一般的中介器格式映射到特定搜索引擎的特定包装器格式。与相关工作相比,本文的工作的特点在于,我们更关注术语之间的约束、属性顺序以及逻辑算子约束的影响。我们的工作的贡献是,我们提供了一个数据模型,这是表达足够细致地描述当前的万维网搜索引擎的查询能力和灵活性,足以有效地整合它们。(C)2000由Elsevier Science B.V.出版,保留所有权利。
Considering the diversity among search engines, efficient integration of them is an important but difficult job. It is essential to provide a data model that can provide a detailed description of the query capabilities of heterogeneous search engines. By means of this model, the meta-searcher can map users' queries into specific sources more accurately, and it can achieve good precision and recall. Moreover, it will benefit the selection of target source and computing priority. Because new search engines emerge frequently and old ones are updated when their function and content change, the data model needs good adaptivity and scalability to keep in step with the rapidly developing World Wide Web. This paper gives a formal description of the query capabilities of heterogeneous search engines and an algorithm for mapping a query from a general mediator format into the specific wrapper format of a specific search engine. Compared with related work, the special features of our work are that we focus more on the constraint of/between the terms, attribute order, and the impact of logical operator restraints. The contribution of our work is that we offer a data model that is both expressive enough to meticulously describe the query capabilities of current World Wide Web search engines and flexible enough to integrate them efficiently. (C) 2000 Published by Elsevier Science B.V. All rights reserved.