Skip to main content

Efficient Processing of Relational Queries with Sum Constraints

  • Conference paper
Advances in Data and Web Management (APWeb 2007, WAIM 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4505))

  • 1130 Accesses

Abstract

In this paper, we consider relational queries involving one or more constraints over the sum of multiple attributes (sum constraint queries). We develop rewriting techniques to transform a sum constraint query in order to enable its efficient processing by conventional relational database engines. We also consider the problem of producing partial results for sum constraint queries. We propose a framework for ranking tuples in a relation according to their likelihood of contributing to a tuple in the result of a sum constraint query. Sorting tuples using this framework provides an alternative to traditional sorting based on single attribute value.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Supporting Top-K Join Queries in Relational Databases. In: VLDB, Berlin, Germany (2003)

    Google Scholar 

  2. Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences 66, 614–656 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Goldstein, J., Ramakrishnan, R., Shaft, U., Yu, J.B.: Processing queries by linear-constraints. In: ACM Symp. Principles of Database Systems (1997)

    Google Scholar 

  4. Dumortier, F., Gyssens, M., Vandeurzen, L.: On the decidability of semi-linearity for semi-algebraic sets and its implications for spatial databases. In: PODS (1997)

    Google Scholar 

  5. Stonebraker, M., Hellerstein, J.M.: Content integration for e-business. In: PODS, Santa Barbara, California, United States (2001)

    Google Scholar 

  6. Liu, C., Yang, L., Foster, I., Angulo, D.: Design and Evaluation of a Resource Selection Framework. In: IEEE Intl. Symp. on High Performance Distributed Computing (2002)

    Google Scholar 

  7. Guha, S., Gunopoulos, D., Koudas, N., Srivastava, D., Vlachos, M.: Efficient approximation of optimization queries under parametric aggregation constraints. In: VLDB, Berlin, Germany (2003)

    Google Scholar 

  8. Foster, I., Kesselman, C.: The Grid: Blueprint for A New Computing Infrastructure. Morgan Kaufmann Publishers, San Francisco (1999)

    Google Scholar 

  9. Liu, C., Yang, L., Foster, I.: Efficient relational joins with arithmetic constraints on multiple attributes. In: Intl. Database Appl. & Engr. Symp., Montreal, Canada (2005)

    Google Scholar 

  10. Garcia-Molina, H., Ullman, J.D., Widom, J.: Database Systems: the Complete Book. Prentice-Hall, Upper Saddle River (2002)

    Google Scholar 

  11. Avnur, R., Hellerstein, J.M. (eds.): Continuously adaptive query processing. In: SIGMOD, Dallas, TX, USA (2000)

    Google Scholar 

  12. Selinger, P.G., Astrahan, M.M., Chamberlin, D.D., Lorie, R.A., Price, T.G.: Access path selection in a relational database management system. In: SIGMOD, Boston, USA (1979)

    Google Scholar 

  13. Shekita, E.J., Tan, K.L., Young, H.C.: Multi-join optimization for symmetric multiprocessors. In: VLDB, Dublin, Ireland (1993)

    Google Scholar 

  14. Wilschut, A.N., Flokstra, J., Apers, P.M.G.: Parallel evaluation of multi-join queries. In: SIGMOD, San Jose, USA (1995)

    Google Scholar 

  15. Agarwal, P.K., Arge, L., Erickson, J., Franciosa, P.G., Vitter, J.S.: Efficient searching with linear constraints. In: PODS, Seatle, Washington, United States (1998)

    Google Scholar 

  16. Marriott, K., Stuckey, P.J.: Programming with Constraints: An Introduction. The MIT Press, Cambridge (1998)

    MATH  Google Scholar 

  17. Wolsey, L.A., Nemhauser, G.L.: Integer and Combinatorial Optimization. Wiley-Interscience, Hoboken (1999)

    MATH  Google Scholar 

  18. USDA national nutrient database for standard reference: http://www.nal.usda.gov/fnic/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Guozhu Dong Xuemin Lin Wei Wang Yun Yang Jeffrey Xu Yu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Nestorov, S., Liu, C., Foster, I. (2007). Efficient Processing of Relational Queries with Sum Constraints. In: Dong, G., Lin, X., Wang, W., Yang, Y., Yu, J.X. (eds) Advances in Data and Web Management. APWeb WAIM 2007 2007. Lecture Notes in Computer Science, vol 4505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72524-4_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72524-4_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72483-4

  • Online ISBN: 978-3-540-72524-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics