Mashing up search services

被引：29

作者：

Braga, Daniele ^{[1
]}

Ceri, Stefano ^{[1
]}

Martinenghi, Davide ^{[1
]}

Daniel, Florian ^{[2
]}

机构：

[1] Politecn Milan, Dipartimento Elettron & Informaz, Milan, Italy

[2] Univ Trento, Trento, Italy

来源：

IEEE INTERNET COMPUTING | 2008年 / 12卷 / 05期

关键词：

Cities and towns; Connectors; Engines; Feeds; Optimization; Parallel processing; Pipeline processing; Query optimization; Service mashups; Web search; Web service orchestration; Web service registration; Web services;

D O I：

10.1109/MIC.2008.105

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 [计算机软件与理论]; 0835 [软件工程];

摘要：

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.

引用

页码：16 / 23

页数：8

共 8 条

[1]

[Anonymous], 2006, P VLDB

[2]

Braga D., 2008, 2008 IEEE 24th International Conference on Data Engineering Workshop (ICDE Workshop), P254, DOI 10.1109/ICDEW.2008.4498328

[3]

BRAGA D, INFORM SYST IN PRESS

[4]

Querying data under access limitations [J].

Cali, Andrea ;

Martinenghi, Davide .

2008 IEEE 24TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2008, :50-+

[5]

Insights into Web Service Orchestration and Choreography [J].

Daniel, Florian ;

Pernici, Barbara .

INTERNATIONAL JOURNAL OF E-BUSINESS RESEARCH, 2006, 2 (01) :58-77

[6]

Maximilien EM, 2007, LECT NOTES COMPUT SC, V4749, P13

[7]

A survey of approaches to automatic schema matching [J].

Rahm, E ;

Bernstein, PA .

VLDB JOURNAL, 2001, 10 (04) :334-350

[8]

[No title captured]

← 1 →