Optimizing path query performance: graph clustering strategies

摘要

Path queries over transportation networks are operations required by many Geographic Information Systems applications. Such networks, typically modeled as graphs composed of nodes and links and rep- Resented as link relations, can be very large and hence often need to be stored on secondary storage devices. Path query computation over such large persistent networks amounts to high I/O costs due to having to Repeatedly bring in links from the link relation from secondary storage into the main memory buffer for Processing.