Taxicab Geometry Based Analysis on Skyline for Business Intelligence

Taxicab Geometry Based Analysis on Skyline for Business Intelligence

Partha Ghosh (Kingston School of Management & Science, West Bengal, India), Takaaki Goto (Ryutsu Keizai University, Chiba, Japan) and Soumya Sen (University of Calcutta, West Bengal, India)
Copyright: © 2018 |Pages: 17
DOI: 10.4018/IJSI.2018100107
OnDemand PDF Download:
No Current Special Offers


This article describes how multi-criteria decision making problems are difficult to handle in normal SQL query processing. Skyline computation is generally used to solve these types of requirements by using dominance analysis and finding shortest distance with respect to a prime interesting point. However, in real life scenarios shortest distance may not be applicable in most of the cases due to different obstacles or barriers exist between the point of interests or places. In order to consider the presence of obstacles for geographically dispersed data, this research work uses Taxicab geometry for distance calculation, which is a simple Non-Euclidian geometry with minimum time complexity. Another limitation of previous skyline based works are that they only focus upon a single interesting point and can't be apply for multiple interesting points. This research article focuses upon multiple visiting points for the travelers in an optimized way. In addition to this, the article also selects areas for setting up of new business properties considering the constraints.
Article Preview

1. Introduction

Queries are executed on the database to fetch results based on business requirements. The predicate of the queries could be simple in nature or may get complex due to the requirements of multi-criteria decision makings. Sometimes this requirement further complex if the criterions are inversely proportional. In this context the traditional query optimization techniques do not work well as these are not supposed to optimize multi-criteria decision making. The skyline computation (Borzsonyi, Kossmann & Stocker, 2001; Tan, Eng & Ooi, 2001; Kossmann, Ramsak & Rost 2002) was introduced to solve these type of optimization problem. Dominance analysis (Borzsonyi, Kossmann & Stocker, 2001; Ghosh & Sen, 2015; Ghosh & Sen, 2016) is being performed to extract skyline points from a set of k-dimensional n points. It is defined as “A point that is not dominated by any other point in the system is called skyline point” (Borzsonyi, Kossmann & Stocker, 2001; Chomicki, Godfrey, Gryz & Liang, 2003; Ghosh & Sen, 2015; Bartolini, Ciaccia, & Patella, 2006). For a set of k-dimensional points, a point dominates another point if it is at least equally good in all the (k – 1) dimensions and better in at least one dimension (Borzsonyi, Kossmann & Stocker, 2001). After extracting the relevant skyline points from the given problem domain, the common practice is to identify an optimal point (Ghosh, Goto & Sen, 2017; Tan, Eng & Ooi, 2001) from the problem domain and rank all the other skyline points according to the merit of that optimal point. One of the alternative solutions of this type of problem is to identify the most important dimension and convert all the other dimensions in to that in some format and finally rank all the other points according to that (Ghosh & Sen, 2016).

Skyline computation is widely used in “Travelling and Tourism Industry” to generate an optimal tour plan. The general criteria for the travelers are to select a hotel that is cheapest in its own class but closest to the Point of Interest (visiting point). Unfortunately, these two criteria are inversely proportional to each other, as the hotels near to the point of interest tend to be more costly. Hence traditional SQL (Rahman, N., 2016). query can’t optimize these types of requirements. Most of the existing methodologies identify an optimal point within the skyline region (Ghosh & Sen, 2016) and compute shortest distance from that optimal point using the formula provided by the Euclidean geometry. In a two dimensional space, Euclidean geometry measures distance between two points A and b using the formula:


This formula works perfectly in the space where all types of movements are possible (without any physical constraints). However, it is not suitable for travelling and tourism Industry, as the two points are connected mainly through horizontal and vertical roads (in the form of straight line in certain direction). Moreover, due to the presence of different physical obstacles and barriers, all type of horizontal and vertical movements are also not possible. Another limitation of the Euclidean geometry is its high complexity when more than two dimensions are taken into computation. Therefore, an improved methodology is required that can adapt according to the situations.

One of the alternatives of Euclidean geometry is Taxicab geometry (Tang, Kerber, Huang, & Guibas, 2013; Ekici, Sevinc¸ & Cengiz, 2012; Ghosh, Goto & Sen, 2017). It is a simple non-Euclidean geometry that uses modular differences of the coordinates for finding distance between points. To measure distance between two points in a two dimensional space, it uses the formula:


Complete Article List

Search this Journal:
Open Access Articles
Volume 10: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 9: 4 Issues (2021)
Volume 8: 4 Issues (2020)
Volume 7: 4 Issues (2019)
Volume 6: 4 Issues (2018)
Volume 5: 4 Issues (2017)
Volume 4: 4 Issues (2016)
Volume 3: 4 Issues (2015)
Volume 2: 4 Issues (2014)
Volume 1: 4 Issues (2013)
View Complete Journal Contents Listing