Computer Science ›› 2015, Vol. 42 ›› Issue (7): 234-239.doi: 10.11896/j.issn.1002-137X.2015.07.050

Previous Articles     Next Articles

Research of Keyword Search Model over RDF Data Graph

ZHENG Zhi-yun LIU Bo LI Lun WANG Zhen-fei   

  • Online:2018-11-14 Published:2018-11-14

Abstract: As huge amounts of the semantic Web data have sprung up,people are more concerned about query efficiency over RDF data graph. Retrieving RDF data graph directly by keyword matching is an area of research focus.In this paper,a retrieval model was proposed,which enables keyword search for RDF graph.First,for the improvement of query efficiency,an algorithm named ISGR (an Iterative way to SubGraph Retrieval) was proposed,in which query keywords can be matched with subgraphs from RDF data graph,and a collection of subgraphs which should be unique and maximal is got.Next,in order to solve the problems of redundant results and deviation that frequently emerge in keyword search,a mixture ranking model(SimLM) was proposed,which considers the structural information between keyword graph and result graph,and mixs statistical language model.A numbers of contrast experiments over two kinds of open source real datasets prove that the retrieval and ranking model proposed in this paper outperforms well-known techniques in the field of consistency and relevance.

Key words: RDF data graph,Keyword search,Subgraph,Similarity matrix,Statistical language model

[1] 李江华,时鹏,胡长军.本体搜索与排序方法研究综述[J].小型微型计算机系统,2013,4(10):2396-2406 Li Jiang-hua,Shi Peng,Hu Chang-jun.Overview of ontology search and ranking[J].Journal of Chinese Computer Systems,2013,34(10):2396-2406
[2] 杜方,陈跃国,杜小勇.RDF数据查询处理技术综述[J].软件学报,2013,4(6):1222-1242 Du Fang,Chen Yue-guo,Du Xiao-yong.Survey of RDF query processing techniques[J].Journal of Software,2013,24(6):1222-1242
[3] Tran T,Wang H,Rudolph S,et al.Top-k exploration of querycandidates for efficient keyword search on graph-shaped (rdf) data[C]∥IEEE 25th International Conference on Data Engineering(ICDE’09).IEEE,2009:405-416
[4] Ladwig G,Tran T.Combining query translation with query answering for efficient keyword search[M]∥The Semantic Web:Research and Applications.Springer Berlin Heidelberg,2010:288-303
[5] Bhalotia G,Hulgeri A,Nakhe C,et al.Keyword searching and browsing in databases using BANKS[C]∥Proceedings of 18th International Conference on Data Engineering,2002.IEEE,2002:431-440
[6] Zou L,zsu M T,Chen L,et al.gStore:a graph-based SPARQL query engine[J].The VLDB Journal,2013,23(4):565-590
[7] Nie Z,Ma Y,Shi S,et al.Web object retrieval[C]∥Proceedings of the 16th international conference on World Wide Web.ACM,2007:81-90
[8] Elbassuoni S,Ramanath M,Schenkel R,et al.Language-model-based ranking for queries on RDF-graphs[C]∥Proceedings of 18th ACM Conference on Information and Knowledge Management.ACM,2009:977-986
[9] Elbassuoni S,Blanco R.Keyword search over RDF graphs[C]∥Proceedings of 20th ACM International Conference on Information and Knowledge Management.ACM,2011:237-242
[10] Wernicke S.A faster algorithm for detecting network motifs[M] ∥Algorithms in Bioinformatics.Springer Berlin Heidelberg,2005:165-177
[11] Zager L A,Verghese G C.Graph similarity scoring and matching[J].Applied Mathematics Letters,2008,21(1):86-94
[12] Kleinberg J M.Authoritative sources in a hyperlinked environment[J].J ACM,1999,46(5):614-632
[13] Blondel V D,Gajardo A,Heymans M,et al.A measure of similarity between graph vertices:Applications to synonym extraction and web searching[J].SIAM review,2004,46(4):647-666
[14] Wallenstein S,Zucker C L,Fleiss J L.Some statistical methods useful in circulation research[J].Circulation Research,1980,47(1):1-9
[15] Jrvelin K,Keklinen J.IR evaluation methods for retrieving highly relevant documents[C]∥Proceedings of 23rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval.ACM,2000:41-48

No related articles found!
Full text



No Suggested Reading articles found!