Please wait a minute...
New Technology of Library and Information Service  2010, Vol. 26 Issue (11): 24-29    DOI: 10.11925/infotech.1003-3513.2010.11.04
article Current Issue | Archive | Adv Search |
Study on Data Mashup Model
Li Feng1, Li Chunwang2, Sun Yuanyuan1
1. Beijing Normal University Library, Beijing 100875, China;
2. National Science Library, Chinese Academy of Sciences, Beijing 100190, China
Download: PDF(451 KB)   HTML  
Export: BibTeX | EndNote (RIS)      

This paper analyzes the needs of scientific researchers towards cross-domain research results and weaknesses of data mashup model at present, and designs a data mashup model.Then it develops an experiment system to present how data mashup model supports the design and development of cross-domain search system.

Key wordsMashup      Cross-domain search      Data mashup model     
Received: 08 October 2010      Published: 04 January 2011



Cite this article:

Li Feng, Li Chunwang, Sun Yuanyuan. Study on Data Mashup Model. New Technology of Library and Information Service, 2010, 26(11): 24-29.

URL:     OR

[1] Ikeda S, Nagamine T, Kamada T. Application Framework with Demand-driven Mashup for Selective Browsing
[C]. In:Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services,iiWAS2008.2008:33-40.

[2] Simmen D E,Altinel M,Markl V,et al. Damia:Data Mashups for Intranet Applications
[C]. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data. 2008:1171-1182.

[3] Kongdenfha W,Benatallah B,Vayssière J,et al. Rapid Development of Spreadsheet-based Web Mashups
[C]. In:Proceedings of the 18th International Conference on World Wide Web. 2009:851-860.
[2009-07-28]. /p851.pdf.

[4] Wang G L, Yang S H,Han Y B. Mashroom: End-User Mashup Programming Using Nested Tables
[C]. In:Proceedings of the 18th International Conference on World Wide Web.2009:861-870.
[2009-07-28]. /proceedings/pdf/p861.pdf.

[5] 数据模型

[6] 工作流过程定义接口—XML Process Definition Language工作流管理联盟工作流标准

[7] iSpecies

[1] Zhong Yuanxin, Li Tianzhang, Liu Wei. A Research on Linked Data Mashup in OPAC[J]. 现代图书情报技术, 2013, (4): 25-29.
[2] Li Dan, Yan Xiaodi, Wei Qingshan. Application of Mashup in Library Based on Drupal[J]. 现代图书情报技术, 2013, 29(10): 79-84.
[3] Zhao Lin, Hu Jianhong. Integration of Huiwen OPAC and E-reading——Take Library of Hunan Institute of Science and Technology for Example[J]. 现代图书情报技术, 2013, 29(1): 90-94.
[4] Ji Shanshan, Li Chunwang. Study on Context-aware Service Mashup Implementation[J]. 现代图书情报技术, 2012, (12): 21-26.
[5] Li Chunwang, Fei Dayu, Zhou Qiang. Study on Mashup Workflow Engine[J]. 现代图书情报技术, 2012, (12): 27-31.
[6] Huang Mingrui, Wang Hua, Zhang Qing, Jiang Xiling, Fan Bing. Study on the iLibrary Applications for CEODE-CAS[J]. 现代图书情报技术, 2012, (10): 72-76.
[7] Deng Lanlan, Li Chunwang. Study on Linkage Creation Strategies of Web Data[J]. 现代图书情报技术, 2011, 27(5): 1-6.
[8] Zeng Manjiang, Li Yongwen. Building Digital Library Portal with Mashup-based Lightweight Application Integration Framework[J]. 现代图书情报技术, 2011, 27(3): 88-93.
[9] Wang Ke, Ji Shanshan, Liu Fang, Liu Yuanyuan, Deng Lanlan, Li Chunwang. iLibrary:Presentation Layer Mashup Service and System Implementation[J]. 现代图书情报技术, 2010, 26(11): 30-36.
[10] Shen Kuilin, Du Jin. Using Mashup to Improve Library Service Ability —— Take the Combination of Douban and Nanjing University Library OPAC for Example[J]. 现代图书情报技术, 2010, 26(10): 87-90.
[11] Meng Jian,Zhang Liyi. An Integrated Model of Distributed Commodity Information Based on RESTful Web Services and Mashup[J]. 现代图书情报技术, 2010, 26(1): 15-21.
[12] Ji Shanshan,Li Yu,Zhou Qiang. Research on Mashup Tools[J]. 现代图书情报技术, 2010, 26(1): 41-45.
[13] Li Feng. Study on Technologies of Semantic Mashup[J]. 现代图书情报技术, 2010, 26(1): 46-50.
[14] Wang Mingsen,Wang Qiang. Research on the Construction of Mashup System[J]. 现代图书情报技术, 2009, 25(5): 34-38.
[15] Li Ling,Ma Lei. Implementation of Book Recommendation Service Based on Mashup[J]. 现代图书情报技术, 2009, 3(2): 107-111.
  Copyright © 2016 Data Analysis and Knowledge Discovery   Tel/Fax:(010)82626611-6626,82624938