Graph-based modeling of ETL activities with multi-level transformations and updates

Simitsis, A; Vassiliadis, P; Terrovitis, M; Skiadopoulos, S

dc.contributor.author	Simitsis, A	en
dc.contributor.author	Vassiliadis, P	en
dc.contributor.author	Terrovitis, M	en
dc.contributor.author	Skiadopoulos, S	en
dc.date.accessioned	2014-03-01T02:43:21Z
dc.date.available	2014-03-01T02:43:21Z
dc.date.issued	2005	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31351
dc.subject	Levels of Abstraction	en
dc.subject	Modeling Technique	en
dc.subject	Extract Transform Load	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Data centric workflows	en
dc.subject.other	Extract-Transform-Load (ETL)	en
dc.subject.other	Graph-based modeling	en
dc.subject.other	Querying semantics	en
dc.subject.other	Abstracting	en
dc.subject.other	Computer software	en
dc.subject.other	Data warehouses	en
dc.subject.other	Mathematical models	en
dc.subject.other	Mathematical transformations	en
dc.subject.other	Query languages	en
dc.subject.other	Semantics	en
dc.subject.other	Graph theory	en
dc.title	Graph-based modeling of ETL activities with multi-level transformations and updates	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/11546849_5	en
heal.identifier.secondary	http://dx.doi.org/10.1007/11546849_5	en
heal.language	English	en
heal.publicationDate	2005	en
heal.abstract	Extract-Transform-Load (ETL) workflows are data centric workflows responsible for transferring, cleaning, and loading data from their respective sources to the warehouse. In this paper, we build upon existing graph-based modeling techniques that treat ETL workflows as graphs by (a) extending the activity semantics to incorporate negation, aggregation and self-joins, (b) complementing querying semantics with insertions, deletions and updates, and (c) transforming the graph to allow zoom-in/out at multiple levels of abstraction (i.e., passing from the detailed description of the graph at the attribute level to more compact variants involving programs, relations and queries and vice-versa). © Springer-Verlag Berlin Heidelberg 2005.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	Lecture Notes in Computer Science	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/11546849_5	en
dc.identifier.isi	ISI:000231850500005	en
dc.identifier.volume	3589	en
dc.identifier.spage	43	en
dc.identifier.epage	52	en