ABSTRACT:
Location-based
services (LBS) enable mobile users to query points-of-interest (e.g.,
restaurants, cafes) on various features (e.g., price, quality, variety). In
addition, users require accurate query results with up-to-date travel times.
Lacking the monitoring infrastructure for road traffic, the LBS may obtain live
travel times of routes from online route APIs in order to offer accurate results.
Our goal is to reduce the number of requests issued by the LBS significantly
while preserving accurate query results. First, we propose to exploit recent
routes requested from route APIs to answer queries accurately. Then, we design
effective lower/upper bounding techniques and ordering techniques to process
queries efficiently. Also, we study parallel route requests to further reduce
the query response time. Our experimental evaluation shows that our solution is
3 times more efficient than a competitor, and yet achieves high result accuracy
(above 98%).
AIM
The
aim of this paper is design effective lower/upper bounding techniques and
ordering techniques to process queries efficiently.
SCOPE
The Scope of this project shows that our
solution is 3 times more efficient than a competitor, and yet achieves high
result accuracy (above 98%).
EXISTING SYSTEM
In
our problem scenario, query users require accurate results that are computed
with respect to live traffic information. All the above works require the LBS
to know the weights (travel times) of all road segments. Since the LBS lacks
the infrastructure for monitoring road traffic, the above works are
inapplicable to our problem. Some works attempt to model the travel times of
road segments as time-varying functions, which can be extracted from historical
traffic patterns. These functions may capture the effects of periodic events
(e.g., rush hours, weekdays). Nevertheless, they still cannot reflect live
traffic information, which can be affected by sudden events, e.g., congestions,
accidents and road maintenance. Landmark and distance oracle can be applied to estimate shortest path
distance bounds between two nodes in a road network, which can be used to prune
irrelevant objects and early detect results. The above works are inapplicable
to our problem because they consider constant travel times on road segments (as
opposed to live traffic). Furthermore, in this paper, we propose novel
lower/upper travel time bounds derived from both the road network and the
information of previously obtained routes; these bounds have not been studied
before.
DISADVANTAGES:
- Users require accurate query results with up-to-date travel times.
- Lacking the monitoring infrastructure for road traffic, the LBS may obtain live travel times of routes from online route APIs in order to offer accurate results
In
this paper, To reduce the number of route requests while providing accurate
results, we combine information across multiple routes in the log to derive
tight lower/upper bounding travel times. We also propose effective techniques
to compute such bounds efficiently. Moreover, we examine the effect of
different orderings for issuing route requests on saving route requests. And we
study how to parallelize route requests in order to reduce the query response
time further.
ADVANTAGES
- To reduce the number of requests issued by the LBS significantly while preserving accurate query results.
- The parallelization of route requests to further reduce query response time.
SYSTEM
ARCHITECTURE
HARDWARE REQUIREMENTS:-
· Processor - Pentium –III
· Speed - 1.1 Ghz
· RAM - 256 MB(min)
· Hard Disk - 20 GB
· Floppy Drive - 1.44 MB
· Key Board - Standard
Windows Keyboard
· Mouse - Two or Three Button Mouse
· Monitor - SVGA
SOFTWARE REQUIREMENTS:-
·
Operating
System : Windows 7
·
Front
End :
JSP AND SERVLET
·
Database :
MYSQL
REFERENCE:
Man
Lung Yiu, Yu Li “Route-Saver: Leveraging
Route APIs for Accurate and Efficient Query Processing at Location-Based
Services”,
IEEE Transactions on Knowledge and Data Engineering, Volume 27, Issue 1MAY 2014.
No comments:
Post a Comment