loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Mashing Up Search Services
September/October 2008 (vol. 12 no. 5)
pp. 16-23
ASCII Text
x 
 
Daniele Braga, Stefano Ceri, Florian Daniel, Davide Martinenghi, "Mashing Up Search Services," IEEE Internet Computing, vol. 12, no. 5, pp. 16-23, September/October, 2008.
 
 
BibTex
x
 
@article{ 10.1109/MIC.2008.105,
author = {Daniele Braga and Stefano Ceri and Florian Daniel and Davide Martinenghi},
title = {Mashing Up Search Services},
journal ={IEEE Internet Computing},
volume = {12},
number = {5},
issn = {1089-7801},
year = {2008},
pages = {16-23},
doi = {http://doi.ieeecomputersociety.org/10.1109/MIC.2008.105},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - MGZN
JO - IEEE Internet Computing
TI - Mashing Up Search Services
IS - 5
SN - 1089-7801
SP16
EP23
EPD - 16-23
A1 - Daniele Braga,
A1 - Stefano Ceri,
A1 - Florian Daniel,
A1 - Davide Martinenghi,
PY - 2008
KW - Service mashups
KW - Web search
KW - Web service registration
KW - Web service orchestration
KW - query optimization
KW - Web services
VL - 12
JA - IEEE Internet Computing
ER -
 
Daniele Braga, Politecnico di Milano
Stefano Ceri, Politecnico di Milano
Florian Daniel, University of Trento, Italy
Davide Martinenghi, Politecnico di Milano
Mashup languages offer new graphic interfaces for service composition. Normally, composition is limited to simple services, such as RSS or Atom feeds, but users can potentially use visual mashup languages for complex service compositions, with typed parameters and well-defined I/O interfaces. Composing search services introduces new issues, however, such as determining the optimal sequence of search invocations and separately composing ranked entries into a globally ranked result. Enabling end users to mash up services through suitable abstractions and tools is a viable option for improving service-based computations.

1. M. Altinel et al., "Damia: A Data Mashup Fabric for Intranet Applications," Proc. 33rd Int'l Conf. Very Large Databases (VLDB), 2007, ACM Press, pp. 1370–1373.
2. E. Rahm and P.A. Bernstein, "A Survey of Approaches to Automatic Schema Matching," The Very Large Databases J., vol. 10, no. 4, 2001, pp. 334–350.
3. E.M. Maximilien et al., "A Domain-Specific Language for Web APIs and Services Mashups," Proc. Int'l Conf. Service Oriented Computing (ICSOC), Springer, 2007, pp. 13–26.
4. D. Braga et al., "NGS: A Framework for Multi-Domain Query Answering," Proc. Workshop Information Integration Methods, Architectures, and Systems (IIMAS), IEEE CS Press, 2008, pp. 254–261.
5. A. Calì and D. Martinenghi, "Querying Data under Access Limitations," Proc. Int'l Conf. Data Eng. (ICDE), IEEE CS Press, 2008, pp. 50–59.
6. D. Braga et al., "Joining the Results of Heterogeneous Search Engines," to be published in Information Systems.
7. U. Srivastava et al., "Query Optimization over Web Services," Proc. 32nd Int'l Conf. Very Large Databases (VLDB), 2006, ACM Press, pp. 355–366.
8. F. Daniel and B. Pernici, "Insights into Web Service Orchestration and Choreography," Int'l J. E-Business Research, vol. 2, no. 1, 2006, pp. 58–77.

Index Terms:
Service mashups, Web search, Web service registration, Web service orchestration, query optimization, Web services
Citation:
Daniele Braga, Stefano Ceri, Florian Daniel, Davide Martinenghi, "Mashing Up Search Services," IEEE Internet Computing, vol. 12, no. 5, pp. 16-23, Sep./Oct. 2008, doi:10.1109/MIC.2008.105
Usage of this product signifies your acceptance of the Terms of Use.