MOVING OBJECT DATA INDEXING TECHNIQUE IN RELATIONAL DATABASE

• Main Author: Aldina, Letivany
• Format: Final Project
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/53812
• Institution: Institut Teknologi Bandung

Moving object data is a collection of objects positions that change over time. The large size of moving object data issues the needs of more efficient data searching. The utilization of indexing technique is one way that can be used in order to searching for some data can be performed better. There are factors that should be considered in utilizing an indexing technique, those are work principle, index structure, and the suitable data structure. ST-Hash indexing technique is an indexing technique that applies hashing principle, with input consists of position coordinate and instance timestamp, which is processed to be a short string called ST-Hash string. The implementation of ST-Hash index is performed by ST-Hash string encoding function which accepts input of latitude, longitude, and timestamp. The organization of ST-Hash string can be performed in two ways; separated from data table and incorporated into data table. The utilization of ST-Hash index in query is performed by implementing two functions which processes point query and range query respectively. Those functions is collected into an index module package called extension. The construction of extension is performed in PostgreSQL DBMS which also utilizes PostGIS extension to handle geometry data type. Index module testing is performed to validate between whether the utilization of ST-Hash index in query gives the same results with query without index. Index module testing is also performed to to validate the performance of ST-Hash index.