T. Paul, Md. Humayun Kabir, M. M. A. Prodhan, M. Chowdhury
{"title":"对XML文档集合进行XML短语查询处理的方法","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":"{\"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}","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}
Methods for XML phrase query processing over a collection of XML documents
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.