Article

Efficient approximation of optimization queries under parametric aggregation constraints

Authors:

Dimitrios Gunopoulos,

Divesh Srivastava,

Michail VlachosAuthors Info & Claims

VLDB '03: Proceedings of the 29th international conference on Very large data bases - Volume 29

Pages 778 - 789

Published: 09 September 2003 Publication History

Abstract

We introduce and study a new class of queries that we refer to as OPAC (optimization under parametric aggregation constraints) queries. Such queries aim to identify sets of database tuples that constitute solutions of a large class of optimization problems involving the database tuples. The constraints and the objective function are specified in terms of aggregate functions of relational attributes, and the parameter values identify the constants used in the aggregation constraints.

We develop algorithms that preprocess relations and construct indices to efficiently provide answers to OPAC queries. The answers returned by our indices are approximate, not exact, and provide guarantees for their accuracy. Moreover, the indices can be tuned easily to meet desired accuracy levels, providing a graceful tradeoff between answer accuracy and index space. We present the results of a thorough experimental evaluation analyzing the impact of several parameters on the accuracy and performance of our techniques. Our results indicate that our methodology is effective and can be deployed easily, utilizing index structures such as R-trees.

References

[1]

{1} R. Agrawal and E. Wimmers. A Framework For Expressing and Combining Preferences. Proceedings of ACM SIGMOD, pages 297-306, June 2000.

Digital Library

[2]

{2} N. Bruno, L. Gravano, and A. Marian. Evaluating Top-k Queries Over Web Accessible Databases. Proceedings of ICDE, Apr. 2002.

Digital Library

[3]

{3} Y. Chang, L. Bergman, V. Castelli, C. Li, M. L. Lo, and J. Smith. The Onion Technique: Indexing for Linear Optimization Queries. Proceedings of ACM SIGMOD, pages 391-402, June 2000.

Digital Library

[4]

{4} C. Chekuri and S. Khanna. A PTAS For The Multiple Knapsack Problem. Proceedings of SODA, 2000.

Digital Library

[5]

{5} J. Climacao. Multicriteria Analysis. Sprienger Verlag, 1997.

[6]

{6} T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. McGraw Hill and MIT Press, 1990.

Digital Library

[7]

{7} M. Ehrgott. Multicriteria Optimization. Springer, 2000.

Digital Library

[8]

{8} R. Fagin and E. Wimmers. Incorporating User Preferences in Multimedia Queries. ICDT, pages 247-261, Jan. 1997.

Digital Library

[9]

{9} L. Gravano and S. Chaudhuri. Evaluating Top-k Selection Queries. Proceedings of VLDB, Aug. 1999.

Digital Library

[10]

{10} V. Hristidis, N. Koudas, and Y. Papakonstantinou. Efficient Execution of Multiparametric Ranked Queries. Proceedings of SIGMOD, June 2001.

Digital Library

[11]

{11} W. Kiebling. Foundations of Preferences in Database Systems. Proceedings of VLDB, Aug. 2002.

Digital Library

[12]

{12} W. Kiebling and G. Kostler. Preference SQL: Design, Implementation, Experiences. Proceedings of VLDB, Aug. 2002.

Digital Library

[13]

{13} A. Natsev, Y.-C. Chang, J. Smith, C.-S. Li, and J. S. Vitter. Supporting Incremental Join Queries on Ranked Inputs. Proceedings of VLDB, Aug. 2001.

Digital Library

[14]

{14} C. Papadimitriou and M. Yannakakis. On the approximability of trade-offs and optimal access to web sources. Proceedings of FOCS, 2000.

Digital Library

[15]

{15} C. Papadimitriou and M. Yannakakis. Multiobjective Query Optimization. Proceedings of ACM PODS, June 2001.

Digital Library

[16]

{16} K. A. Ross, D. Srivastava, P. Stuckey, and S. Sudarshan. Foundations of aggregation constraints. Theoretical Computer Science , 193(1-2):149-179, 1998. An early version appeared in Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming, 1994, LNCS 874.

Digital Library

[17]

{17} P. Tsaparas, T. Palpanas, Y. Kotidis, N. Koudas, and D. Srivastava. Ranked Join Indicies. Proceedings IEEE ICDE, Mar. 2003.

[18]

{18} E. Zitzler. Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. ETH Zurich PhD Thesis, 1999.

Cited By

Brucato MAbouzied AMeliou A(2018)Package queriesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-017-0483-427:5(693-718)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1007/s00778-017-0483-4
Brucato MBeltran JAbouzied AMeliou A(2016)Scalable package queries in relational database systemsProceedings of the VLDB Endowment10.14778/2904483.29044899:7(576-587)Online publication date: 1-Mar-2016
https://dl.acm.org/doi/10.14778/2904483.2904489
Khan ASingh V(2015)Top-k representative queries with binary constraintsProceedings of the 27th International Conference on Scientific and Statistical Database Management10.1145/2791347.2791367(1-10)Online publication date: 29-Jun-2015
https://dl.acm.org/doi/10.1145/2791347.2791367
Show More Cited By

Index Terms

Efficient approximation of optimization queries under parametric aggregation constraints
1. Information systems
  1. Data management systems
  2. Information retrieval
    1. Evaluation of retrieval results
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

Scalable and efficient processing of top-k multiple-type integrated queries
Abstract
In this paper, we define a new class of queries, the top-k multiple-type integrated query (simply, top-k MULTI query). It deals with multiple data types and finds the information in the order of relevance between the query and the object. Various ...
Scalable containment for unions of conjunctive queries under constraints
SWIM '13: Proceedings of the Fifth Workshop on Semantic Web Information Management

We consider the problem of query containment under ontological constraints, such as those of RDFS. Query containment, i.e., deciding whether the answers of a given query are always contained in the answers of another query, is an important problem to ...
Containment and Optimization of Object-Preserving Conjunctive Queries

In the optimization of queries in an object-oriented database (OODB) system, a natural first step is to use the typing constraints imposed by the schema to transform a query into an equivalent one that logically accesses a minimal set of objects. We ...

Comments

Information & Contributors

Information

Published In

cover image DL Hosted proceedings

VLDB '03: Proceedings of the 29th international conference on Very large data bases - Volume 29

September 2003

1134 pages

ISBN:0127224424

Sponsors

VLDB Endowment: Very Large Database Endowment

Publisher

VLDB Endowment

Publication History

Published: 09 September 2003

Qualifiers

Article

Conference

VLDB '03

Sponsor:

VLDB Endowment

VLDB '03: Very large data bases

September 9 - 12, 2003

Berlin, Germany

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
78
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Brucato MAbouzied AMeliou A(2018)Package queriesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-017-0483-427:5(693-718)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1007/s00778-017-0483-4
Brucato MBeltran JAbouzied AMeliou A(2016)Scalable package queries in relational database systemsProceedings of the VLDB Endowment10.14778/2904483.29044899:7(576-587)Online publication date: 1-Mar-2016
https://dl.acm.org/doi/10.14778/2904483.2904489
Khan ASingh V(2015)Top-k representative queries with binary constraintsProceedings of the 27th International Conference on Scientific and Statistical Database Management10.1145/2791347.2791367(1-10)Online publication date: 29-Jun-2015
https://dl.acm.org/doi/10.1145/2791347.2791367
Trummer IKoch CDyreson CLi FÖzsu M(2014)Approximation schemes for many-objective query optimizationProceedings of the 2014 ACM SIGMOD International Conference on Management of Data10.1145/2588555.2610527(1299-1310)Online publication date: 18-Jun-2014
https://dl.acm.org/doi/10.1145/2588555.2610527
Endres MKießling W(2011)Semi-skyline optimization of constrained skyline queriesProceedings of the Twenty-Second Australasian Database Conference - Volume 11510.5555/2460396.2460400(7-16)Online publication date: 17-Jan-2011
https://dl.acm.org/doi/10.5555/2460396.2460400
Tran QChan CWang G(2011)Evaluation of set-based queries with aggregation constraintsProceedings of the 20th ACM international conference on Information and knowledge management10.1145/2063576.2063791(1495-1504)Online publication date: 24-Oct-2011
https://dl.acm.org/doi/10.1145/2063576.2063791
Doherty PSzałas A(2008)Reasoning with qualitative preferences and cardinalities using generalized circumscriptionProceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning10.5555/3031661.3031729(560-570)Online publication date: 16-Sep-2008
https://dl.acm.org/doi/10.5555/3031661.3031729
Nestorov SLiu CFoster I(2007)Efficient processing of relational queries with sum constraintsProceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management10.5555/1769708.1769766(440-451)Online publication date: 16-Jun-2007
https://dl.acm.org/doi/10.5555/1769708.1769766
Kini AShankar SNaughton JDewitt DYu CScheuermann PChaudhuri S(2006)Database support for matchingProceedings of the 2006 ACM SIGMOD international conference on Management of data10.1145/1142473.1142484(85-96)Online publication date: 27-Jun-2006
https://dl.acm.org/doi/10.1145/1142473.1142484
Li CChang KIlyas ISong SOzcan F(2005)RankSQLProceedings of the 2005 ACM SIGMOD international conference on Management of data10.1145/1066157.1066173(131-142)Online publication date: 14-Jun-2005
https://dl.acm.org/doi/10.1145/1066157.1066173
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten