基于循环策略和动态知识的deep Web数据获取方法

doi:1000-436X(2012)10-0035-09

Journal on Communications ›› 2012, Vol. 33 ›› Issue (10): 35-43.doi: 1000-436X(2012)10-0035-09

• Papers • Previous Articles Next Articles

Approach to deep Web data acquiring based on circular strategy and dynamic knowledge

Xue-feng XIAN^1,²,Zhi-ming CUI^1,²,Peng-peng ZHAO^1,²,Yin-hong LIANG^2,³,Li-gang FANG^2,³

¹ The Institute of Intelligent Information Processing and Application,Soochow University,Suzhou 215006,China
² JiangSu Province Support Software Engineering R＆D Center for Modern Information Technology Application in Enterprise,Suzhou 215104,China
³ Suzhou Vocational University,Suzhou 215000,China

Online:2013-10-25 Published:2017-07-22
Supported by:
The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Natural Science Foundation of Jiangsu;The Natural Science Foundation of Jiangsu College;Jiangsu Province Support Software Engineering R＆D Center for Information Technology Application in Enterprise;Jiangsu Province Support Software Engineering R＆D Center for Information Technology Application in Enterprise

Abstract

Abstract:

Concerning on the acquisition problems on deep Web data integration such as high cost and low efficiency of query selecting,a novel deep Web data acquiring method was proposed based on circular strategy and dynamic knowledge.According to the relationship between deep Web data sources from the same domain,the circulation strategic acquisition of data source in batches was applied in such method,as well as a designed method of query selecting on dynamic knowledge based on integrated systematic.Compared with current,the method reduces the acquisition cost and with more accuracy.Experimental results show that the method can raise the acquisition efficiency of deep Web data integration.

Key words: deep Web, data integration, data acquisition, dynamic knowledge, query selectio

Xue-feng XIAN,Zhi-ming CUI,Peng-peng ZHAO,Yin-hong LIANG,Li-gang FANG. Approach to deep Web data acquiring based on circular strategy and dynamic knowledge[J]. Journal on Communications, 2012, 33(10): 35-43.

Figures/Tables 4

References 13

[1]	MICHAEL K B . The deep Web:surfacing hidden value[J]. Journal of Electronic Publishing, 2001 7(1): 1174-1175.
[2]	HE B , PATEL M , ZHANG Z , CHANG K C C . Accessing the deep Web:a survey[J]. Communications of the ACM, 2007,50(5): 94-101.
[3]	刘伟, 孟小峰, 孟卫一 . deep Web 数据集成研究综述[J]. 计算机学报, 2007,30(9): 1475-1489. LIU W , MENG X F , MENG W Y . A survey of deep Web data integration[J]. Chinese Journal of Computers, 2007,30(9): 1475-1489.
[4]	NAN Z , GAUTAM D . Exploration of deep Web repositories[A]. Proceedings of the 37th International Conference on Very Large Data Bases[C]. Tutorial,Westin,Seattle,WA, 2011.
[5]	JAYANT M , SHAWN J , SHIRLEY C ,et al. Web-scale data integration:you can afford to pay as you go[A]. Proceedings of 3rd International Conference Innovative Data Systems Research[C]. Asilomar,CA, 2007. 342-350.
[6]	LUCIANO B , JULIANA F . Siphoning hidden-Web data through keyword-based interfaces[A]. Proceedings of the 19th Brazilian Symposium on Database[C]. Brasilia,Brazil, 2004. 309-321.
[7]	WU P , WEN J R , LIU H ,et al. Query selection techniques for efficient crawling of structured Web sources[A]. Proceedings of the 22th International Conference on Data Engineering[C]. Atlanta,GA,USA, 2006. 47-56.
[8]	NTOULAS A , ZERFOS P , CHO J H . Downloading textual hidden web content by keyword queries[A]. Proceedings of the Joint Conference on Digital Libraries[C]. Denver,Colorado,USA, 2005. 100-109.
[9]	JAYANT M , DAVID K , LUCJA K ,et al. Google's deep-Web crawl[A]. Proceedings of 34th International Conference on Very Large Data Bases[C]. Auckland,New Zealand,Springer, 2008. 1241-1252.
[10]	JIANG L , WU Z H , FENG Q ,et al. Efficient deep Web crawling Using reinforcement learning[A]. Proceedings of the 14th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining[C]. Hyderabad,India,Springer, 2010. 428-439.
[11]	GEORGE V , ALEXANDROS N , DIMITRIOS G . Rank-aware crawling of hidden Web sites[A]. Proceedings of the International Workshop on the Web and Databases[C]. Athens,Greece, 2011.
[12]	XIAN X F , ZHAO P P , YANG Y F ,et al. Efficient selection and integration of hidden Web database[J]. Journal of Computers, 2010,5(3): 500-507.
[13]	ARJUN D , Xin J , BRADLEY J ,et al. Unbiased estimation of size and other aggregates over hidden Web databases[A]. Proceedings of the ACM SIGMOD International Conference on Management of Data,Indianapolis[C]. Indiana,USA,ACM Press, 2010. 855-866.

Metrics

Recommended 0

No Suggested Reading articles found!

Approach to deep Web data acquiring based on circular strategy and dynamic knowledge

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 4

References 13

Related Articles 4

Metrics

Recommended 0

[1]	Zhi-ming CUI,Peng-peng ZHAO,Xue-feng XIAN,Li-gang FANG,Yuan-feng YANG,Cai-dong GU. Deep Web new data discovery strategy based on the graph model of data attribute value lists [J]. Journal on Communications, 2016, 37(3): 20-32.
[2]	Tian-ping LAI,Su-mei WANG,Yi-ming PENG,Miao SHEN,Zhi-tong GAO. Research and implementation of college students full information inquiry common information model [J]. Journal on Communications, 2014, 35(Z1): 165-169.
[3]	. Research and implementation of college students full information inquiry common information model [J]. Journal on Communications, 2014, 35(Z1): 32-169.
[4]	Jie XIN,Zhi-ming CUI,Peng-peng ZHAO,Guang-ming ZHANG,Xue-feng XIAN. Applying MapReduce frameworks to a virtualization platform for Deep Web data source discovery [J]. Journal on Communications, 2011, 32(7): 189-195.