ISPRS Ann. Photogramm. Remote Sens. Spatial Inf. Sci., II-2/W2, 9-17, 2015
© Author(s) 2015. This work is distributed
under the Creative Commons Attribution 3.0 License.
19 Oct 2015
A. Suhaibah1, U. Uznir1, F. Anton2, D. Mioc2, and A. A. Rahman1 1Geospatial Information Infrastructure (GeoI2) Research Lab., Faculty of Geoinformation and Real Estate, Universiti Teknologi Malaysia, 81310 Skudai, Johor, Malaysia
2Dept. of Geodesy, National Space Institute, Technical University of Denmark, Elektrovej 328, 2800 Kgs. Lyngby, Denmark
Keywords: Supply Chain Management, 3D Spatial Data Clustering, 3D Spatial Database, 3D GIS, Data Management, Information Retrieval Abstract. Supply Chain Management (SCM) is the management of the products and goods flow from its origin point to point of consumption. During the process of SCM, information and dataset gathered for this application is massive and complex. This is due to its several processes such as procurement, product development and commercialization, physical distribution, outsourcing and partnerships. For a practical application, SCM datasets need to be managed and maintained to serve a better service to its three main categories; distributor, customer and supplier. To manage these datasets, a structure of data constellation is used to accommodate the data into the spatial database. However, the situation in geospatial database creates few problems, for example the performance of the database deteriorate especially during the query operation. We strongly believe that a more practical hierarchical tree structure is required for efficient process of SCM. Besides that, three-dimensional approach is required for the management of SCM datasets since it involve with the multi-level location such as shop lots and residential apartments. 3D R-Tree has been increasingly used for 3D geospatial database management due to its simplicity and extendibility. However, it suffers from serious overlaps between nodes. In this paper, we proposed a partition-based clustering for the construction of a hierarchical tree structure. Several datasets are tested using the proposed method and the percentage of the overlapping nodes and volume coverage are computed and compared with the original 3D R-Tree and other practical approaches. The experiments demonstrated in this paper substantiated that the hierarchical structure of the proposed partitionbased clustering is capable of preserving minimal overlap and coverage. The query performance was tested using 300,000 points of a SCM dataset and the results are presented in this paper. This paper also discusses the outlook of the structure for future reference.
Conference paper (PDF, 2062 KB)

Citation: Suhaibah, A., Uznir, U., Anton, F., Mioc, D., and Rahman, A. A.: 3D PARTITION-BASED CLUSTERING FOR SUPPLY CHAIN DATA MANAGEMENT, ISPRS Ann. Photogramm. Remote Sens. Spatial Inf. Sci., II-2/W2, 9-17, doi:10.5194/isprsannals-II-2-W2-9-2015, 2015.

BibTeX EndNote Reference Manager XML