期刊文献+

面向top-K分级的数据库关键词查询系统体系结构 被引量:1

Top-K-oriented hierarchical keyword-based information query system architecture over databases
下载PDF
导出
摘要 关系数据库关键词查询系统目前存在的主要问题是查询效率不高、查询效果不令人满意,其根源在于查询系统的体系结构不合理。提出了一种新型的面向top-分级的数据库关键词查询系统体系结构,并用提出的新的评分函数公式、基于索引的候选网络预处理方法、绑定实时过滤阈值的top-搜索算法对该体系结构进行实例化。结果显示该系统结构具有很好的可行性,并且由实例化后的体系结构实现的系统具有很好的查询性能。 It is the irrational system architecture that leads to the problems of inefficient retrieval and unsatisfied query results (in keyword query system over relational database). In order to solve the above two problems, in this paper, a top-k-oriented hierarchical keyword-based information retrieval system architecture over databases is initiated. Such an architecture is instantiated by the evaluation formula, preparation technique of index-based candidate network and top-k query algorithm of binding real-time threshold illtration. The results verify the great feasibility of this architecture. Furthermore, the query system based on this architecture can achieve good query performance.
出处 《燕山大学学报》 CAS 2010年第1期67-73,94,共8页 Journal of Yanshan University
基金 国家自然科学基金资助项目(60773100) 国家"十一五"科技支撑计划资助项目(2006BAK05BO2)
关键词 关系数据库 关键词 索引 TOP-K relational database keyword index top-k
  • 相关文献

参考文献9

  • 1文继军,王珊.SEEKER:基于关键词的关系数据库信息检索[J].软件学报,2005,16(7):1270-1281. 被引量:45
  • 2Bhalotia G, Hulgeri A, Nakhe C, et al.. Keyword searching and browsing in databases using BANKS [C] //The 18th International Conference on Data Engineering, San Jose, Canada, 2002: 431-440.
  • 3Kacholia V, Pandit S, Chakrabarti S, et al.. Bidirectional expansion for keyword search on graph databases [C]//The 31 st International Conference on Very Large Data Bases, Trondheim, Norway, 2005: 505-516.
  • 4Lu Q, Jeffrey X, Yu F, et al.. Querying communities in relational databases [C] //Proc of International Conference on Data Engineering, Washington D C: IEEE Computer Society, 2009: 724-735.
  • 5Hristidis V, Gravano L, Papakonstantinou Y. Efficient IR-style keyword search over relational databases [C] //The 29th International Conference on Very Large Data Bases, Berlin, 2003:850-861.
  • 6Luo Y, Lin X M, Wang W, et al.. Spark: top-k keyword query in relational databases [C]//The 2007 ACM SIGMOD International Conference on Management of Data, Beijing, 2007:115-126.
  • 7Luo Y, Wang W, Lin X M. SPARK: a keyword search engine on relational databases [C] //The 24th International Conference on Data Engineering, Canctin, Mexico, 2008: 1552-1555.
  • 8Zhang J, Peng Z H, Wang S. QuickCN: a combined approach for efficient keyword search over databases[C]//The 12th International Conference on Database Systems for Advanced Applications, Bangkok, Thailand, 2007: 1032-1035.
  • 9The DBLP Computer Science Bibliography [DB/OL] http: // dblp. uni-trier. de/.

二级参考文献15

  • 1Oracle text. 2004. http://otn.oracle.com/products/text/index.html
  • 2DB2 text information extender. 2004. http://www-3.ibm.com/software/data/db2/extenders/textinformation/index.html
  • 3SQL server full-text query. 2004. http://msdn.microsoft.com/library/default.asp-url=/library/en-us/architec/8_ar_sa2_0ehx.asp
  • 4Halotia G, Hulgeri A, Nakhey C, Chakrabarti S, Sudar-Shan S. Keyword searching and browsing in databases using BANKS. In: Agrawal R, et al., eds. Proc. of the 18th Int'l Conf. on Data Engineering. San Jose: IEEE Press, 2002. 431-440.
  • 5Agrawal S, Chaudhuri S, Das G. DBXplorer: A system for keyword-based search over relational databases. In: Agrawal R, et al., eds. Proc. of the 18th Int'l Conf. on Data Engineering. San Jose: IEEE Press, 2002. 5-16.
  • 6Hristidis V, Papakonstantinou Y. DISCOVER: Keyword search in relational databases. In: Bernstein PA, et al., eds. Proc. of the 28th Int'l Conf. on Very Large Data Bases. Hong Kong: Morgan Kaufmann Publishers, 2002. 670-681.
  • 7Hristidis V, Gravano L, Papakonstantinou Y. Efficient IR-style keyword search over relational databases. In: Freytag JC, et al., eds. Proc. of the 29th Int'l Conf. on Very Large Data Bases. Berlin: Morgan Kaufmann Publishers, 2003. 850-861.
  • 8Su Q, Widom J. Indexing relational database content offline for efficient keyword-based search. Technical Report, Stanford: Stanford University, 2003. http://dbpubs.stanford.edu/pub/2003-13
  • 9Balmin A, Hristidis V, Papakonstantinou Y. ObjectRank: Authority-Based keyword search in databases. In: Nascimento MA, et al., eds. Proc. of the 30th Int'l Conf. on Very Large Data Bases. Toronto: Morgan Kaufmann Publishers, 2004. 564-575.
  • 10Goldman R, Shivakumar N, Venkatasubramanian S, Garcia-Molina H. Proximity search in databases. In: Gupta A, et al., eds. Proc. of the 24th Int'l Conf. on Very Large Data Bases. New York: Morgan Kaufmann Publishers, 1998. 564-575.

共引文献44

同被引文献5

  • 1Anish Das Sarma,Omar Benjelloun,Alon Halevy,Shubha Nabar,Jennifer Widom.Representing uncertain data: models, properties, and algorithms[J]. The VLDB Journal . 2009 (5)
  • 2Dan Olteanu,Christoph Koch,Lyublena Antova.World-set decompositions: Expressiveness and efficient algorithms[J]. Theoretical Computer Science . 2008 (2)
  • 3Catriel Beeri,Philip A. Bernstein.Computational problems related to the design of normal form relational schemas[J]. ACM Transactions on Database Systems (TODS) . 1979 (1)
  • 4周傲英,金澈清,王国仁,李建中.不确定性数据管理技术研究综述[J].计算机学报,2009,32(1):1-16. 被引量:185
  • 5王意洁,李小勇,祁亚斐,孙伟东.不确定数据查询技术研究[J].计算机研究与发展,2012,49(7):1460-1466. 被引量:17

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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