Methods for XML phrase query processing over a collection of XML documents

T. Paul, Md. Humayun Kabir, M. M. A. Prodhan, M. Chowdhury
{"title":"Methods for XML phrase query processing over a collection of XML documents","authors":"T. Paul, Md. Humayun Kabir, M. M. A. Prodhan, M. Chowdhury","doi":"10.1109/PACRIM.2011.6032922","DOIUrl":null,"url":null,"abstract":"Techniques to evaluate XML queries with multiple keywords having fixed relations, such as conjunction, disjunction, ancestor-descendant, and preceding-following, have already been developed. However, an English phrase with a large number of keywords cannot be mapped only with the above keyword relations. A new method to evaluate such natural phrase as the query over a collection of XML documents is necessary. As per our knowledge, such method to evaluate natural phrases in multiple XML documents does not exist. In this paper, we propose a new method to evaluate phrase queries. The inverted file structure and the query processing algorithms have been modified for this purpose. Our prototype implementation of XML query processing has demonstrated that our method can effectively evaluate phrase queries.","PeriodicalId":236844,"journal":{"name":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"118 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2011.6032922","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Techniques to evaluate XML queries with multiple keywords having fixed relations, such as conjunction, disjunction, ancestor-descendant, and preceding-following, have already been developed. However, an English phrase with a large number of keywords cannot be mapped only with the above keyword relations. A new method to evaluate such natural phrase as the query over a collection of XML documents is necessary. As per our knowledge, such method to evaluate natural phrases in multiple XML documents does not exist. In this paper, we propose a new method to evaluate phrase queries. The inverted file structure and the query processing algorithms have been modified for this purpose. Our prototype implementation of XML query processing has demonstrated that our method can effectively evaluate phrase queries.
对XML文档集合进行XML短语查询处理的方法
已经开发了使用具有固定关系的多个关键字评估XML查询的技术,例如连接、分离、祖先-后代和前-后。但是,对于包含大量关键字的英语短语,不能仅使用上述关键字关系进行映射。需要一种新的方法来对XML文档集合上的查询这样的自然短语求值。据我们所知,这种在多个XML文档中计算自然短语的方法并不存在。在本文中,我们提出了一种新的评估短语查询的方法。为了这个目的,倒置的文件结构和查询处理算法已经被修改。我们的XML查询处理的原型实现已经证明,我们的方法可以有效地计算短语查询。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信