Online Car Rental

System
Proposal Draf

Table of Contents
1. Introduction
1.1 Introduction to project
---------------------------------------------------------------------------------- 3
2. Topics
2.1. B+ Trees
----------------------------------------------------------------------------------------------------- 4
2.2. Dynamic Hashing
-----------------------------------------------------------------------------------------4
2.3. SQL queries
------------------------------------------------------------------------------------------------- 4

Introduction to project:
1) The Online Car Rental System is the one where a vehicle can be used temporarily
for a specified period of time and will be charged
2) This allows a view for customers which includes

Available cars (includes models)

To register car
Can view profile and book car

3) Here customer can book the car prior to pick up date or time
4) In order to perform the above things customer need to provide some information
like
>On which dates customer needs the vehicle
>Which model of the car?
>should provide a valid License ID
5) This system saves a lot of money, time and labor
6) The Online Car Rental System will be available 24 hours which will be more
flexible for the customers
7) If we see maintenance is a huge problem and also updating the data
8) In this system data is maintained electronically and also easy to update the
details
9) Time saving factor advantages for both customer and admin

Topics include:
B+ Trees :

A B+tree is a method of placing and locating files (i.e., records or keys) in a

database.
The B+tree algorithm minimizes the number of times a medium must be
accessed to locate a desired record, thereby speeding up the process.

Dynamic Hashing:

In real time there will huge database structures, where it is impossible to

search all the index values to reach the destination data block for retrieving
the desired data.
Hashing is the effective technique to calculate direct location of data record.
Hashing uses hash functions with search keys as parameters to generate
address of a record.
Dynamic Hashing is good for database that grows and shrinks in size and also
provides a mechanism in which data buckets are added and removed
dynamically.

SQL queries for Database:

Planning to run some sample queries for car search which includes model of
the car, search based on the rent of the car, number of cars available and
also planning to write queries to view customer details.