[OSM-dev] [OSM-talk] Trouble in Rangoon
marcus at wolschon.biz
Thu Feb 28 10:30:52 GMT 2008
-----BEGIN PGP SIGNED MESSAGE-----
Andy Robinson (blackadder) schrieb:
|> The need for area-level revert is known and understood, we just never
|> have enough programmers to do all the funky things that need doing...
| Indeed, though to help the original user out perhaps we can have a
| effort to get any deleted data returned. needs someone with a bit of
| investigate properly. Have therefore copied to dev.
Sounds like we could need a stored procedure to undelete everything a
~ given user deleted between 2 given timestamps.
What does our table-structure look like?
I am thinking of something like:
* undelete all nodes
* then select all deleted ways where all their way_nodes have existing nodes
* undelete all way_nodes of these ways
* undelete all these ways
* 3x select all deleted relations where all their nodes, ways and
~ relations exist and undelete them
(done 3x to support relations relating to relations. We do not have
~ [possibly infinite] loops or recursion in stored procedures)
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.6 (GNU/Linux)
Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org
-----END PGP SIGNATURE-----
More information about the dev