Approximation of Pareto optima in multiple-objective, shortest-path problems
Operations Research
Scheduling problems in parallel query optimization
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
SIAM Journal on Optimization
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Mariposa: a wide-area distributed database system
The VLDB Journal — The International Journal on Very Large Data Bases
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Efficient information gathering on the Internet
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Indexing for progressive skyline computation
Data & Knowledge Engineering
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Stratified computation of skylines with partially-ordered domains
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Efficiently computing succinct trade-off curves
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Query optimization in distributed networks of autonomous database systems
ACM Transactions on Database Systems (TODS)
Approximately dominating representatives
Theoretical Computer Science
Efficient continuous skyline computation
Information Sciences: an International Journal
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient approximation of optimization queries under parametric aggregation constraints
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Multi-objective query processing for database systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Framework for Web service query algebra and optimization
ACM Transactions on the Web (TWEB)
Succinct approximate convex pareto curves
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
A Vision for Next Generation Query Processors and an Associated Research Agenda
Globe '09 Proceedings of the 2nd International Conference on Data Management in Grid and Peer-to-Peer Systems
Sapa: a multi-objective metric temporal planner
Journal of Artificial Intelligence Research
A new look at generating multi-join continuous query plans: A qualified plan generation problem
Data & Knowledge Engineering
The maximum hypervolume set yields near-optimal approximation
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
SIAM Journal on Computing
Schedule optimization for data processing flows on the cloud
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
M-TOP: multi-target operator placement of query graphs for data streams
Proceedings of the 15th Symposium on International Database Engineering & Applications
Top-k skyline: a unified approach
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Preferred skyline: a hybrid approach between SQLf and skyline
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Approximately dominating representatives
ICDT'05 Proceedings of the 10th international conference on Database Theory
Query trading in digital libraries
DELOS'04 Proceedings of the 6th Thematic conference on Peer-to-Peer, Grid, and Service-Orientation in Digital Library Architectures
Cross-Layer scheduling with content and packet priorities for optimal video streaming over 1xEV-DO
VLBV'05 Proceedings of the 9th international conference on Visual Content Processing and Representation
Approximation quality of the hypervolume indicator
Artificial Intelligence
Multi-objective optimization of data flows in a multi-cloud environment
Proceedings of the Second Workshop on Data Analytics in the Cloud
QoS-aware optimization of sensor network queries
The VLDB Journal — The International Journal on Very Large Data Bases
Decision problems for additive regular functions
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
The optimization of queries in distributed database systems is known to be subject to delicate trade-offs. For example, the Mariposa database system allows users to specify a desired delay-cost tradeoff (that is, to supply a decreasing function u(d), specifying how much the user is willing to pay in order to receive the query results within time d); Mariposa divides a query graph into horizontal “strides,” analyzes each stride, and uses a greedy heuristic to find the “best” plan for all strides. We show that Mariposa's greedy heuristic can be arbitrarily far from the desired optimum. Applying a recent approach in multiobjective optimization algorithms to this problem, we show that the optimum cost-delay trade-off (Pareto) curve in Mariposa's framework can be approximated fast within any desired accuracy. We also present a polynomial algorithm for the general multiobjective query optimization problem, which approximates arbirarily well the optimum cost-delay tradeoff (without the restriction of Mariposa's heuristic stride subdivision).