Processing top-k queries in distributed hash tables

被引：0
作者：
Akbarinia, Reza [1 ,2 ]
Pacitti, Esther [1 ]
Valduriez, Patrick [1 ]
机构：
[1] Univ Nantes, INRIA, F-44035 Nantes, France
[2] Shahid Bahonar Univ Kerman, Kerman, Iran
来源：
EURO-PAR 2007 PARALLEL PROCESSING, PROCEEDINGS | 2007年 / 4641卷
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in large scale distributed systems, e.g. P2P systems. However, they only provide good support for exact-match queries, and it is hard to support complex queries such as top-k queries. In this paper, we propose a family of algorithms which deal with efficient processing of top-k queries in DHTs. We evaluated the performance of our solution through implementation over a 64-node cluster and simulation. Our performance evaluation shows very good performance, in terms of communication cost and response time.
引用
收藏
页码：489 / +
页数：3
相关论文
共 50 条
  • [31] Processing range top-k queries in a sparse data cube
    Hong, S
    Moon, B
    Lee, S
    IKE '04: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE ENGNINEERING, 2004, : 282 - 287
  • [32] Batch Processing of Top-k Spatial-Textual Queries
    Choudhury, Farhana M.
    Culpepper, J. Shane
    Bao, Zhifeng
    Sellis, Timos
    ACM TRANSACTIONS ON SPATIAL ALGORITHMS AND SYSTEMS, 2018, 3 (04)
  • [33] Efficient processing of top-k queries: selective NRA algorithms
    Jing Yuan
    Guangzhong Sun
    Tao Luo
    Defu Lian
    Guoliang Chen
    Journal of Intelligent Information Systems, 2012, 39 : 687 - 710
  • [34] Pruning techniques for parallel processing of reverse top-k queries
    Nikitopoulos, Panagiotis
    Sfyris, Georgios A.
    Vlachou, Akrivi
    Doulkeridis, Christos
    Telelis, Orestis
    DISTRIBUTED AND PARALLEL DATABASES, 2021, 39 (01) : 169 - 199
  • [35] Efficient processing of top-k frequent spatial keyword queries
    Tao Xu
    Aopeng Xu
    Joseph Mango
    Pengfei Liu
    Xiaqing Ma
    Lei Zhang
    Scientific Reports, 12
  • [36] An Experimental Evaluation of Aggregation Algorithms for Processing Top-K Queries
    Zhu, Liang
    Ma, Qin
    Meng, Weiyi
    Yang, Mingqian
    Yuan, Fang
    CIT/IUCC/DASC/PICOM 2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY - UBIQUITOUS COMPUTING AND COMMUNICATIONS - DEPENDABLE, AUTONOMIC AND SECURE COMPUTING - PERVASIVE INTELLIGENCE AND COMPUTING, 2015, : 326 - 333
  • [37] Efficient processing of top-k queries: selective NRA algorithms
    Yuan, Jing
    Sun, Guangzhong
    Luo, Tao
    Lian, Defu
    Chen, Guoliang
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2012, 39 (03) : 687 - 710
  • [38] Processing Top-k Monitoring Queries in Wireless Sensor Networks
    Thanh, Mai Hai
    Lee, Ki Yong
    Lee, Yu Won
    Kim, Myoung Ho
    2009 3RD INTERNATIONAL CONFERENCE ON SENSOR TECHNOLOGIES AND APPLICATIONS (SENSORCOMM 2009), 2009, : 545 - 552
  • [39] A Distributed Approach for Top-k Star Queries on Massive Information Networks
    Jin, Jiahui
    Khemmarat, Samamon
    Gao, Lixin
    Luo, Junzhou
    2014 20TH IEEE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS), 2014, : 9 - 16
  • [40] Distributed probabilistic top-k dominating queries over uncertain databases
    Niranjan Rai
    Xiang Lian
    Knowledge and Information Systems, 2023, 65 : 4939 - 4965
12345