[OSM-dev] mysql partitioning

[Dean Earley]

Simon Hewison wrote:
> Nick Hill wrote:
> 
>> However, most of the database time seems to be spent pulling segments 
>> from the database. For every node in the selected area, an index 
>> look-up is performed for segments associated with that node. Then for 
>> segments which have only one node associated with them, the other node 
>> is downloaded. This is very, very db intensive.
> 
> Why do we even have such segments with only one node associated with 
> them in the database? The only time I've ever seen them is where somehow 
> there's two nodes bang on top of each other, and an editor has got a 
> little bit confused as to what the user was pointing at.

I think it was "only one node inside the area" rather than "both nodes 
are the same", meaning it needs to get the other node from the DB rather 
than its list.

-- 
Dean Earley, Dee (dean at earlsoft.co.uk)

irc:    irc://irc.blitzed.org/
web:    http://personal.earlsoft.co.uk
phone:  +44 (0)780 8369596