Relevance of tree structure in Location Based Service

Abstract

Mobile computing enables its clients to have unrestricted mobility access while maintaining network connections in
its mobility mode. During mobility client’s may request many services from the server. Location Dependent Information
Services (LDIS) is a application where information provided to users depends on their current locations. Existing location
based services are implemented with different index based searches, but they failed to provide more accurate result to the
user. The proposed framework has been implemented by similarity based searching method. This framework consists two
different methods namely: M tree and K-d tree. M-tree is designed for computing the distance of high dimension data using
Distance-based indices. K-d tree is a space-partitioning data structure for organizing points in a k dimensional tree