원문정보
초록
영어
The skyline queries are the best tools to be used in distributed multi criteria decision making of web based applications for user commendations. However, as the Data dimensions are increasing size of dominance set and skyline set is also increasing. Increasing dimensionality becomes the major problem with real word databases. In skyline computation major cost depends on finding dominance tests between high dimensional objects and the order in which they are accessing. Space filling Z-curve is the best suitable way to address the challenges in skyline computation. In this proposed work, we incorporated Z-curve with optimized skyline boundary detection algorithm to effective access and early pruning. In this paper efficient hybrid index structure was proposed which takes the advantage of sorting and partition approaches to improve the storage and search efficiency. Experimental results show that our propose approach is better than the previous static skyline computation techniques in terms of searching and finding skyline set.
목차
1. Introduction
2. Related Work
2.1. Skyline Query Processing
2.2. Divide and Conquer Algorithms
2.3. Sorting-based Algorithms
2.4. Hybrid Algorithms
3. Distributed Skyline Properties
3.1. Minimization of Bandwidth Consumption
3.2. Progressiveness
3.3. Effective Pruning
4. Architecture
5. Z-Order Curve
5.1. Monotonic Ordering
5.2. Clustering
6. VS Tree Index Structure
6.1. Algorithm for Dominance Test
6.2. Algorithm for Search
7. Results
7.1. Data Transmissions Vs. Dimensionality
8. Conclusion
References