Please use this identifier to cite or link to this item:
Title: indexing and querying moving objects databases
Authors: LIN DAN
Keywords: moving object databases, index, query, location privacy
Issue Date: 2-May-2007
Citation: LIN DAN (2007-05-02). indexing and querying moving objects databases. ScholarBank@NUS Repository.
Abstract: Moving object applications that entail the storage of samples of continuous, multi-dimensional variables pose new challenges to the traditional database technology.This thesis addresses the challenges of providing supports for indexing, querying and privacy protections in moving-object environments. Also, this thesis presents a system architecture for moving object databases by extending existing DBMS. Specifically, for the indexing, we proposed a new index structure, the Bx-tree, which indexes current and near-future positions of moving objects. Apart from the queries that are directly supported by the Bx-tree such as the range, k-nearest neighbor queries, we also studied an emerging type of query, density query. The density query is to locate the regions with a density higher than a given threshold. To protect user information in location-based services, we proposed a system framework that achieves high assurance privacy without sacrificing the service quality.
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
thesis_lindan.pdf990.76 kBAdobe PDF



Page view(s)

checked on Apr 20, 2019


checked on Apr 20, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.