期刊文献+

基于数据网格面向服务的查询算法 被引量:8

Service-Oriented Search Algorithm on Data Grid
在线阅读 下载PDF
导出
摘要 面向服务的框架(SOA)为用户的服务提供了一个标准的平台,实现服务的提供、发现、配置和集成,以帮助用户查询和处理信息.数据网格是面向服务的架构,为用户进行分布式远程数据查询服务提供了保障.对网格环境下Hidden Web数据库的研究与开发逐渐成为人们关注的焦点问题.要回答用户的查询,数据集成系统需要解决网格上的需求语义分析和关键字查询、建立数据查询模型.将数据库抽象为无向图,节点对应数据库中的元组,边对应“主-外码”的关系.查询的结果是与元组连接的答案树,它与查询的关键字相匹配.针对以上这些问题提出了一个新的查询算法,将改进的动态规划算法用于查询模型,保证Top-1答案树最优,Top-K答案树近似最优,给出了实验测试和评估结果. A service-oriented architecture provides a standards-based platform that allows services to be provided, discovered, configured and integrated, to facilitate the creation of a business process. Data Grid is a service-oriented architecture that provides the coordinated search services for data distributed across remote resources. Research and development activities relating to the Grid have generally focused on application where data is stored in database which is called Hidden Web. To answer user queries, a data integration system employs a set of request semantic analyzing, keywords searching and model creating on Grid. This paper presents a novel model of searching, which the database is an undirected graph, of which each node correspond to a tuple of the database, and each edge correspond to a "primary key-foreign key" link. Results to a query are modeled as answer trees connecting tuples that match individual keywords in the query. This paper also presents a novel and efficient searching algorithm of dynamic programming, and the algorithm is employed in authors model to ensure the Top-1 answer tree optimal and Top-K answer trees nearly optimal. Finally, the algorithm's performance is tested and evaluated.
出处 《计算机学报》 EI CSCD 北大核心 2006年第7期1234-1240,共7页 Chinese Journal of Computers
基金 本课题得到国家自然科学基金(60473069) 教育部下一代互联网示范工程项目基金(CNGI-04-15-7A) 中国人民大学科研基金(30206102.202.307)资助
关键词 网格计算 SOA数据集成 动态规划 查询算法 grid computing SOA data integrating dynamic programming searching algorithm
  • 相关文献

参考文献1

二级参考文献33

  • 1Hristidis V, Gravano L, Papakonstantinou Y. Efficient IR-style keyword search over relational databases. In Proc. the 29th Int. Conf. Very Large Data Bases, 2003.
  • 2Dixon P. Basics of Oracle text retrieval. IEEE Data Engineering Bulletin, 2001, 24(4): 11-14.
  • 3Maier A, Simmen D. DB2 optimization in support of full text search. IEEE Data Engineering Bulletin, 2001, 24(4): 3-6.
  • 4Hamilton J, Nayak T. Microsoft SQL Server full-text search.IEEE Data Engineering Bulletin, 2001, 24(4): 7-10.
  • 5Balmin A, Hristidis V, Papakonstantinou Y. ObjectRank:Authority-based keyword search in databases.In Proc.the 30th Int.Conf.Very Large Data Bases,2004
  • 6Brin S, Page L. The anatomy of a large-scale hyper-textual web search engine. In Proc. 7th Int. WWW Conference, 1998.
  • 7Dar S, Entin G, Geva S, Palmon E. DTL's dataSpot: Database exploration using plain language. In Proc. the 24th International Conference on Very Large Data Bases, 1998.
  • 8Goldman R, Shivajumar N, Venkatasubramanian S, Garcia-Molina H. Proximity search in databases. In Proc. the 24th International Conference on Very Large Data Bases, 1998.
  • 9Wheeldon R, Levene M, Keenoy K. DbSurfer: A search and navigation tool for relational databases. In Proc. the 21st Annual British National Conference on Databases, 2004.
  • 10Sarda N L, Jain A. Mragyati: A system for keyword-based searching in databases. Report No. cs.DB/011052 on CORR,2001.

共引文献15

同被引文献47

引证文献8

二级引证文献62

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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