Publication:
Organizing, querying, and analyzing ad-hoc processes' data

dc.contributor.author Beheshti, Seyed Mehdi Reza en_US
dc.date.accessioned 2022-03-21T12:11:41Z
dc.date.available 2022-03-21T12:11:41Z
dc.date.issued 2012 en_US
dc.description.abstract Business processes are central to the operation of both public and private organizations. Recently, business world is getting increasingly dynamic as various technologies such as social media and Web 2.0 have made dynamic processes more prevalent. For example, outsourcing and the emphasis on customer service makes the use of complex, dynamic and often knowledge intensive activities an inevitable task. Ad-hoc processes, a special category of processes, have flexible underlying process definition where the control flow between activities cannot be modeled in advance but simply occurs during run time. In this dissertation, we investigate the problem of explorative querying, and analyzing of ad-hoc processes. Addressing this problem is challenging, as the information about process execution is scattered across several systems and data sources. Moreover, in many cases, there is no well-documented information on how this information is related to each other and to the overall business process of the enterprise. Enabling above-mentioned analysis requires a model and a query language for representing and querying process entities (e.g., events, artifacts, and actors), relationships among them, and the evolution of business artifacts over time. Moreover, the model should support multi-dimensional/-level views and analytics over ad-hoc processes data. To address these challenges, we present a framework, simple abstractions and a language for the explorative querying and understanding of ad-hoc processes data from various user perspectives. We propose novel abstractions, folder and path, for facilitating the analysis of ad-hoc processes data by enabling process analysts to group related entities or find patterns among entities. We present FPSPARQL (Folder-, Path-enabled SPARQL) as a language and a set of new methods for organizing, indexing and querying ad-hoc processes. We then extend FPSPARQL for analyzing the evolution of process artifact, and for analyzing cross-cutting aspects in ad-hoc processes. We introduce two concepts of timed-folder to represent evolution of artifacts over time, and activity-path to represent the process which led to artifacts. Finally, we propose a model, GOLAP, and extend FPSPARQL for online analytical processing on process graphs. The approaches presented in this dissertation have been implemented in prototype tools, and experimentally validated on synthetic and real-world datasets. en_US
dc.identifier.uri http://hdl.handle.net/1959.4/52493
dc.language English
dc.language.iso EN en_US
dc.publisher UNSW, Sydney en_US
dc.rights CC BY-NC-ND 3.0 en_US
dc.rights.uri https://creativecommons.org/licenses/by-nc-nd/3.0/au/ en_US
dc.subject.other Graph OLAP en_US
dc.subject.other Ad-hoc Business Processes en_US
dc.subject.other Graph Query Processing en_US
dc.subject.other Provenance en_US
dc.title Organizing, querying, and analyzing ad-hoc processes' data en_US
dc.type Thesis en_US
dcterms.accessRights open access
dcterms.rightsHolder Beheshti, Seyed Mehdi Reza
dspace.entity.type Publication en_US
unsw.accessRights.uri https://purl.org/coar/access_right/c_abf2
unsw.identifier.doi https://doi.org/10.26190/unsworks/16024
unsw.relation.faculty Engineering
unsw.relation.originalPublicationAffiliation Beheshti, Seyed Mehdi Reza, Computer Science & Engineering, Faculty of Engineering, UNSW en_US
unsw.relation.school School of Computer Science and Engineering *
unsw.thesis.degreetype PhD Doctorate en_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
whole.pdf
Size:
2.3 MB
Format:
application/pdf
Description:
Resource type