基于NearestPair的XML关键词检索算法-北京大学机器感知与智能.PDFVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.20, No.4, April 2009, pp.910−917 doi: 10.3724/SP.J.1001.2009.03224 Tel/Fax: +86-10 © by Institute of Software , the Chinese Academy of Sciences . All rights reserved. ∗ 基于 Nearest Pair 的 XML 关键词检索算法 + 吉聪睿, 邓志鸿 , 唐世渭 (北京大学 信息科学技术学院 智能科学系,北京 100871) An XML Keyword Retrieval Algorithm Based on Nearest Pair + JI Cong-Rui, DENG Zhi-Hong , TANG Shi-Wei (Department of Machine Intelligence, School of Electronic Engineering and Computer Science, Peking University, Beijing 100871, China) + Corresponding author: E-mail: zhdeng@, /faculty/system/dengzhihong/dengzhihong.htm Ji CR, Deng ZH, Tang SW. An XML keyword retrieval algorithm based on nearest pair. Journal of Software, 2009,20(4):910−917. /1000-9825/3224.htm Abstract : As more and more data are expressed and stored in XML format, the study on XML keyword retrieval becomes the focus of IR (information retrieval) and Database. This paper gives and proves some properties of SLCA (smallest lowest common ancestor), which is the key concept of XML keyword retrieval. It also introduces a new XML keyword retrieval algorithm, Nearest Pair, on the basis of the properties above. This algorithm uses the iterative bi-search technology to look for nearest pairs, which can decrease the assistant computation by one order of magnitude. The experimental results show that Nearest Pair outperforms the existing mainstream algorithms in most cases. Key words: XML; keyword retrieval; SLCA (smallest lowest common ancestor) 摘 要: 随着大量数据以XML 格式保存,针对XML 文档的关键词检索技术已经成为信息检索和数据库等相关领 域的研究热点.以树的杜威编