Frequent Queries Selection for View Materialization

被引:0
|
作者
Kumar, T. V. Vijay [1 ]
Dubey, Gaurav [3 ]
Singh, Archana [2 ]
机构
[1] Jawaharlal Nehru Univ, Sch Comp & Syst Sci, New Delhi 110067, India
[2] Amity Sch Comp Sci, UP-201303 Noida, India
[3] Amity Inst Informat Technol, UP-20130I Noida, India
关键词
GREEDY ALGORITHM; SIZE;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A data warehouse stores historical data for answering analytical queries. These analytical queries are long, complex and exploratory in nature and, when processed against a large data warehouse, consume a lot of time for processing. As a result the query response time is high. This time can be reduced by materializing views over a data warehouse. These views aim to improve the query response time. For this, they are required to contain relevant information for answering future queries. In this paper, an approach is presented that identifies such relevant information, obtained from previously posed queries on the data warehouse. The approach first identifies subject specific queries and then, from amongst such subject specific queries, frequent queries are selected. These selected frequent queries contain information that has been accessed frequently in the past and therefore has high likelihood of being accessed by future queries. This would result in an improvement in query response time and thereby result in efficient decision making.
引用
收藏
页码:521 / +
页数:4
相关论文
共 50 条
  • [31] Efficient Processing of Streams of Frequent Itemset Queries
    Rokosik, Monika
    Wojciechowski, Marek
    NEW TRENDS IN DATABASE AND INFORMATION SYSTEMS II, 2015, 312 : 15 - 26
  • [32] An Efficient Computation of Frequent Queries in a Star Schema
    Dieng, Cheikh Tidiane
    Jen, Tao-Yuan
    Laurent, Dominique
    DATABASE AND EXPERT SYSTEMS APPLICATIONS, PT 2, 2010, 6262 : 225 - 239
  • [33] Answering Frequent Probabilistic Inference Queries in Databases
    Song, Shaoxu
    Chen, Lei
    Yu, Jeffrey Xu
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2011, 23 (04) : 512 - 526
  • [34] Towards mining frequent queries in star schemes
    Jen, Tao-Yuan
    Laurent, Dominique
    Spyratos, Nicolas
    Sy, Oumar
    KNOWLEDGE DISCOVERY IN INDUCTIVE DATABASES, 2006, 3933 : 104 - 123
  • [35] Preview: Optimizing view materialization cost in spatial data warehouses
    Yu, Songmei
    Atluri, Vijayalakshmi
    Adam, Nabil
    DATA WAREHOUSING AND KNOWLEDGE DISCOVERY, PROCEEDINGS, 2006, 4081 : 45 - 54
  • [36] A Multi-Objective Approach to Big Data View Materialization
    Kumar, Akshay
    Kumar, T. V. Vijay
    INTERNATIONAL JOURNAL OF KNOWLEDGE AND SYSTEMS SCIENCE, 2021, 12 (02) : 17 - 37
  • [37] Selection of Views for Materialization Using Size and Query Frequency
    Kumar, T. V. Vijay
    Haider, Mohammad
    INFORMATION TECHNOLOGY AND MOBILE COMMUNICATION, 2011, 147 : 150 - 155
  • [38] A dynamic view materialization scheme for sequences of query and update statements
    Xu, Wugang
    Theodoratos, Dimitri
    Zuzarte, Calisto
    Wu, Xiaoying
    Oria, Vincent
    DATA WAREHOUSING AND KNOWLEDGE DISCOVERY, PROCEEDINGS, 2007, 4654 : 55 - +
  • [39] An adaptive index of XML for frequent branching path queries
    Fan, Yingjie
    Zhang, Chenghong
    Wang, Shuyun
    Hao, Xiulan
    Hu, Yunfa
    7TH IEEE/ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE IN CONJUNCTION WITH 2ND IEEE/ACIS INTERNATIONAL WORKSHOP ON E-ACTIVITY, PROCEEDINGS, 2008, : 269 - +
  • [40] Skyline computation for frequent queries in update intensive environment
    Kulkarni, R. D.
    Momin, B. F.
    JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2016, 28 (04) : 447 - 456