Change search
ReferencesLink to record
Permanent link

Direct link
Space-efficient range-sum queries in OLAP
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
2004 (English)In: Data Warehousing and Knowledge Discovery. Proceedings: 6th international conference, DaWaK 2004, Zaragoza, Spain, September 1 - 3, 2004 : proceedings / [ed] Yahiko Kambayashi; Mukesh Mohania; Wolfram Wöß, Encyclopedia of Global Archaeology/Springer Verlag, 2004, 87-96 p.Conference paper (Refereed)
Abstract [en]

In this paper, we present a fast algorithm to answer range-sum queries in OLAP data cubes. Our algorithm supports constant-time queries while maintaining sub-linear time update and using minimum space. Furthermore, we study the trade-off between query time and update time. The complexity for query is O(2ℓd) and for updates O((2ℓ2ℓ√n)d) on a data cube of nd elements, where ℓ is a trade-off parameter. Our algorithm improve over previous best known results

Place, publisher, year, edition, pages
Encyclopedia of Global Archaeology/Springer Verlag, 2004. 87-96 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 3181
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-34204DOI: 10.1007/978-3-540-30076-2_9Local ID: 8563f470-c1ea-11db-9ea3-000ea68e967bISBN: 978-3-540-22937-XOAI: oai:DiVA.org:ltu-34204DiVA: diva2:1007454
Conference
International Conference on Data Warehousing and Knowledge Discovery : 01/09/2004 - 03/09/2004
Note
Validerad; 2004; 20070105 (pafi)Available from: 2016-09-30 Created: 2016-09-30Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Bengtsson, FredrikChen, Jingsen
By organisation
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 2 hits
ReferencesLink to record
Permanent link

Direct link