| pr | Aktuell | Seminare | Reports | Homepage | Software | ||
|
| |||||||
|
@informatik.hu-berlin.de Reports - postindustr.CC - XML/Ti Report - pTA StudienArbeit - sch_llf study - Geschichte des PC schema-mappingen ig cv hg re dv ev zz mk pr java problemsen lang swing ext gtk jjtree xul boot -grub-netboot -grub-gtk -partclone freshmeat -partimage links releaseuploader
2004-02-19
|
The Plan of Making ItYou have read the "Making Of" SMACS In its simples form the generated callable schema mapping is just an SQL VIEW. However, we do not bother to generated such in the first stage of the project - it is thought to be a degenerate case of normal behavior being more complex. It would be an extension to instlal an optimization step that can see the degenerate case and instruct generation to skip the java glue around the extraction to data insertion making it mere sql select/insert processing. Instead the first stage of the project is to (a) parse sql (b) split it on selects and insert chains (c) create java loops as foreach record. (d) generate the glue around the loops. That makes it an SQL to SQL/J to JDBC compiler. A thing that makes the execution somewhat less efficient in its first incarnation but at the same time introduces a flexibility not existing in plain SQL. From there we do not do the next step as for extensions in schema mapping constructs. Instead we extend the system to hold multiple schema mapping rules - the rule base. That rule base might contain parts not written in sql or even generated as "implicit" rules. The rule base will allow us to deploy inter-rule optimizations - possibly interleaving them. Only after that we inject support for heterogenity - including the schema discrepancies as well as data format mismatches. All these shall be expressed as conditions that trigger a changer execution in the compiler runtime. Timetable
| ||||||