BITPEER
Authors:
Open Access
- 25 March 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 35-42
Abstract
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.Keywords
This publication has 8 references indexed in Scilit:
- SKYPEER: Efficient Subspace Skyline Computation over Distributed Data2007
- Efficient Skyline Query Processing on Peer-to-Peer Networks2007
- Processing relaxed skylines in PDMS using distributed data summaries2006
- Parallelizing Skyline Queries for Scalable Distribution2006
- A routing scheme for content-based networking2005
- Efficient Distributed Skylining for Web Information Systems2004
- Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks2003
- NiagaraCQ2000