Algorithm for Term Linearizations of Aggregate Queries with Comparisons
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.
KeywordsSensor Network Wireless Sensor Network Cluster Head Term Linearization Database Schema
Unable to display preview. Download preview PDF.
- 3.Cohen, S., Nutt, W., Serebrenik, A.: Rewriting aggregate queries using views. In: PODS, pp. 155–166 (1999)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