Skip to main content

Algorithm for Term Linearizations of Aggregate Queries with Comparisons

  • Conference paper
  • 3170 Accesses

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

Abstract

We consider the problem of rewriting queries based exclusively on views. Both queries and views can contain aggregate functions and include arithmetic comparisons. To study the equivalence of a query with its rewriting query, the so called ”linearizations of a query” need to be computed. To find the linearizations of a query, the linearizations of terms from the query need to be generated. We propose an algorithm to find these term linearizations and give a bound for its time-complexity.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Afrati, F., Li, C., Mitra, P.: Rewriting queries using views in the presence of arithmetic comparisons. Theoretical Computer Science 368, 88–123 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cohen, S.: Containment of aggregate queries. ACM SIGMOD 34(1), 77–85 (2005)

    Article  Google Scholar 

  3. Cohen, S., Nutt, W., Serebrenik, A.: Rewriting aggregate queries using views. In: PODS, pp. 155–166 (1999)

    Google Scholar 

  4. Cohen, S., Nutt, W., Sagiv, Y.: Deciding equivalences among conjunctive aggregate queries. Journal of the ACM 54(2), 1–50 (2007)

    Article  MathSciNet  Google Scholar 

  5. Grumbach, S., Rafanelli, M., Shurin, S.: On the equivalence and rewriting of aggregate queries. Acta Informatica 4(8) (2004)

    Google Scholar 

  6. Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-efficient Communication Protocol for Wireless Microsensor Networks. In: 33rd Annual Hawaii International Conference on System Sciences (HICSS-33), pp. 3005–3014 (2000)

    Google Scholar 

  7. Madden, S., Szewczyk, R., Franklin, M., Culler, D.: Supporting aggregate queries over ad-hoc wireless sensor networks. In: Proc. of 4th IEEE Workshop on Mobile Computing Systems and Applications, pp. 49–58 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Felea, V., Felea, V. (2012). Algorithm for Term Linearizations of Aggregate Queries with Comparisons. In: Liddle, S.W., Schewe, KD., Tjoa, A.M., Zhou, X. (eds) Database and Expert Systems Applications. DEXA 2012. Lecture Notes in Computer Science, vol 7447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32597-7_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32597-7_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32596-0

  • Online ISBN: 978-3-642-32597-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics