Sciweavers

4074 search results - page 31 / 815
» Abstract Graph Transformation
Sort
View
ADBIS
2009
Springer
151views Database» more  ADBIS 2009»
15 years 4 months ago
Rule-Based Management of Schema Changes at ETL Sources
In this paper, we visit the problem of the management of inconsistencies emerging on ETL processes as results of evolution operations g at their sources. We abstract Extract-Transf...
George Papastefanatos, Panos Vassiliadis, Alkis Si...
CORR
2002
Springer
135views Education» more  CORR 2002»
14 years 9 months ago
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...
András A. Benczúr, David R. Karger
STTT
2010
134views more  STTT 2010»
14 years 8 months ago
A case study to evaluate the suitability of graph transformation tools for program refactoring
This article proposes a case study to evaluate the suitability of graph transformation tools for program refactoring. In order to qualify for this purpose, a graph transformation s...
Francisco Javier Pérez, Yania Crespo, Berth...
ECEASST
2008
95views more  ECEASST 2008»
14 years 10 months ago
Graph Transformations for the Resource Description Framework
: The Resource Description Framework (RDF) is a standard developed by the World Wide Web Consortium (W3C) to facilitate the representation and exchange of structured (meta-)data in...
Benjamin Braatz, Christoph Brandt
ASWEC
2005
IEEE
15 years 3 months ago
A Formal Method for Program Slicing
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
Yingzhou Zhang, Baowen Xu, José Emilio Labr...