Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Relaxed space bounding for moving objects: a case for the buddy tree

Relaxed space bounding for moving objects: a case for the buddy tree Rapid advancements in positioning systems and wireless communications enable accurate tracking of continuously moving objects. This development poses new challenges to database technology since maintaining up-to-date information regarding the location of moving objects incurs an enormous amount of updates. There have been many efforts to address these challenges, most of which depend on the use of a minimum bounding rectangle (MBR) in a multi-dimensional index structure such as R-tree. The maintenance of MBRs causes lock contention and association of moving speeds with the MBRs cause large overlap between them. This problem becomes more severe as the number of concurrent operations increases. In this paper, we propose a "new" simple variant of the Buddy-tree, in which we enlarge the query rectangle to account for object movement rather than use an enlarged MBR. The result is not only elegant, but also efficient, particularly in terms of lock contention. An extensive experimental study was conducted and the results show that our proposed structure outperforms existing structures by a wide margin. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGMOD Record Association for Computing Machinery

Relaxed space bounding for moving objects: a case for the buddy tree

Download PDF
6 pages

Loading next page...
 
/lp/association-for-computing-machinery/relaxed-space-bounding-for-moving-objects-a-case-for-the-buddy-tree-AkJ6BPH05k

References (19)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2006 by ACM Inc.
ISSN
0163-5808
DOI
10.1145/1228268.1228272
Publisher site
See Article on Publisher Site

Abstract

Rapid advancements in positioning systems and wireless communications enable accurate tracking of continuously moving objects. This development poses new challenges to database technology since maintaining up-to-date information regarding the location of moving objects incurs an enormous amount of updates. There have been many efforts to address these challenges, most of which depend on the use of a minimum bounding rectangle (MBR) in a multi-dimensional index structure such as R-tree. The maintenance of MBRs causes lock contention and association of moving speeds with the MBRs cause large overlap between them. This problem becomes more severe as the number of concurrent operations increases. In this paper, we propose a "new" simple variant of the Buddy-tree, in which we enlarge the query rectangle to account for object movement rather than use an enlarged MBR. The result is not only elegant, but also efficient, particularly in terms of lock contention. An extensive experimental study was conducted and the results show that our proposed structure outperforms existing structures by a wide margin.

Journal

ACM SIGMOD Record – Association for Computing Machinery

Published: Dec 1, 2006

There are no references for this article.