Spatial data cubes based on shared dimensions and neighbourhood relationship concepts
by Tarik De Melo e Silva Rocha; Rodrigo Rocha Silva; Tiago Garcia De Senna Carneiro; Joubert De Castro Lima
International Journal of Business Information Systems (IJBIS), Vol. 37, No. 3, 2021

Abstract: A data cube has exponential storage and runtime complexities with linearly increasing dimensionality; in addition, a spatial data cube further complicates the issue since it integrates spatial features into a data cube. In this paper, a new data cube approach, named spatial cubing, or simply S-cubing, implements two spatial indexing techniques and two spatial non-relational representations. S-cubing based on shared dimensions is the first non-relational solution designed to support spatial data cubes with continuous dimensions, resolution hierarchies and multiple spatial measures and is capable of running on multi-core computer architectures. S-cubing, based on neighbourhood relationships, implements a new data cube hierarchy algorithm using relationships among cells of a regular grid. Thus, this algorithm creates thematic maps from non-geopolitical regular areas, therein avoiding manual hierarchy definitions. A sequential version is found to be faster than a PostGIS implementation and the parallel version achieved a speedup of 13 with 24 threads.

Online publication date: Fri, 09-Jul-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Information Systems (IJBIS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com