Cart (Loading....) | Create Account
Close category search window
 

Distributed Databases in Dynamic R-Tree for Vehicle Information Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Murase, Y. ; Tokyo Denki Univ., Tokyo ; Aikebaier, A. ; Enokido, T. ; Takizawa, M.

Information and communication systems for vehicles are getting significant like ETC (electronic toll collection) and car navigation systems. In the next generation navigation systems, each vehicle can not only receive various types of information like maps and traffic but also obtain traffic information around the vehicle by using the sensors and send them to a navigation center. It is critical to discuss how to store information collected by vehicles in databases and how vehicles access the information in the database in the presence of a huge number of vehicles on roads. In this paper, we propose an enhanced dynamic R-tree (EDR-tree) scheme to store and retrieve traffic data collected by vehicles in dynamic distributed database systems. In distributed tree-structured indexes like R-tree and B-tree, the root node and nodes at upper layers easily get performance bottleneck and points of failure since every query request is transferred from root to leaf node. In this paper, we propose a new tree-structured scheme named EDR-tree to store data. A road is realized as a sequence of road units. A geographical space of roads is separated into area units where road units are stored. An area unit is stored in a leaf node and there is a tree-structured index on the leaf nodes like B+-tree and R-tree. Each vehicle first makes an access to a leaf node, not the root, which has information of a road unit where the vehicle is currently moving. Then, a query request is efficiently and reliably delivered to a target node by using not only parent-child links but also enhancing links, sibling and adjacent links. We evaluate the EDR-tree in terms of search time and insertion time.

Published in:

Advanced Information Networking and Applications - Workshops, 2008. AINAW 2008. 22nd International Conference on

Date of Conference:

25-28 March 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.