A master thesis from Aalborg University
High Concurrent R-tree Operations when Tracking Continuous Movement in Main Memory
Author(s)
Term
1. term
Education
Publication year
2011
Submitted on
2011-01-10
Pages
19 pages
Abstract
There is a growing need to accurately track moving objects in a given area. In order to support efficient queries on positions of tracked objects, a customized spatial data structure is used. The application domain requires efficient updates to be performed in order to maintain the reported position of objects as fresh as possible. With the evolution of main memory databases this goal becomes easier to achieve. However, in order to take full advantage of highly parallel modern CPUs, one must take into consideration the issue of concurrency in such a system. Being a fact that locking and, or latching greatly affect the behavior of the system with regards to concurrency between operations, the goal of the present paper is to introduce a concurrency algorithm that avoids locking and latching as much as possible. Based on this, two new approaches are presented that ensure high concurrency when structural modifications due to underfull and overfull nodes are taken into account.
Keywords
Documents
Colophon: This page is part of the AAU Student Projects portal, which is run by Aalborg University. Here, you can find and download publicly available bachelor's theses and master's projects from across the university dating from 2008 onwards. Student projects from before 2008 are available in printed form at Aalborg University Library.
If you have any questions about AAU Student Projects or the research registration, dissemination and analysis at Aalborg University, please feel free to contact the VBN team. You can also find more information in the AAU Student Projects FAQs.