Skip to main content

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 518))

Abstract

Selection of best set of views that can minimize answering cost of queries under space or maintenance cost bounds is a problem of view selection in data warehouse. Various solutions have been provided by minimizing/maximizing cost functions using various frameworks such as lattice, MVPP. Parameters that have been considered in the cost functions for view selection include view size, query frequency, view update cost, view sharing cost, etc. However, queries also have a priority value indicating the level of importance in generating its results. Some queries require immediate response time, while some can wait. Thus, if views needed by highly prioritized queries are pre-materialized, their response time can be faster. Query priority can help in selection of better set of views by which higher priority views can be selected before lower priority views. Thus, we introduce query priority and cube priority for view selection in data warehouse.

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 EPUB and 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

References

  1. Inmon, W.: Building the data warehouse. Wiley Publications (1991) 23.

    Google Scholar 

  2. Gupta, H.: Selection of views to materialize in a data warehouse. In: Proceedings of the Intl. Conf. on Database Theory. Delphi Greece (1997).

    Google Scholar 

  3. Harinarayan, V., Rajaraman, A., Ullman, J.D.: Implementing data cubes efficiently. In: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, Montreal, Que., Canada (1996) 205–216.

    Google Scholar 

  4. Yang, J., Karlapalem, K., Li, Q.: Algorithm for materialized view design in data warehousing environment. In: Jarke M, Carey MJ, Dittrich KR, et al (eds). Proceedings of the 23rd international conference on very large data bases, Athens, Greece (1997) 136–145.

    Google Scholar 

  5. Kumar, TV Vijay., Ghoshal, A.: A reduced lattice greedy algorithm for selecting materialized views. Information Systems, Technology and Management. Springer Berlin Heidelberg (2009) 6–18.

    Google Scholar 

  6. Lin, WY., Kuo, IC.: OLAP data cubes configuration with genetic algorithms. In: IEEE International Conference on Systems, Man, and Cybernetics. Vol. 3 (2000).

    Google Scholar 

  7. Lin, WY., Kuo IC.: A genetic selection algorithm for OLAP data cubes. Knowledge and information systems 6.1 (2004) 83–102.

    Google Scholar 

  8. Zhang, C., Yao, X., Yang, J.: An evolutionary approach to materialized views selection in a data warehouse environment. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 31.3 (2001) 282–294.

    Google Scholar 

  9. Horng, J-T., Chang, Y-J., Liu, B-J.: Applying evolutionary algorithms to materialized view selection in a data warehouse. Soft Computing 7.8 (2003) 574–581.

    Google Scholar 

  10. Derakhshan, R., et al.: Simulated Annealing for Materialized View Selection in Data Warehousing Environment. Databases and applications. (2006).

    Google Scholar 

  11. Derakhshan, R., et al.: Parallel simulated annealing for materialized view selection in data warehousing environments. Algorithms and architectures for parallel processing. Springer Berlin Heidelberg (2008) 121–132.

    Google Scholar 

  12. Vaisman, A.: Data quality-based requirements elicitation for decision support systems. Data warehouses and OLAP: concepts, architectures, and solutions. IGI Global (2007) 58–86.

    Google Scholar 

  13. Han, J., Kamber, M., Pei, J.: Data mining: concepts and techniques. Elsevier (2011) 113.

    Google Scholar 

  14. Gray J, Chaudhuri S, Bosworth A, et al.: Data cube: A relational aggregation operator generalizing group-by, cross-tabs and subtotals. Data Mining and Knowledge Discovery 1(1) (1997) 29–53.

    Google Scholar 

  15. Kimball, R., Caserta, J.: The data warehouse ETL toolkit. John Wiley & Sons (2004) 63.

    Google Scholar 

  16. Silvers, F.: Building and maintaining a data warehouse. CRC Press, (2008) 277–287.

    Google Scholar 

  17. Browning, D., Mundy, J.: Data Warehouse Design Considerations. https://technet.microsoft.com/en-us/library/aa902672(v=sql.80).aspx#sql_dwdesign_dwusers (2001).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Heena Madaan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Gosain, A., Heena Madaan (2018). Query Prioritization for View Selection. In: Sa, P., Sahoo, M., Murugappan, M., Wu, Y., Majhi, B. (eds) Progress in Intelligent Computing Techniques: Theory, Practice, and Applications. Advances in Intelligent Systems and Computing, vol 518. Springer, Singapore. https://doi.org/10.1007/978-981-10-3373-5_40

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3373-5_40

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3372-8

  • Online ISBN: 978-981-10-3373-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics