Searching workflows with hierarchical views

Liu, Ziyang; Shao, Qihong; Chen, Yi

doi:10.14778/1920841.1920958

Cited by 8 publications

(5 citation statements)

References 32 publications

(44 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Besides presenting the techniques of supporting keyword search on relational databases, graph-structured data and XML data, we will also discuss how to support keyword search on other data models, such as data streams [57], [56], workflows [50], [65], spatial and multimedia databases [15], [84], uncertain data [40], and relationship among them.…”

Section: Tutorial Outlinementioning

confidence: 99%

Keyword-based search and exploration on databases

Chen

Wang

Liu

2011

2011 IEEE 27th International Conference on Data Engineering

Self Cite

View full text Add to dashboard Cite

Empowering users to access databases using simple keywords can relieve users from the steep learning curve of mastering a structured query language and understanding complex and possibly fast-evolving data schemas. In this tutorial, we give an overview of the state-of-the-art techniques for supporting keyword-based search and exploration on databases. Several topics will be discussed, including query result definition, ranking functions, result generation and top-k query processing, snippet generation, result clustering, result comparison, query cleaning and suggestion, performance optimization, and search quality evaluation. Various data models will be discussed, including relational data, XML data, graph-structured data, data streams, and workflows. Finally we identify the challenges and opportunities for future research to advance the field.

show abstract

Section: Tutorial Outlinementioning

confidence: 99%

Keyword-based search and exploration on databases

Chen

Wang

Liu

2011

2011 IEEE 27th International Conference on Data Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…This is the only type of search supported in current systems [OGA+05]. An improvement to this flat style of queries is to apply keyword searches on different levels of abstraction of a workflow, as recently proposed in [LSC10]; however, finding the right level of abstraction is a non trivial task in the complex and nested workflows typically used in science. On the other end of the spectrum, repositories should support full-fledged query languages encompassing predicates for searching IO-types of tasks, the topology of a workflow, keywords in the descriptions of tasks or the entire workflow, etc.…”

Section: Describing What Users Searchmentioning

confidence: 99%

Search, adapt, and reuse

Cohen-Boulakia

Leser

2011

SIGMOD Rec.

View full text Add to dashboard Cite

Over the last years, a number of scientific workflow management systems (SciWFM) have been brought to a state of maturity that should permit their usage in a production-style environment. This is especially true for the Life Sciences, but SciWFM also attract considerable attention in fields like geophysics or climate research. These developments, accompanied by the growing availability of analytical tools wrapped as (web) services, were driven by a series of very interesting promises: End users will be empowered to develop their own pipelines; reuse of services will be enhanced by easier integration into custom workflows; time necessary for developing analysis pipelines will decrease; etc. But despite all efforts, SciWFM have not yet found widespread acceptance in their intended audience. In this paper, we argue that a wider adoption of SciWFM will only be achieved if the focus of research and development is shifted from methods for developing and running workflows to searching, adapting, and reusing existing workflows. Only by this shift can SciWFM outreach to the mass of domain scientists actually performing scientific analysis -and with little interest in developing them themselves. To this end, SciWFM need to be combined with communitywide workflow repositories allowing users to find solutions for their scientific needs (coded as a workflow). In this vision paper, we show how and where such developments have already started and highlight new research questions arising.

show abstract

“…Recent work considered search in workflow repositories [10,25,30], and also argued that, because workflows can be large and complex, it is important to provide usable result presentation mechanisms. In this paper we propose a novel search and result presentation approach for complex hierarchical workflows.…”

Section: Introductionmentioning

confidence: 99%

“…Much effort [7,17,32] has been made recently to annotate scientific workflows to enable keyword search. As observed in [25], since scientific workflows are usually modeled as a three-dimensional graph structure when considering the expansions of composite modules (dashed edges in Figure 1), results on searching relational and XML data [5,24,35] or graph data [9,18,20,34] can not be easily extended. [10,25,30] consider the scenario when alternation or recursion is not present in workflows.…”

Section: Introductionmentioning

confidence: 99%

“…As observed in [25], since scientific workflows are usually modeled as a three-dimensional graph structure when considering the expansions of composite modules (dashed edges in Figure 1), results on searching relational and XML data [5,24,35] or graph data [9,18,20,34] can not be easily extended. [10,25,30] consider the scenario when alternation or recursion is not present in workflows. [23,27] consider the scenario where nodes of XML documents exist with a probability (analogous to choice), however there is no recursion.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Search and result presentation in scientific workflow repositories

Davidson

Huang

Stoyanovich

et al. 2013

Proceedings of the 25th International Conference on Scientific and Statistical Database Management

View full text Add to dashboard Cite

We study the problem of searching a repository of complex hierarchical workflows whose component modules, both composite and atomic, have been annotated with keywords. Since keyword search does not use the graph structure of a workflow, we develop a model of workflows using contextfree bag grammars. We then give efficient polynomial-time algorithms that, given a workflow and a keyword query, determine whether some execution of the workflow matches the query. Based on these algorithms we develop a search and ranking solution that efficiently retrieves the top-k grammars from a repository. Finally, we propose a novel result presentation method for grammars matching a keyword query, based on representative parse-trees. The effectiveness of our approach is validated through an extensive experimental evaluation.

show abstract

Searching workflows with hierarchical views

Cited by 8 publications

References 32 publications

Keyword-based search and exploration on databases

Keyword-based search and exploration on databases

Search, adapt, and reuse

Search and result presentation in scientific workflow repositories

Contact Info

Product

Resources

About