Optimal route queries with arbitrary order constraints

Jing Li, Yin Yang, Nikos Mamoulis

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

Given a set of spatial points (DS), each of which is associated with categorical information, e.g., restaurant, pub, etc., the optimal route query finds the shortest path that starts from the query point (e.g., a home or hotel), and covers a user-specified set of categories (e.g., {pub, restaurant, museum}). The user may also specify partial order constraints between different categories, e.g., a restaurant must be visited before a pub. Previous work has focused on a special case where the query contains the total order of all categories to be visited (e.g., museum (→) restaurant (→) pub). For the general scenario without such a total order, the only known solution reduces the problem to multiple, total-order optimal route queries. As we show in this paper, this naïve approach incurs a significant amount of repeated computations, and, thus, is not scalable to large data sets. Motivated by this, we propose novel solutions to the general optimal route query, based on two different methodologies, namely backward search and forward search. In addition, we discuss how the proposed methods can be adapted to answer a variant of the optimal route queries, in which the route only needs to cover a subset of the given categories. Extensive experiments, using both real and synthetic data sets, confirm that the proposed solutions are efficient and practical, and outperform existing methods by large margins.

Original languageEnglish
Article number6152119
Pages (from-to)1097-1110
Number of pages14
JournalIEEE Transactions on Knowledge and Data Engineering
Volume25
Issue number5
DOIs
Publication statusPublished - 2013
Externally publishedYes

Fingerprint

Museums
Hotels
Experiments

Keywords

  • Query processing
  • spatial databases

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

Optimal route queries with arbitrary order constraints. / Li, Jing; Yang, Yin; Mamoulis, Nikos.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 25, No. 5, 6152119, 2013, p. 1097-1110.

Research output: Contribution to journalArticle

@article{a8745f0d51024fa9ab270841ae4081ea,
title = "Optimal route queries with arbitrary order constraints",
abstract = "Given a set of spatial points (DS), each of which is associated with categorical information, e.g., restaurant, pub, etc., the optimal route query finds the shortest path that starts from the query point (e.g., a home or hotel), and covers a user-specified set of categories (e.g., {pub, restaurant, museum}). The user may also specify partial order constraints between different categories, e.g., a restaurant must be visited before a pub. Previous work has focused on a special case where the query contains the total order of all categories to be visited (e.g., museum (→) restaurant (→) pub). For the general scenario without such a total order, the only known solution reduces the problem to multiple, total-order optimal route queries. As we show in this paper, this na{\"i}ve approach incurs a significant amount of repeated computations, and, thus, is not scalable to large data sets. Motivated by this, we propose novel solutions to the general optimal route query, based on two different methodologies, namely backward search and forward search. In addition, we discuss how the proposed methods can be adapted to answer a variant of the optimal route queries, in which the route only needs to cover a subset of the given categories. Extensive experiments, using both real and synthetic data sets, confirm that the proposed solutions are efficient and practical, and outperform existing methods by large margins.",
keywords = "Query processing, spatial databases",
author = "Jing Li and Yin Yang and Nikos Mamoulis",
year = "2013",
doi = "10.1109/TKDE.2012.36",
language = "English",
volume = "25",
pages = "1097--1110",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "5",

}

TY - JOUR

T1 - Optimal route queries with arbitrary order constraints

AU - Li, Jing

AU - Yang, Yin

AU - Mamoulis, Nikos

PY - 2013

Y1 - 2013

N2 - Given a set of spatial points (DS), each of which is associated with categorical information, e.g., restaurant, pub, etc., the optimal route query finds the shortest path that starts from the query point (e.g., a home or hotel), and covers a user-specified set of categories (e.g., {pub, restaurant, museum}). The user may also specify partial order constraints between different categories, e.g., a restaurant must be visited before a pub. Previous work has focused on a special case where the query contains the total order of all categories to be visited (e.g., museum (→) restaurant (→) pub). For the general scenario without such a total order, the only known solution reduces the problem to multiple, total-order optimal route queries. As we show in this paper, this naïve approach incurs a significant amount of repeated computations, and, thus, is not scalable to large data sets. Motivated by this, we propose novel solutions to the general optimal route query, based on two different methodologies, namely backward search and forward search. In addition, we discuss how the proposed methods can be adapted to answer a variant of the optimal route queries, in which the route only needs to cover a subset of the given categories. Extensive experiments, using both real and synthetic data sets, confirm that the proposed solutions are efficient and practical, and outperform existing methods by large margins.

AB - Given a set of spatial points (DS), each of which is associated with categorical information, e.g., restaurant, pub, etc., the optimal route query finds the shortest path that starts from the query point (e.g., a home or hotel), and covers a user-specified set of categories (e.g., {pub, restaurant, museum}). The user may also specify partial order constraints between different categories, e.g., a restaurant must be visited before a pub. Previous work has focused on a special case where the query contains the total order of all categories to be visited (e.g., museum (→) restaurant (→) pub). For the general scenario without such a total order, the only known solution reduces the problem to multiple, total-order optimal route queries. As we show in this paper, this naïve approach incurs a significant amount of repeated computations, and, thus, is not scalable to large data sets. Motivated by this, we propose novel solutions to the general optimal route query, based on two different methodologies, namely backward search and forward search. In addition, we discuss how the proposed methods can be adapted to answer a variant of the optimal route queries, in which the route only needs to cover a subset of the given categories. Extensive experiments, using both real and synthetic data sets, confirm that the proposed solutions are efficient and practical, and outperform existing methods by large margins.

KW - Query processing

KW - spatial databases

UR - http://www.scopus.com/inward/record.url?scp=84875731833&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84875731833&partnerID=8YFLogxK

U2 - 10.1109/TKDE.2012.36

DO - 10.1109/TKDE.2012.36

M3 - Article

VL - 25

SP - 1097

EP - 1110

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 5

M1 - 6152119

ER -