Maintenance of top-k materialized views

被引:2
|
作者
Baikousi, Eftychia [1 ]
Vassiliadis, Panos [1 ]
机构
[1] Univ Ioannina, Dept Comp Sci, GR-45110 Ioannina, Greece
关键词
Top-k views; View refreshment; ALGORITHMS; QUERIES;
D O I
10.1007/s10619-009-7057-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we present results on the problem of maintaining materialized top-k views and provide results in two directions. The first problem we tackle concerns the maintenance of top-k views in the presence of high deletion rates. We provide a principled method that complements the inefficiency of the state of the art independently of the statistical properties of the data and the characteristics of the update streams. The second problem we have been concerned with has to do with the efficient maintenance of multiple top-k views in the presence of updates to their base relation. To this end, we provide theoretical guarantees for the nucleation (practically, inclusion) of a view with respect to another view and the reflection of this property to the management of updates. We also provide algorithmic results towards the maintenance of a large number of views, via their appropriate structuring in hierarchies of views.
引用
收藏
页码:95 / 137
页数:43
相关论文
共 50 条
  • [41] Energy-efficient top-k query evaluation and maintenance in wireless sensor networks
    Baichen Chen
    Weifa Liang
    Jeffrey Xu Yu
    [J]. Wireless Networks, 2014, 20 : 591 - 610
  • [42] Top-K Miner: top-K identical frequent itemsets discovery without user support threshold
    Jawad Saif-Ur-Rehman
    Asad Ashraf
    Abdus Habib
    [J]. Knowledge and Information Systems, 2016, 48 : 741 - 762
  • [43] Top-k Ranking Bayesian Optimization
    Quoc Phong Nguyen
    Tay, Sebastian
    Low, Bryan Kian Hsiang
    Jaillet, Patrick
    [J]. THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 9135 - 9143
  • [44] Processing Top-k Join Queries
    Wu, Minji
    Berti-Equille, Laure
    Marian, Amelie
    Procopiuc, Cecilia M.
    Srivastava, Divesh
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2010, 3 (01): : 860 - 870
  • [45] Efficient Top-K Retrieval with Signatures
    Chappell, Timothy
    Geva, Shlomo
    Anthony Nguyen
    Zuccon, Guido
    [J]. PROCEEDINGS OF THE 18TH AUSTRALASIAN DOCUMENT COMPUTING SYMPOSIUM (ADCS 2013), 2013, : 10 - 17
  • [46] Top-k String Similarity Joins
    Qi, Shuyao
    Bouros, Panagiotis
    Mamoulis, Nikos
    [J]. PROCEEDINGS OF THE 32TH INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT, SSDBM 2020, 2020,
  • [47] On the Practical Detection of the Top-k Flows
    Moraney, Jalil
    Raz, Danny
    [J]. 2018 14TH INTERNATIONAL CONFERENCE ON NETWORK AND SERVICE MANAGEMENT (CNSM), 2018, : 81 - 89
  • [48] Top-k Combinatorial Skyline Queries
    Su, I-Fang
    Chung, Yu-Chi
    Lee, Chiang
    [J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PT II, PROCEEDINGS, 2010, 5982 : 79 - +
  • [49] Top-k Tree Similarity Join
    Wang, Jianhua
    Yang, Jianye
    Zhang, Wenjie
    [J]. PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021, 2021, : 1939 - 1948
  • [50] Diversified Top-K Clique Search
    Yuan, Long
    Qin, Lu
    Lin, Xuemin
    Chang, Lijun
    Zhang, Wenjie
    [J]. 2015 IEEE 31ST INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2015, : 387 - 398