Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/8010
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hidders, Jan | - |
dc.contributor.author | KWASNIKOWSKA, Natalia | - |
dc.contributor.author | Sroka, Jacek | - |
dc.contributor.author | Tyszkiewicz, Jerzy | - |
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.date.accessioned | 2008-03-17T10:18:27Z | - |
dc.date.available | 2008-03-17T10:18:27Z | - |
dc.date.issued | 2008 | - |
dc.identifier.citation | INFORMATION SYSTEMS, 33(3). p. 261-284 | - |
dc.identifier.issn | 0306-4379 | - |
dc.identifier.uri | http://hdl.handle.net/1942/8010 | - |
dc.description.abstract | In this paper we propose DFL-a formal, graphical workflow language for dataflows, i.e., workflows where large amounts of complex data are manipulated, and the structure of the manipulated data is reflected in the structure of the workflow. It is a common extension of (1) Petri nets, which are responsible for the organization of the processing tasks, and (2) nested relational calculus, which is a database query language over complex objects, and is responsible for handling collections of data items (in particular, for iteration) and for the typing system. We demonstrate that dataflows constructed in a hierarchical manner, according to a set of refinement rules we propose, are semi-sound, i.e., initiated with a single token (which may represent a complex scientific data collection) in the input node, terminate with a single token in the output node (which represents the output data collection). In particular they never leave any "debris data" behind and an output is always eventually computed regardless of how the computation proceeds. (C) 2007 Elsevier B.V. All rights reserved. | - |
dc.language.iso | en | - |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.subject.other | DFL; Petri net; workflow system; dataflow; scientific workflow; nested relational calculus | - |
dc.title | DFL: A dataflow language based on Petri nets and nested relational calculus | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 284 | - |
dc.identifier.issue | 3 | - |
dc.identifier.spage | 261 | - |
dc.identifier.volume | 33 | - |
local.format.pages | 24 | - |
local.bibliographicCitation.jcat | A1 | - |
dc.description.notes | Warsaw Univ, Inst Informat, PL-02097 Warsaw, Poland. Univ Antwerp, Dept Math & Comp Sci, B-2020 Antwerp, Belgium. Hasselt Univ, Theoret Comp Sci Grp, Hasselt, Belgium. Transnatl Univ Limburg, Limburgerhof, Germany.Sroka, J, Warsaw Univ, Inst Informat, Ul Banacha 2, PL-02097 Warsaw, Poland.jan.hidders@ua.ac.be natalia.kwasnikowska@uhasselt.be sroka@minuw.edu.pl jty@mimuw.edu.pl jan.vandenbussche@uhasselt.be | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.bibliographicCitation.oldjcat | A1 | - |
dc.identifier.isi | 000253621500001 | - |
dc.identifier.url | http/dx.doi.org/10.1016/j.is.2007.09.002 | - |
item.accessRights | Closed Access | - |
item.contributor | Hidders, Jan | - |
item.contributor | KWASNIKOWSKA, Natalia | - |
item.contributor | Sroka, Jacek | - |
item.contributor | Tyszkiewicz, Jerzy | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
item.fulltext | No Fulltext | - |
item.fullcitation | Hidders, Jan; KWASNIKOWSKA, Natalia; Sroka, Jacek; Tyszkiewicz, Jerzy & VAN DEN BUSSCHE, Jan (2008) DFL: A dataflow language based on Petri nets and nested relational calculus. In: INFORMATION SYSTEMS, 33(3). p. 261-284. | - |
item.validation | ecoom 2009 | - |
crisitem.journal.issn | 0306-4379 | - |
crisitem.journal.eissn | 1873-6076 | - |
Appears in Collections: | Research publications |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.