Distributed Aggregation Strategies for Preference Queries
Explore this paper's citation graph
Summary
This paper considers the relevant case of preference queries, in which the user is interested in obtaining all and only the “best” results, and details a set of basic issues whose solution is a key to the derivation of an efficient distributed algorithm.
- Type
- article
- Published
- 2006-01-01
- Cited by
- 4
- References
- 13
- OpenAlex
- https://openalex.org/W41609114
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:9205250
Keywords
Computer science, Set (abstract data type), Simple (philosophy), Preference, Key (lock)
References
- Preference Queries with SV-Semantics
- Maximal Vector Computation in Large Data Sets
- Preference formulas in relational queries
- Robust Cardinality and Cost Estimation for Skyline Operator
- Progressive distributed top-k retrieval in peer-to-peer networks
- Routing indices for peer-to-peer systems
- Skyline Queries Against Mobile Lightweight Devices in MANETs
- The Skyline operator
- Efficient query reformulation in peer data management systems
- Parallelizing Skyline Queries for Scalable Distribution
- Foundations of Preferences in Database Systems
- Querying with Intrinsic Preferences
- Critical analysis of query processing techniques for heterogeneous environments
Cited by
- Optimization strategies for parallel computation of skylines
- Processing Preference Queries in Standard Database Systems
- Ist Project 35111 Tightening Knowledge Sharing in Distributed Software Communities by Applying Semantic Technologies Tightening Knowledge Sharing in Distributed Software Communities by Applying Semantic Technologies Strep Information Society Technologies (ist) D7: Report Describing State-of-the Art