Research Article
An Efficient Algorithm for Maximizing Range Sum Queries in a Road Network
Input SF: segment file, : the edge contains segment, : a segment | (1) edgeRecord = SF.getRecord() | (2) if (edgeRecord is null) then | (3) edgeRecord = new SegmentRecord(, ) | (4) SF.insert(edgeRecord) | (5) else | (6) for each segment seg in edgeRecord do | (7) if (seg.facId = .facId) then | (8) mergeSeg = mergeSegment(seg, ) | (9) if (mergeSeg is not null) then | (10) edgeRecord.remove(seg) | (11) = mergeSeg | (12) end if | (13) end if | (14) end for | (15) edgeRecord.add() | (16) SF.update(edgeRecord) | (17) end if |
|