2001
DOI: 10.1016/s0306-4379(01)00023-0
|View full text |Cite
|
Sign up to set email alerts
|

A foundation for capturing and querying complex multidimensional data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
206
0
14

Year Published

2005
2005
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 211 publications
(220 citation statements)
references
References 29 publications
0
206
0
14
Order By: Relevance
“…A hierarchy is said to be non-strict when a child of a given level can have more than a parent of the superior level [11,15].…”
Section: 1! Complex Hierarchiesmentioning
confidence: 99%
See 2 more Smart Citations
“…A hierarchy is said to be non-strict when a child of a given level can have more than a parent of the superior level [11,15].…”
Section: 1! Complex Hierarchiesmentioning
confidence: 99%
“…A hierarchy is said to be non-covering if a dimension value can have no direct upper parent [11,15]. The complex hierarchies cause summarizability issues [13,10] i.e.…”
Section: 1! Complex Hierarchiesmentioning
confidence: 99%
See 1 more Smart Citation
“…[19] and Pedersen et.al. [20]. Though many of these models aid in the relational representation of aggregate data, contributions like the ALL operator and hierarchies are essential even from a multidimensional perspective.…”
Section: Related Workmentioning
confidence: 99%
“…We presented a conceptual, user-centric approach to data warehouse design called the BigC ube model in [3]. Several other models have also been proposed to conceptually model a data warehouse using a cube metaphor as surveyed and extended in [11,12]. Moving objects, their formal data type characterizations and operations have been introduced in [13,14].…”
Section: Related Workmentioning
confidence: 99%