RSS
热门关键字:  数据挖掘  人工智能  数据仓库  搜索引擎  数据挖掘导论
当前位置 :| 首页>人工智能>信息检索>

MARS: A Matching and Ranking System for XML Content and Stru

来源: 作者:unkonwn 时间:2004-12-13 点击:

Abstract

MARS: A Matching and Ranking System for XML Content and Structure Retrieval

by: S. Alireza Aghili, Hua-Gang Li, Divyakant Agrawal, and Amr El Abbadi

Abstract: 数据挖掘研究院

Structural queries specify complex predicates on the content and the structure of the elements of tree-structured XML documents. Recent works have typically applied top-down decomposition of the twig patterns into (i) parent-child or ancestor-descendant relationships, or (ii) path expression queries, and then followed by a join operation to reconstruct matched twig patterns. This demonstration system is the implementation prototype of an efficient heuristic-based bottom-up approach named MARS (Matching And Ranking System for XML structure queries), for matching and ranking of structural query patterns for XML query processing. An efficient nearest common ancestor labeling scheme is applied to utilize fast bottom-up construction of the subtree matches from the potential keywords. MARS considers both the content and structure of queries and incorporates a variation of IR-based relevance ranking to report the top-k ranked results. The graphical user interface of MARS provides an interactive visualization of the twig query discovery.

数据挖掘研究院

Keywords:

XML, Twig Query, Structure and Content Search, Binary Labeling 数据挖掘研究院

Date:

May 2005

Document: 2005-11 数据挖掘研究院

最新评论共有 0 位网友发表了评论
发表评论
评论内容:不能超过250字,需审核,请自觉遵守互联网相关政策法规。
匿名?