Optimized skyline queries on road networks using nearest neighbors

Safar, Maytham; El-Amin, Dalal; Taniar, David

doi:10.1007/s00779-011-0371-7

Cited by 18 publications

(5 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The points based trip search aims to find a good path that can pass some user specified locations over the spatial network, and the evaluation of the trips can be measured by a single factor [4,5] or multiple factors [9,10], e.g., distance, expense or time. Some indexing structures such as arterial hierarchy [11], contraction hierarchies [12], path oracle [13] and transit-node routing [14] are developed to speed up the searching process by the shortcuts embedded in the indexing structure.…”

Section: Related Workmentioning

confidence: 99%

Efficient Trip Planning for Maximizing User Satisfaction

Zhu¹,

Xu²,

Liu

et al. 2015

Database Systems for Advanced Applications

View full text Add to dashboard Cite

Trip planning is a useful technique that can find various applications in LBS systems. Though a lot of trip planning methods have been proposed, few of them have considered the possible constraints of POI sites in required types to be covered for user intended activities. In this paper, we studies the problem of multiple criteria based trip search on categorical POI sites, to return users the trip that can maximize user satisfaction score within a given distance or travel time threshold. To address this problem, we propose a spatial sketch based approximate algorithm, which extracts useful global information based on spatial clusters to guide effective trip search. The efficiency of query processing can be fully guaranteed because of the superior pruning effect on larger granularity. Experimental results on real dataset demonstrate the effectiveness of the proposed methods.

show abstract

Section: Related Workmentioning

confidence: 99%

Efficient Trip Planning for Maximizing User Satisfaction

Zhu¹,

Xu²,

Liu

et al. 2015

Database Systems for Advanced Applications

View full text Add to dashboard Cite

show abstract

“…Given a set of n, d-dimensional objects, Ɵ = {Q 1 ,Q 2 ,..., Q n }, the skyline query returns a set of interesting objects that are not worst than other objects in all dimensions considering the given preferences (Pujarietal.,2015;Pujarietal.,2015a;Zhangetal.,2009;Safar,El-Amin,&Taniar, 2011;Shen,Islam,&Taniar,2020).Ingeneral,preferencesarecertainandimplicitwhenonevalue isalwayspreferredovertheother.Forinstance,everyoneprefersalowpriceoverahighpricein general.Skylinequerieswithcertainpreferencesarewellstudiedintheliterature (Hanetal.,2012;Morse,Patel,&Grosky,2007;Papadiasetal.,2005;Zhang,Mamoulis,&Cheung,2009;Shenetal., 2020,Sohali,Cheema,&Taniar,2018.Inmanyreal-worldscenarios,thepreferencesofindividuals varyfromothers.Forexample,inamovierecommendationscenario,onemayprefercomedymovies toactionmovieswhileotherspreferencesmaydiffer.Individualpreferencemayalsochangefrom contexttocontext;forexample,peoplemayprefercartoonswhenaccompanyingchildrenanddrama withadults.Compilationofallthesevaryingpreferenceswouldleadtouncertainpreferences,i.e., onevalueispreferredovertheotherwithacertainprobability.…”

Section: Introductionmentioning

confidence: 99%

Efficient Computation of Top-K Skyline Objects in Data Set With Uncertain Preferences

Sukhwani

Kagita

Kumar

et al. 2021

International Journal of Data Warehousing and Mining

View full text Add to dashboard Cite

Skyline recommendation with uncertain preferences has drawn AI researchers' attention in recent years due to its wide range of applications. The naive approach of skyline recommendation computes the skyline probability of all objects and ranks them accordingly. However, in many applications, the interest is in determining top-k objects rather than their ranking. The most efficient algorithm to determine an object's skyline probability employs the concepts of zero-contributing set and prefix-based k-level absorption. The authors show that the performance of these methods highly depends on the arrangement of objects in the database. In this paper, the authors propose a method for determining top-k skyline objects without computing the skyline probability of all the objects. They also propose and analyze different methods of ordering the objects in the database. Finally, they empirically show the efficacy of the proposed approaches on several synthetic and real-world data sets.

show abstract

“…In [14], Prabha et al focused on the authentication problem of moving objects in a continuous skyline query process, proposing a system that applies a spatial precomputed approach for continuous skyline query. In [15], Safar et al filtered candidate interest points by calculating the nearest neighbor of each query point, thereby reducing the query space and the number of required shortest path computations wherein a spatial data structure is used to store precomputed shortest path information between nodes of the road network. In [16], Shi et al approached continuous skyline queries by focusing on location range, transforming interest point sets into Voronoi units, and reducing query times by preprocessing data from the Voronoi units from within the road network.…”

Section: Introductionmentioning

confidence: 99%

Supporting Continuous Skyline Queries in Dynamically Weighted Road Networks

Tang

Chen

2018

Mathematical Problems in Engineering

View full text Add to dashboard Cite

The paper focuses on the design of an optimum method for handling the continuous skyline query problem in road networks. Existing studies on processing the continuous skyline query focus exclusively on static road networks, which are limited because the state of roads in road networks is constantly changing. Therefore, to apply current methods for dynamically weighted road networks, a distributed skyline query method based on a grid partition method has been proposed in this paper. The method adopts the concepts of a distributed computing framework and road network preprocessing computations in which multiple parallel computing nodes are allocated and organized in grids. Using this approach, the road network map is simplified to a hub graph with much smaller scale such that the query load of the central node can be significantly reduced. The theoretical analysis and experimental results both indicate that, by using the proposed method, the system can achieve quick response time for users as well as a good balance between response times and accuracy. Therefore, it can be concluded that using the proposed method is beneficial for handling continuous skyline queries in a dynamically weighted road network.

show abstract

Optimized skyline queries on road networks using nearest neighbors

Cited by 18 publications

References 34 publications

Efficient Trip Planning for Maximizing User Satisfaction

Efficient Trip Planning for Maximizing User Satisfaction

Efficient Computation of Top-K Skyline Objects in Data Set With Uncertain Preferences

Supporting Continuous Skyline Queries in Dynamically Weighted Road Networks

Contact Info

Product

Resources

About