期刊文献+

关系数据库的纠错性关键词查询研究

Error-Correction Key-Word Retrieval on Relational Database
下载PDF
导出
摘要 提出一种在关系数据库文本字段上进行关键词查询的方法,以解决当输入的关键词有误时,也能查找到期望的查询结果.问题的解决方案是,建立一个"热词库",对K-差别近似串匹配中的动态规划算法进行改进,使误输入的关键词组和"热词"进行匹配,从而实现关系数据库的纠错性查询.通过实验验证,本解决方案具有良好的查询性能. This paper proposes a key-word query approach basing on relational database text field,aiming to search the expected result despite the wrongly input key words.The solution is to match the wrongly input key word and the"hot word"by setting up a"hot word database"to improve the dynamic programming algorithim in K-difference approximately string matching,so as to realize the relational database's error correction query.Experimental results show that this approach can achieve good retrieval performance.
出处 《微电子学与计算机》 CSCD 北大核心 2014年第12期132-135,139,共5页 Microelectronics & Computer
基金 广西壮族自治区教育厅科研项目(200911LX348 201204LX349 2013YB202 广西新世纪高等教育教学改革工程项目)
关键词 关系数据库 近似串匹配 编辑距离 元组连接树 relational database approximately string matching edit distance tuple tree
  • 相关文献

参考文献8

  • 1Bhalotia G, Hulgeri A, Nakhey C, et al. Keyword searching and browsing in database using BANKS[C] //ICDE, San Jose: IEEE, 2002 : 431-440.
  • 2Agrawal S, Chaudhuri S, Das G. DBXplorer: A sys- tem for keyword-based search over relational databases [C]// ICDE,San Jose: IEEE,2002: 5-16.
  • 3Hristidis V, Papakonstantinou Y. DISCOVER: Key- word search in relational databases [C]// Proceedings of the Int'l Conf on Very Large Data Bases. hernstein PA: IEEE, 2002 : 670-681.
  • 4Hristidis V, Gravano L, Papakonstantinou Y. Effi- cient IR-style keyword search over relational databases [C] // VLDB, Berlin: IEEE, 2003 : 850-861.
  • 5Hristidis V, Gravano L, Papakonstantinou Y. Effi- cient IR-style keyword search over relational databases[C] //VLDB, Berlin: IEEE, 2003: 850-861.
  • 6文继军,王珊.SEEKER:基于关键词的关系数据库信息检索[J].软件学报,2005,16(7):1270-1281. 被引量:46
  • 7钟诚,陈国良.PRAM和LARPBS模型上的近似串匹配并行算法[J].软件学报,2004,15(2):159-169. 被引量:19
  • 8Jianhua Feng, Guoliang Li, Jianyong Wang. Finding top-k answers in keyword search over relational data- bases using tuple units. [J]. Compute Sei Teehnol, 2011(9) :482-501.

二级参考文献25

  • 1Park JH,George KM.Efficient parallel hardware algorithms for string matching.Microprocessors and Microsystems,1999,23(3):155-168.
  • 2Lester B.The Art of Parallel Programming.Englewood Cliffs:Prentice Hall,1993.
  • 3Alan AB,Mei A.A residue number system on reconfigurable mesh with applications to prefix sums and approximate string matching.IEEE Trans.on Parallel and Distributed Systems,2000,11(11):1186-1199.
  • 4Pan Y,Li Y,Li J,LI K,Zheng SQ.Efficient parallel algorithms for distance maps of 2-D binary images using an optical bus.IEEE Trans.on Systems,Man,and Cybernetics-Part A:Systems and Humans,2002,32(2):228-236.
  • 5Han Y,Pan Y,Shen H.Sublogarithmic deterministic selection on arrays with a reconfigurable optical bus.IEEE Trans.on Computers,2002,51(6):702-706.
  • 6Navarro G.A guided tour to approximate string matching.ACM Computing Surveys,2001,33(1):31-88.
  • 7Navarro G,Baeza-Yates R.A hybrid indexing method for approximate string matching.Journal of Discrete Algorithms,2000,1(1):21-49.
  • 8Lee H-C,Ercal F.RMESH algorithms for parallel string matching.In:Proc.of the 3rd Int'l.Symp.on Parallel Architectures,Algorithms,and Networks(I-SPAN'97).Los Alamitos:IEEE Computer Society Press,1997.223~226.http://ieeexplore.ieee.org/ xpl/tocresult.jsp?i
  • 9Jiang Y,Wright AH.O(k)parallel algorithms for approximate string matching.Journal of Neural Parallel and Scientific Computation,1993,1:443-452.
  • 10Amir A,Landau GM.Fast parallel and serial multidimensional approximate array matching.Theoretical Computer Science,1991,81(1):97-115.

共引文献63

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部