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 条
  • [41] Mining frequent query patterns from XML queries
    Yang, LH
    Lee, ML
    Hsu, W
    Acharya, S
    EIGHTH INTERNATIONAL CONFERENCE ON DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PROCEEDINGS, 2003, : 355 - 362
  • [42] Fast Discovering Frequent Patterns for Incremental XML Queries
    PENG Dun-lu 1
    2.Department of Computer Science and Engineering
    Wuhan University Journal of Natural Sciences, 2004, (05) : 638 - 646
  • [43] Exploratory mining via constrained frequent set queries
    Ng, R
    Lakshmanan, LVS
    Han, JW
    Mah, T
    SIGMOD RECORD, VOL 28, NO 2 - JUNE 1999: SIGMOD99: PROCEEDINGS OF THE 1999 ACM SIGMOD - INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 1999, : 556 - 558
  • [44] A greedy approach to concurrent processing of frequent itemset queries
    Boinski, Pawel
    Wojciechowski, Marek
    Zakrzewicz, Maciej
    DATA WAREHOUSING AND KNOWLEDGE DISCOVERY, PROCEEDINGS, 2006, 4081 : 292 - 301
  • [45] Parallel Skyline Computation for Frequent Queries in Distributed Environment
    Kulkarni, R. D.
    Momin, B. F.
    2016 INTERNATIONAL CONFERENCE ON COMPUTATIONAL TECHNIQUES IN INFORMATION AND COMMUNICATION TECHNOLOGIES (ICCTICT), 2016,
  • [46] Inverse Range Selection Queries
    Kulekci, M. Oguzhan
    STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2016, 2016, 9954 : 166 - 177
  • [47] Database selection for longer queries
    Wu, WS
    Yu, C
    Meng, WY
    CLASSIFICATION, CLUSTERING, AND DATA MINING APPLICATIONS, 2004, : 575 - 584
  • [48] A Correlation-Aware Partial Materialization Scheme for Near Real-Time Automotive Queries
    Hua, Yu
    Feng, Dan
    2014 INTERNATIONAL CONFERENCE ON SMART COMPUTING (SMARTCOMP), 2014,
  • [49] Multi-Objective Big Data View Materialization Using MOGA
    Kumar, Akshay
    Kumar, T. V. Vijay
    INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING, 2022, 13 (01)
  • [50] Improving Star Join Queries Performance: A Maximal Frequent Pattern Based Approach for Automatic Selection of Indexes in Relational Data Warehouses
    Ziani, B.
    Ouinten, Y.
    2010 THE 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND INDUSTRIAL APPLICATION (PACIIA2010), VOL II, 2010, : 76 - 79