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 - Aug 30 2013
    Event25th International Conference on Scientific and Statistical Database Management, SSDBM 2013 - Baltimore, MD, United States
    Duration: Jul 29 2013Jul 31 2013

    Other

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

    Fingerprint

    Polynomials
    Composite materials

    ASJC Scopus subject areas

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

    Cite this

    Davidson, S. B., Huang, X., Stoyanovich, J., & Yuan, X. (2013). Search and result presentation in scientific workflow repositories. In SSDBM 2013 - Proceedings of the 25th International Conference on Scientific and Statistical Database Management [17] https://doi.org/10.1145/2484838.2484847

    Search and result presentation in scientific workflow repositories. / Davidson, Susan B.; Huang, Xiaocheng; Stoyanovich, Julia; Yuan, Xiaojie.

    SSDBM 2013 - Proceedings of the 25th International Conference on Scientific and Statistical Database Management. 2013. 17.

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

    Davidson, SB, Huang, X, Stoyanovich, J & Yuan, X 2013, Search and result presentation in scientific workflow repositories. in SSDBM 2013 - Proceedings of the 25th International Conference on Scientific and Statistical Database Management., 17, 25th International Conference on Scientific and Statistical Database Management, SSDBM 2013, Baltimore, MD, United States, 7/29/13. https://doi.org/10.1145/2484838.2484847
    Davidson SB, Huang X, Stoyanovich J, Yuan X. Search and result presentation in scientific workflow repositories. In SSDBM 2013 - Proceedings of the 25th International Conference on Scientific and Statistical Database Management. 2013. 17 https://doi.org/10.1145/2484838.2484847
    Davidson, Susan B. ; Huang, Xiaocheng ; Stoyanovich, Julia ; Yuan, Xiaojie. / Search and result presentation in scientific workflow repositories. SSDBM 2013 - Proceedings of the 25th International Conference on Scientific and Statistical Database Management. 2013.
    @inproceedings{09db05d25a954f9481129f3fcad97ebf,
    title = "Search and result presentation in scientific workflow repositories",
    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.",
    author = "Davidson, {Susan B.} and Xiaocheng Huang and Julia Stoyanovich and Xiaojie Yuan",
    year = "2013",
    month = "8",
    day = "30",
    doi = "10.1145/2484838.2484847",
    language = "English (US)",
    isbn = "9781450319218",
    booktitle = "SSDBM 2013 - Proceedings of the 25th International Conference on Scientific and Statistical Database Management",

    }

    TY - GEN

    T1 - Search and result presentation in scientific workflow repositories

    AU - Davidson, Susan B.

    AU - Huang, Xiaocheng

    AU - Stoyanovich, Julia

    AU - Yuan, Xiaojie

    PY - 2013/8/30

    Y1 - 2013/8/30

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=84883042043&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84883042043&partnerID=8YFLogxK

    U2 - 10.1145/2484838.2484847

    DO - 10.1145/2484838.2484847

    M3 - Conference contribution

    SN - 9781450319218

    BT - SSDBM 2013 - Proceedings of the 25th International Conference on Scientific and Statistical Database Management

    ER -