定長線性四元樹編碼法經實驗結果得知，其相對於指標四元樹編碼法及以往學者所提之線性四元樹編碼法，在空間資料壓縮上，可得到較大的壓縮效果。故本研究利用定長線性四元樹編碼法為基礎，對整張地圖及部份區域地圖，推導出處理空間資料所含蓋之基本運算，包括交集、聯集、雙差集。且本研究所提演算法設計，經推證其時間復雜度為小於等O[min(k1,k2)]，其中k1與k2分別為兩個四元樹編碼的個數，這項成果較Bauer運算法需O(k1+k2)與劉興華所提運算法所需要O[max(k1,k2)]為佳，本研究成果對於處理空間資料龐大資料量的負荷而言，無論在處理應用上或傳輸時間方面所付出成本必可大幅降低。

　　Several experimental results verify that CBQC (Constant Bit Length Linear Quadtree Coding Scheme)is more efficient than original pointered quadtree coding scheme and other linear quadtree coding schemes in data compressinon. In this thesis, we derived the primitive set operations, including intersection, union and pair differences, from CBQC. Given two images of spatial data, the primitive set operators can be used to implement global operation and local operation. Time complexity of the proposed scheme for set operators are derived and less than or equal to O[min(k1,k2)], which is superior to both Bauer and Liu, Shing Hua methods. So, we can decrease transmission time by using CBQC to process spatial data for many applications.