NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Efficient computation of the skyline cube
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Catching the best views of skyline: a semantic approach based on decisive subspaces
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Processing relaxed skylines in PDMS using distributed data summaries
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Efficient probabilistic subsumption checking for content-based publish/subscribe systems
Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware
Parallelizing skyline queries for scalable distribution
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Bandwidth-constrained distributed skyline computation
Proceedings of the Eighth ACM International Workshop on Data Engineering for Wireless and Mobile Access
AGiDS: A Grid-Based Strategy for Distributed Skyline Query Processing
Globe '09 Proceedings of the 2nd International Conference on Data Management in Grid and Peer-to-Peer Systems
Efficient execution plans for distributed skyline query processing
Proceedings of the 14th International Conference on Extending Database Technology
Processing fuzzy queries in a peer data management system using distributed fuzzy summaries
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Distributed skyline processing: a trend in database research still going strong
Proceedings of the 15th International Conference on Extending Database Technology
A survey of skyline processing in highly distributed environments
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
In this paper, we propose a bitmap approach for efficient subspace skyline computation in a distributed setting. Our approach computes extended skylines which have been shown to include all points necessary for computing the skyline at any subspace. We present an algorithm for computing extended skylines using a bitmap representation along with a storage efficient bucket-based variation of this representation. We provide a caching scheme so that subspace skyline queries can re-use the results of previously computed similar queries. We also introduce a method for grouping continuous subspace queries for supporting their efficient computation. Finally, we present preliminary experimental results of the performance of our approach.