The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Proceedings of the 17th International Conference on Data Engineering
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
BATON: a balanced tree structure for peer-to-peer networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Robust Cardinality and Cost Estimation for Skyline Operator
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Skyline Queries Against Mobile Lightweight Devices in MANETs
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Progressive skylining over web-accessible databases
Data & Knowledge Engineering
Efficient progressive processing of skyline queries in peer-to-peer systems
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Processing relaxed skylines in PDMS using distributed data summaries
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Parallel Computation of Skyline Queries
HPCS '07 Proceedings of the 21st International Symposium on High Performance Computing Systems and Applications
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Parallelizing skyline queries for scalable distribution
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Parallelizing progressive computation for skyline queries in multi-disk environment
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Finding the influence set through skylines
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Scalable skyline computation using object-based space partitioning
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Bandwidth-constrained distributed skyline computation
Proceedings of the Eighth ACM International Workshop on Data Engineering for Wireless and Mobile Access
Skyline queries with constraints: Integrating skyline and traditional query operators
Data & Knowledge Engineering
A fast and progressive algorithm for skyline queries with totally- and partially-ordered domains
Journal of Systems and Software
Data & Knowledge Engineering
Efficient and adaptive distributed skyline computation
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
VSkyline: vectorization for efficient skyline computation
ACM SIGMOD Record
Efficient execution plans for distributed skyline query processing
Proceedings of the 14th International Conference on Extending Database Technology
RanKloud: a scalable ranked query processing framework on hadoop
Proceedings of the 14th International Conference on Extending Database Technology
Parallel skyline computation on multicore architectures
Information Systems
Efficient parallel skyline processing using hyperplane projections
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Direction-based surrounder queries for mobile recommendations
The VLDB Journal — The International Journal on Very Large Data Bases
Progressive processing of subspace dominating queries
The VLDB Journal — The International Journal on Very Large Data Bases
Information Sciences: an International Journal
Skyline-sensitive joins with LR-pruning
Proceedings of the 15th International Conference on Extending Database Technology
Proceedings of the 15th International Conference on Database Theory
A survey of skyline processing in highly distributed environments
The VLDB Journal — The International Journal on Very Large Data Bases
On saying "enough already!" in MapReduce
Proceedings of the 1st International Workshop on Cloud Intelligence
Efficient GPU-based skyline computation
Proceedings of the Ninth International Workshop on Data Management on New Hardware
Scalable skyline computation using a balanced pivot selection technique
Information Systems
Monochromatic and bichromatic mutual skyline queries
Expert Systems with Applications: An International Journal
On efficient reverse skyline query processing
Expert Systems with Applications: An International Journal
Parallel skyline queries over uncertain data streams in cloud computing environments
International Journal of Web and Grid Services
Hi-index | 0.00 |
Recently, skyline queries have attracted much attention in the database research community. Space partitioning techniques, such as recursive division of the data space, have been used for skyline query processing in centralized, parallel and distributed settings. Unfortunately, such grid-based partitioning is not suitable in the case of a parallel skyline query, where allpartitions are examined at the same time, since many data partitions do not contribute to the overall skyline set, resulting in a lot of redundant processing. In this paper we propose a novel angle-based space partitioning scheme using the hyperspherical coordinates of the data points. We demonstrate both formally as well as through an exhaustive set of experiments that this new scheme is very suitable for skyline query processing in a parallel share-nothing architecture. The intuition of our partitioning technique is that the skyline points are equally spread to all partitions. We also show that partitioning the data according to the hyperspherical coordinates manages to increase the average pruning power of points within a partition. Our novel partitioning scheme alleviates most of the problems of traditional grid partitioning techniques, thus managing to reduce the response time and share the computational workload more fairly. As demonstrated by our experimental study, our technique outperforms grid partitioning in all cases, thus becoming an efficient and scalable solution for skyline query processing in parallel environments.