Proceedings ArticleDOI
Ranking skyline points by computing nearest neighbor of Best Skyline Point
Partha Ghosh,Soumya Sen +1 more
- pp 1-5
TLDR
A effective way of computing skyline and ranking points by finding the Best Skyline Point (BSP) among the dataset is proposed.Abstract:
In a multi-criteria decision making system it is required to analyze more than one attribute of the table. In this context no one would be interested on a point (tuples) which is dominated by any other point in the system, they are only interested on skyline points. A point is called a skyline point if and only if it is not dominated by any other point in the system. Therefore for the multi-criteria decision making system, it needs to compute the points those are not dominated by any other point in the system. And then find the best suited value using some mathematical operations, and finally display the list of that in the sorted order, starting from the best value. This paper propose a effective way of computing skyline and ranking points by finding the Best Skyline Point (BSP) among the dataset.read more
Citations
More filters
Journal ArticleDOI
Skyline computation over multiple points and dimensions
TL;DR: In this paper, the capability of skyline is extended to work with multiple dimensions and to search the multiple interesting points from the given search space. But, they restrict the computational complexity within a fixed upper bound.
Proceedings ArticleDOI
An alternative solution of skyline operation to reduce computational complexity
Partha Ghosh,Soumya Sen +1 more
TL;DR: This research work focuses on the reduction of computational complexity by selecting the most important dimension of the database and transfers the other entire dimension in that form and finally ranks the points accordingly.
Journal ArticleDOI
Taxicab Geometry Based Analysis on Skyline for Business Intelligence
TL;DR: This research article focuses upon multiple visiting points for the travelers in an optimized way and uses Taxicab geometry for distance calculation, which is a simple Non-Euclidian geometry with minimum time complexity.
Proceedings ArticleDOI
Computing Skyline Using Taxicab Geometry
TL;DR: This research work uses Taxicab distance calculation to consider the presence of obstacles and apply it to compute skyline of geographically dispersed data.
Book ChapterDOI
Reducing Computational Complexity of Skyline by the Use of Logical and Physical Bucket
TL;DR: An alternative approach is proposed to use the features of skyline but avoiding the constraints of skyline, which categorizes the attributes in three classes and calculates the cost associated with each dimension in a sequence to reduce complexity.
References
More filters
Proceedings ArticleDOI
The Skyline operator
TL;DR: This work shows how SSL can be extended to pose Skyline queries, present and evaluate alternative algorithms to implement the Skyline operation, and shows how this operation can be combined with other database operations, e.g., join.
Book ChapterDOI
Shooting stars in the sky: an online algorithm for skyline queries
TL;DR: In this paper, a new online algorithm that computes the Skyline is presented, which returns the first results immediately, produces more and more results continuously, and allows the user to give preferences during the running time of the algorithm so that the user can control what kind of results are produced next (e.g., rather cheap or rather near restaurants).
Proceedings ArticleDOI
An optimal and progressive algorithm for skyline queries
TL;DR: BBS is a progressive algorithm also based on nearest neighbor search, which is IO optimal, i.e., it performs a single access only to those R-tree nodes that may contain skyline points and its space overhead is significantly smaller than that of NN.
Proceedings ArticleDOI
Skyline with presorting
TL;DR: A skyline algorithm, SFS, based on presorting that is general, for use with any skyline query, efficient, and well behaved in a relational setting is proposed.
Proceedings Article
Efficient Progressive Skyline Computation
TL;DR: This paper presents two novel algorithms, Bitmap and Index, to compute the skyline of a set of points, and shows that the proposed algorithms provide quick initial response time with Index being superior in most cases.