Search and result presentation in scientific workflow repositories

Susan B. Davidson, Xiaocheng Huang, Julia Stoyanovich, Xiaojie Yuan

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    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 context- free bag grammars. We then give efficient polynomial-time algorithms that, given a workflow and a keyword query, de- termine 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 gram- mars 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.

    Original languageEnglish (US)
    Title of host publicationSSDBM 2013 - Proceedings of the 25th International Conference on Scientific and Statistical Database Management
    DOIs
    StatePublished - 2013
    Event25th International Conference on Scientific and Statistical Database Management, SSDBM 2013 - Baltimore, MD, United States
    Duration: Jul 29 2013Jul 31 2013

    Publication series

    NameACM International Conference Proceeding Series

    Other

    Other25th International Conference on Scientific and Statistical Database Management, SSDBM 2013
    CountryUnited States
    CityBaltimore, MD
    Period7/29/137/31/13

    ASJC Scopus subject areas

    • Software
    • Human-Computer Interaction
    • Computer Vision and Pattern Recognition
    • Computer Networks and Communications

    Fingerprint Dive into the research topics of 'Search and result presentation in scientific workflow repositories'. Together they form a unique fingerprint.

    Cite this