{"title":"数据立方体中沿维度层次结构的有效范围和查询","authors":"T. Lauer, Dominic Mai, P. Hagedorn","doi":"10.1109/DBKDA.2009.18","DOIUrl":null,"url":null,"abstract":"Fast response to users’ query and update requests continues to be one of the key requirements for OLAP systems. We outline the generalization of a space-efficient data structure, which makes it particularly suited for cubes with hierarchically structured dimensions. For a large class of range-sum queries – roll-up and drill-down along dimension hierarchies – the structure requires only a constant number of cell accesses per query on average, while offering an expected poly-logarithmic update performance.","PeriodicalId":231150,"journal":{"name":"2009 First International Confernce on Advances in Databases, Knowledge, and Data Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Efficient Range-Sum Queries along Dimensional Hierarchies in Data Cubes\",\"authors\":\"T. Lauer, Dominic Mai, P. Hagedorn\",\"doi\":\"10.1109/DBKDA.2009.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Fast response to users’ query and update requests continues to be one of the key requirements for OLAP systems. We outline the generalization of a space-efficient data structure, which makes it particularly suited for cubes with hierarchically structured dimensions. For a large class of range-sum queries – roll-up and drill-down along dimension hierarchies – the structure requires only a constant number of cell accesses per query on average, while offering an expected poly-logarithmic update performance.\",\"PeriodicalId\":231150,\"journal\":{\"name\":\"2009 First International Confernce on Advances in Databases, Knowledge, and Data Applications\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 First International Confernce on Advances in Databases, Knowledge, and Data Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DBKDA.2009.18\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 First International Confernce on Advances in Databases, Knowledge, and Data Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DBKDA.2009.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient Range-Sum Queries along Dimensional Hierarchies in Data Cubes
Fast response to users’ query and update requests continues to be one of the key requirements for OLAP systems. We outline the generalization of a space-efficient data structure, which makes it particularly suited for cubes with hierarchically structured dimensions. For a large class of range-sum queries – roll-up and drill-down along dimension hierarchies – the structure requires only a constant number of cell accesses per query on average, while offering an expected poly-logarithmic update performance.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
