An Efficient Algorithm for Maximizing Range Sum Queries in a Road Network

Algorithm 3

insertSegment(SF, 𝐸, 𝑆).

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