BIRCH: an efficient data clustering method for very large databases
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 17th International Conference on Data Engineering
Optimizing Multi-Feature Queries for Image Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Selectivity Estimation Without the Attribute Value Independence Assumption
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Mining thick skylines over large databases
PKDD '04 Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases
Maximal vector computation in large data sets
VLDB '05 Proceedings of the 31st international conference on Very large data bases
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
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Top-k query evaluation with probabilistic guarantees
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Parallelizing skyline queries for scalable distribution
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
On using histograms as routing indexes in peer-to-peer systems
DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
Angle-based space partitioning for efficient parallel skyline computation
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
BITPEER: continuous subspace skyline computation with distributed bitmap indexes
DaMaP '08 Proceedings of the 2008 international workshop on Data management in peer-to-peer systems
Skyframe: a framework for skyline query processing in peer-to-peer systems
The VLDB Journal — The International Journal on Very Large Data Bases
Bandwidth-constrained distributed skyline computation
Proceedings of the Eighth ACM International Workshop on Data Engineering for Wireless and Mobile Access
SkyTree: scalable skyline computation for sensor data
Proceedings of the Third International Workshop on Knowledge Discovery from Sensor Data
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
Skyline View: Efficient Distributed Subspace Skyline Computation
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Multidimensional routing indices for efficient distributed query processing
Proceedings of the 18th ACM conference on Information and knowledge management
Efficient mining of skyline objects in subspaces over data streams
Knowledge and Information Systems
A relaxed but not necessarily constrained way from the top to the sky
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
On the selectivity of multidimensional routing indices
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Efficient distributed skyline queries for mobile applications
Journal of Computer Science and Technology
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
Supporting efficient distributed skyline computation using skyline views
Information Sciences: an International Journal
Online subspace skyline query processing using the compressed skycube
ACM Transactions on Database Systems (TODS)
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
Scalable skyline computation using a balanced pivot selection technique
Information Systems
Monochromatic and bichromatic mutual skyline queries
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Peer Data Management Systems (PDMS) are a natural extension of heterogeneous database systems. One of the main tasks in such systems is efficient query processing. Insisting on complete answers, however, leads to asking almost every peer in the network. Relaxing these completeness requirements by applying approximate query answering techniques can significantly reduce costs. Since most users are not interested in the exact answers to their queries, rank-aware query operators like top-k or skyline play an important role in query processing. In this paper, we present the novel concept of relaxed skylines that combines the advantages of both rank-aware query operators and approximate query processing techniques. Furthermore, we propose a strategy for processing relaxed skylines in distributed environments that allows for giving guarantees for the completeness of the result using distributed data summaries as routing indexes.