2010 · 63 citations · 6 references
ComputingInformation SystemsBusiness Process ManagementDatabasesKnowledge RepresentationProcess ArchitectureProcess ModelingQuery OptimizationQuery ProcessingStructured Query LanguageVisual QueryingBusiness Process NotationGraph-based QueryingProcess Model MatchingRelational Query ProcessingSemantic Query ExpansionSimilarity ReasoningVisual Query InterfacesVisual Query Languages
We present a framework for querying and reusing graph-based business process models. The framework is based on a new visual query language for business processes called BPMN-Q. The language addresses processes definitions and extends the standard BPMN visual notations for modeling business processes for its concrete syntax. BPMN-Q is used to query process models by matching a process model graph to a query graph. Moreover, the reusing framework is enhanced with a semantic query expander component. This component provides the users with the flexibility to get not only the perfectly matched process models to their queries but also the models with high similarity. The query engine of the framework is built on top of traditional RDBMS. A novel decomposition based and selectivity-aware relational processing mechanism is employed to achieve an efficient and scalable performance for graph-based BPMN-Q queries.
6
A vector space model for automatic indexing
Gerard Salton, Anita M.-Y. Wong, Chul‐Su Yang · Communications of the ACM · 1975 · 7.4K citations · Full text
BPMN-Q: A Language to Query Business Processes
Ahmed Awad · 2007 · 137 citations
Business, Information Systems, Business Process Management +9
Sorting And Indexing With Partitioned B-Trees
Goetz Graefe · 2003 · 113 citations
Torsten Grust, Manuel Mayr, Jan Rittinger et al. · 2007 · 30 citations
Dependable cardinality forecasts for XQuery
Jens Teubner, Torsten Grust, Sebastian Maneth et al. · Proceedings of the VLDB Endowment · 2008 · 29 citations