Efficient Route Query Processing with Arbitrary Order Constraints Providing Optimal Solution

Abstract

The optimal route query finds the shortest path starting from the query point from a given set of spatial points DS. These points are associated with some categorical information e.g., restaurant, pub, etc.,. This covers a user-specified set of categories(eg., beach, park and hotel). This can also be specified as partial order constraint between different categories eg., a ATM must be visited before hotel. In the previous work, it focused on where the query contains the total order of all categories to be visited(eg., park-ATM-hotel).The only known solution reduces the problem to multiple, total-order optimal route queries is done without such a total order. A naive approach is used in this paper,using this naive approach a significant amount of repeated computationsis done. Hence,this approach is not scalable to large datasets. A novel solution to the general optimal route query is been proposed in this paper. This is based on two different methodologies namely backward search and forward search. This proposed method can be adapted to answer a variantamount of optimal route queries. In this the route only needs to cover a subset of the given categories. Extensive experiments use both real and synthetic datasets,hence the proposed solution are efficient and practical.

Authors and Affiliations

G. Suganya

Keywords

Related Articles

Presentation Layer Work Based On Cloud

The power of cloud enables dynamic scalability of applications facing various business requirements. The world experiences the Internet through the use of the World Wide Web, e-mail, and file-sharing programs. Most of t...

MSER Region Based Number Plate Recognition System

Automatic License Plate Recognition (ALPR) is a kind of image processing and pattern recognition technology for recognizing the vehicle number plate from an image or video of a vehicle. ALPR has become a very important...

slugAn Enhanced Methods of Preprocessing in Web Log Mining

This paper tries to evaluate the web logs by using the technology used in the domain of data mining. Through content mining, structure mining and usage mining, evaluates and studies the existing problems in current mini...

Location Prediction to Reduce Hand-Off Latency in Mobile Network for Seamless Mobility Using NS2

With the increase in number of mobiles and mobile networks, there are lot many problems and challenges arising. Among these handoff is a big parameter which affects the network performance drastically. Though lot many i...

Embedding Watermark in Wavelet Domain Using Chaotic Sequence

With the fast development of internet, Usage of various types of digital data like text, image, audio, video have been increased across the entire globe. Digital Media has several benefits like quality is higher, copyin...

Download PDF file
  • EP ID EP22137
  • DOI -
  • Views 224
  • Downloads 3

How To Cite

G. Suganya (2016). Efficient Route Query Processing with Arbitrary Order Constraints Providing Optimal Solution. International Journal for Research in Applied Science and Engineering Technology (IJRASET), 4(5), -. https://europub.co.uk/articles/-A-22137