ACM Home Page
Please provide us with feedback. Feedback
A first study on strategies for generating workflow snippets
Full text PdfPdf (1.03 MB)
Source
International Conference on Management of Data archive
Proceedings of the First International Workshop on Keyword Search on Structured Data table of contents
Providence, Rhode Island
SESSION: Keyword search algorithms table of contents
Pages 15-20  
Year of Publication: 2009
ISBN:978-1-60558-570-3
Authors
Tommy Ellkvist  Linköping University
Lena Strömbäck  Linköping University
Lauro Didier Lins  University of Utah
Juliana Freire  University of Utah
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGMOD: ACM Special Interest Group on Management of Data
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 39,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1557670.1557678
What is a DOI?

ABSTRACT

Workflows are increasingly being used to specify computational tasks, from simulations and data analysis to the creation of Web mashups. Recently, a number of public workflow repositories have become available, for example, myExperiment for scientific workflows, and Yahoo! Pipes. Workflow collections are also commonplace in many scientific projects. Having such collections opens up new opportunities for knowledge sharing and re-use. But for this to become a reality, mechanisms are needed that help users explore these collections and locate useful workflows. Although there has been work on querying workflows, not much attention has been given to presenting query results. In this paper, we take a first look at the requirements for workflow snippets and study alternative techniques for deriving concise, yet informative snippets.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
A. C. Gilbert and K. Levchenko. Compressing network graphs. In LinkKDD workshop, August 2004.
 
4
A. Goderis, U. Sattler, P. Lord, and C. Goble. Seven bottlenecks to workflow reuse and repurposing. LNCS, 3729:323, 2005.
5
 
6
R. Karp. Reducibility among combinatorial problems, 85--103. In Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, 1972.
 
7
Kepler. http://kepler-project.org.
 
8
 
9
myExperiment. http://www.myexperiment.org.
 
10
The Pegasus Project. http://pegasus.isi.edu.
 
11
 
12
 
13
14
 
15
 
16
Swift. http://www.ci.uchicago.edu/swift.
 
17
Taverna. http://taverna.sourceforge.net.
18
 
19
 
20
VisTrails. http://www.vistrails.org.
 
21
VTK. http://www.vtk.org.
 
22
X. Xiang and G. Madey. Improving the reuse of scientific workflows and their by-products. In IEEE ICWS, pages 792--799, 2007.
 
23
Yahoo! Pipes. http://pipes.yahoo.com.
24

Collaborative Colleagues:
Tommy Ellkvist: colleagues
Lena Strömbäck: colleagues
Lauro Didier Lins: colleagues
Juliana Freire: colleagues