计算机科学 ›› 2017, Vol. 44 ›› Issue (9): 216-221.doi: 10.11896/j.issn.1002-137X.2017.09.040

• 软件与数据库技术 • 上一篇    下一篇

模糊XML关键字近似查询方法研究

李婷,程海涛   

  1. 东北大学计算机科学与工程学院 沈阳110819,东北大学计算机科学与工程学院 沈阳110819
  • 出版日期:2018-11-13 发布日期:2018-11-13

Research of Approximate Keyword Query on Fuzzy XML Documents

LI Ting and CHENG Hai-tao   

  • Online:2018-11-13 Published:2018-11-13

摘要: 在精确XML文档上的关键字查询方法的研究大多是基于LCA语义或者其变种语义(SLCA,ELCA等)开展的,将包含所有关键字的最紧致XML子树片段作为查询结果返回。但是这些基于LCA语义产生的查询结果中通常包含了大量的冗余信息,现实世界中存在着大量的不确定和模糊信息,因而如何从模糊XML文档中搜索到高质量的关键字查询结果是一个需要研究的问题。针对模糊XML文档上的关键字近似查询方法进行研究,通过引入最小连接树(MCT)的概念,提出在模糊XML文档上关键字查询的所有GDMCTs问题,并给出解决这一问题的基于栈的算法All fuzzy GDMCTs,该算法可以得到满足用户指定的子树大小阈值和可能性阈值条件的所有GDMCTs结果。实验表明,该算法在模糊XML文档上能够得到较高质量的关键字查询结果。

关键词: XML,关键字,近似查询,模糊,可能性

Abstract: The study of keyword queries on crisp XML documents is carried out mainly based on the LCA semantics or its variant semantics (SLCA,ELCA),and the most compact XML subtrees containing all keywords are returned as the query results.However,the generated results based on the LCA semantics always contain a lot of redundant information,and there are a lot of uncertainty and fuzzy information exist in the real world.How to search the high quality results of keyword queries on fuzzy XML documents is an issue need to be studied.Aiming at investigating the method of approximate keyword query on fuzzy XML documents,firstly the concept of minimum connecting tree was introduced,All GDMCTs problem of keyword queries on fuzzy XML documents was proposed,and a stack based algorithm All fuzzy GDMCTs was given to solve the problem.The algorithm can get all the GDMCTs results satisfying the given subtree size threshold and possibility threshold.Experimental results show that the algorithm can get the high quality results of keyword queries on fuzzy XML documents.

Key words: XML,Keyword,Approximate query,Fuzzy,Possibility

[1] XU Y,PAPAKONSTANTINOU Y.Efficient Keyword Search for Smallest LCAs in XML Databases[C]∥Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data.New York:ACM Press,2005:527-538.
[2] GUO L,SHAO F,BOTEV C,et al.XRANK:Ranked Keyword Search over XML Documents[C]∥Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data.New York:ACM Press,2003:16-27.
[3] LI G L,FENG J H,WANG J Y,et al.Effective Keyword Search for Valuable LCAs over XML Documents[C]∥Proceedings of the sixteenth ACM Conference on Information and Knowledge Management.New York:ACM Press,2007:31-40.
[4] HRISTIDIS V,KOUDAS N,PAPAKONSTANTINOU Y,et al.Keyword Proximity Search in XML Trees[J].IEEE Transactions on Knowledge and Data Engineering,2006,18(4):525-539.
[5] BHALOTIA G,HULGERI A,NAKHE C,et al.Keyword Sear-ching and Browsing in Databases using BANKS[C]∥Procee-dings of 18th International Conference on Data Engineering.New York:IEEE Press,2002:431-440.
[6] LI J,LIU C,ZHOU R,et al.Top-k Keyword Search over Probabilistic XML Data [C]∥Proceedings of 2011 IEEE 27th International Conference on Data Engineering.New York:IEEE Press,2011:673-684.
[7] ZHOU R,LIU C,LI J,et al.ELCA Evaluation for KeywordSearch on Probabilistic XML Data[J].World Wide Web,2013,16(2):171-193.
[8] MA Z M,LIU J,YAN L.Matching Twigs in Fuzzy XML[J].Information Sciences,2011,181(1):184-200.
[9] LIU J,MA Z M,MA R Z.Efficient Processing of Twig Query with Compound Predicates in Fuzzy XML[J].Fuzzy Sets and Systems,2013,229:33-53.
[10] MA Z M,YAN L.Fuzzy XML Data Modeling with the UML and Relational Data Models[J].Data & Knowledge Enginee-ring,2007,63(3):972-996.
[11] DBLP[EB/OL].http://dblp.uni-trier.de/xml.
[12] LI T,MA Z M.Keyword Querying of Fuzzy XML[J].Journal of Northeastern University:Natural Science,2016,37(7):937-941.(in Chinese) 李婷,马宗民.模糊XML关键字查询方法[J].东北大学学报:自然科学版,2016,37(7):937-941.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!