Skip to main content

Multi-thread Processing of Long Aggregates Lists

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3911))

Abstract

In this paper we present a solution called Materialized Aggregate List designed for the storing and processing of long aggregate lists. An aggregate list contains aggregates, calculated from the data stored in the database. In our approach, once created, the aggregates are materialized for further use. The list structure contains a table divided into pages. We present three different multi-thread page-filling algorithms used when the list is browsed. The Materialized Aggregate List can be applied as a component of a node on every aggregation level in indexing structures, such as, an aR-tree. We present test results estimating an efficiency of the proposed solution.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baralis, E., Paraboschi, S., Teniente, E.: Materialized view selection in multidimensional database. In: Proc. 23th VLDB, Athens, pp. 156–165 (1997)

    Google Scholar 

  2. Golfarelli, M., Rizzi, S., Saltarelli, E.: Index selection for data warehousing. In: Proc. DMDW, Toronto (2002)

    Google Scholar 

  3. Gorawski, M., Malczok, R.: Distributed Spatial Data Warehouse Indexed with Virtual Memory Aggregation Tree. In: 5th STDBM_VLDB 2004 Workshop, Toronto (2004)

    Google Scholar 

  4. Gupta, H.: Selection of views to materialize in a data warehouse. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 98–112. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  5. Labio, W.J., Quass, D., Adelberg, B.: Physical database design for data warehouses. In: Proc. ICDE, pp. 277–288 (1997)

    Google Scholar 

  6. Papadias D., Kalnis P., Zhang J., Tao Y.: Effcient OLAP Operations in Spatial Data Warehouses. LNCS, vol. 2001. Spinger, Heidelberg

    Google Scholar 

  7. Rizzi, S., Saltarelli, E.: View Materialization vs. Indexing: Balancing Space Constraints in Data Warehouse Design. In: Eder, J., Missikoff, M. (eds.) CAiSE 2003. LNCS, vol. 2681, Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Theodoratos, D., Bouzehoub, M.: A general framework for the view selection problem for data warehouse design and evolution. In: Proc. DOLAP, McLean (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gorawski, M., Malczok, R. (2006). Multi-thread Processing of Long Aggregates Lists. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2005. Lecture Notes in Computer Science, vol 3911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752578_8

Download citation

  • DOI: https://doi.org/10.1007/11752578_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34141-3

  • Online ISBN: 978-3-540-34142-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics