M. Akinde, D. Chatziantoniou, T. Johnson, and S. Kim. The MD-Join: An operator for complex OLAP. Proc. of the International Conference on Data Engineering, 2001. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
TAX: A Tree Algebra for XML - Jagadish, Lakshmanan, Srivastava, al. (2001) (20 citations) (Correct)
....based on sum or max. 5.5 Grouping Unlike in the relational model, we separate grouping and aggregation. The rationale is that grouping has a natural direct role to play for restructuring data trees, orthogonally to aggregation. It is worth noting that such an approach has also been taken [2] in some recent proposals for an OLAP algebra. The objective is to split a collection into subsets of (not necessarily disjoint) data trees and represent each subset as an ordered tree in some meaningful way. As a motivating example, consider a collection of book elements grouped by title. We may ....
M. Akinde, D. Chatziantoniou, T. Johnson, and S. Kim. The MD-Join: An operator for complex OLAP. Proc. of the International Conference on Data Engineering, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC