Subspace Aggregation Query and Index Generation for Multidimensional Resource Space Model

Abstract

Organizing large-scale resources in a multidimensional semantic space is an approach to efficiently managing and querying resources from different semantic dimensions. To support advanced applications, this paper proposes a resource space model for aggregation query on subspaces defined by a range within the partial order on the coordinate trees representing each dimension, where each point in the subspace contains resources aggregated along the paths of the partial order relations on the coordinate trees and the aggregated resources at each point can be measured, ranked and selected by applications. To efficiently locate non-empty points in a large subspace, an approach to generating graph index is proposed to build partial order relations on coordinates of dimensions to enable a subspace query to reach non-empty points through indexing links and aggregate resources along indexing paths to their super points. Generating such an index is costly as the number of children of an indexing node can be large so that the total number of indexing nodes can be very large (exponentially growing with the number of dimensions and scale of dimensions). The proposed approach adopts the a set of strategies to reduce the cost. Analysis and experiments show the effectiveness of the generated index in supporting subspace aggregation query.