Context-Aware Top-k Processing using Views

被引:0
|
作者
Maniu, Silviu [1 ]
Cautis, Bogdan [2 ,3 ]
机构
[1] Univ Hong Kong, Dept Comp Sci, Pokfulam Rd, Hong Kong, Peoples R China
[2] Univ Paris Sud, F-91405 Orsay, France
[3] INRIA Saclay, F-91405 Orsay, France
关键词
top-k processing; context-aware applications; social search; spatial search;
D O I
10.1145/2505515.2505759
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Search applications where queries are dependent on their context are becoming increasingly relevant in today's online applications. For example, the context may be the location of the user in location-aware search or the social network of the query initiator in social-aware search. Processing such queries efficiently is inherently difficult, and requires techniques that go beyond the existing, context-agnostic ones. A promising direction for efficient, online answering - especially in the case of top-k queries - is to materialize and exploit previous query results (views). We consider context-aware query optimization based on views, focusing on two important sub-problems. First, handling the possible differences in context between the various views and an input query leads to view results having uncertain scores, i.e., score ranges valid for the new context. As a consequence, current top-k algorithms are no longer directly applicable and need to be adapted to handle such uncertainty in object scores. Second, adapted view selection techniques are needed, which can leverage both the descriptions of queries and statistics over their results. We present algorithms that address these two problems, and illustrate their practical use in two important application scenarios: location-aware search and social-aware search. We validate our approaches via extensive experiments, using both synthetic and real-world datasets.
引用
收藏
页码:1959 / 1968
页数:10
相关论文
共 50 条
  • [1] Top-k Context-Aware Tour Recommendations for Groups
    Ayala-Gomez, Frederick
    Kenis, Baris
    Karagoz, Pinar
    Benczur, Andras
    [J]. ADVANCES IN COMPUTATIONAL INTELLIGENCE, MICAI 2018, PT II, 2018, 11289 : 176 - 193
  • [2] Context-aware graph pattern based top-k designated nodes finding in social graphs
    Guanfeng Liu
    Qun Shi
    Kai Zheng
    Zhixu Li
    An Liu
    Jiajie Xu
    [J]. World Wide Web, 2019, 22 : 751 - 770
  • [3] Context-aware graph pattern based top-k designated nodes finding in social graphs
    Liu, Guanfeng
    Shi, Qun
    Zheng, Kai
    Li, Zhixu
    Liu, An
    Xu, Jiajie
    [J]. WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2019, 22 (02): : 751 - 770
  • [4] Maintenance of top-k materialized views
    Baikousi, Eftychia
    Vassiliadis, Panos
    [J]. DISTRIBUTED AND PARALLEL DATABASES, 2010, 27 (02) : 95 - 137
  • [5] Maintenance of top-k materialized views
    Eftychia Baikousi
    Panos Vassiliadis
    [J]. Distributed and Parallel Databases, 2010, 27 : 95 - 137
  • [6] A Confidence-Aware Top-k Query Processing Toolkit on Crowdsourcing
    Li, Yan
    Kou, Ngai Meng
    Wang, Hao
    Hou, Leong U.
    Gong, Zhiguo
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2017, 10 (12): : 1909 - 1912
  • [7] Personalized and Dynamic top-k Recommendation System using Context Aware Deep Reinforcement Learning
    Kabra, Anubha
    Agarwal, Anu
    [J]. 2021 IEEE 45TH ANNUAL COMPUTERS, SOFTWARE, AND APPLICATIONS CONFERENCE (COMPSAC 2021), 2021, : 238 - 247
  • [8] Top-k Query Processing in Probabilistic Databases with Non-Materialized Views
    Dylla, Maximilian
    Miliaraki, Iris
    Theobald, Martin
    [J]. 2013 IEEE 29TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2013, : 122 - 133
  • [9] Efficient maintenance of materialized top-k views
    Yi, K
    Yu, H
    Yang, J
    Xia, GQ
    Chen, YG
    [J]. 19TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2003, : 189 - 200
  • [10] Scalable Top-K Query Processing Using Graphics Processing Unit
    Zhang, Yulin
    Fang, Hui
    Li, Xiaoming
    [J]. LANGUAGES AND COMPILERS FOR PARALLEL COMPUTING, LCPC 2017, 2019, 11403 : 240 - 261