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

Design of Hydraulic Fixture for Engine Side Cover

A fixture is a work-holding device used in the manufacturing industry. Fixture’s primary purpose is to create a secure mounting point for a work piece, allowing for support during operation and increased accuracy, preci...

Study of Accuracy in Incremental Sheet Forming Of Aluminium

The Incremental Sheet Forming process is quickly developed as it is capable of delivering custom made parts or batch products economically as per the market needs. In this process the tool imparts local plastic deformat...

Investigattion of Cloud Computing Security Issue

This paper describes computing is to create a disciplined procedure of scattered resources with least expenditure in command to acquire great throughput and to throw a great problem with comfort. Cloud computing uses, s...

Energy Auditing and Possibility Study for Waste Heat Recovery in the Laundry Section of a Hospital

This paper is the outcome of a project work undertaken to conduct energy auditing and possibility study of waste heat recovery at the laundry division of a hospital. The major problem identified was the wastage of steam...

Sinter Coolers

At present, distributed generation (DG) has been a research focus all over the world. As a kind of DG system, cogeneration system utilizing waste heat from sintering-cooling process plays an important role in modern iro...

Download PDF file
  • EP ID EP22137
  • DOI -
  • Views 203
  • 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