A relaxed but not necessarily constrained way from the top to the sky

Authors:
Katja Hose;Christian Lemke;Kai-Uwe Sattler;Daniel Zinn
Affiliations:
Dept. of Computer Science and Automation, TU Ilmenau;Dept. of Computer Science and Automation, TU Ilmenau;Dept. of Computer Science and Automation, TU Ilmenau;Dept. of Computer Science, University of California, Davis
Venue:
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
Year:
2007

Citing 10
Cited 3

On Finding the Maxima of a Set of Vectors

Journal of the ACM (JACM)
Optimal aggregation algorithms for middleware

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Skyline Operator

Proceedings of the 17th International Conference on Data Engineering
Routing Indices For Peer-to-Peer Systems

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Constrained subspace skyline computation

CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Processing relaxed skylines in PDMS using distributed data summaries

CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Distributed Data Summaries for Approximate Query Processing in PDMS

IDEAS '06 Proceedings of the 10th International Database Engineering and Applications Symposium
Processing rank-aware queries in P2P systems

DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
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

A research agenda for query processing in large-scale peer data management systems

Information Systems
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

As P2P systems are a very popular approach to connect a possibly large number of peers, efficient query processing plays an important role. Appropriate strategies have to take the characteristics of these systems into account. Due to the possibly large number of peers, extensive flooding is not possible. The application of routing indexes is a commonly used technique to avoid flooding. Promising techniques to further reduce execution costs are query operators such as top-N and skyline, constraints, and the relaxation of exactness and/or completeness. In this paper, we propose strategies that take all these aspects into account. The choice is left to the user if and to what extent he is willing to relax exactness or apply constraints. We provide a thorough evaluation that uses two types of distributed data summaries as examples for routing indexes.