Answering constrained k-NN queries in unstructured P2P systems

Bin Wang; Xiaochun Yang; Guoren Wang; Lei Chen; Sean X. Wang; Xuemin Lin; Ge Yu

Answering constrained k-NN queries in unstructured P2P systems

Bin Wang^*
, Xiaochun Yang
, Guoren Wang
, Lei Chen
, Sean X. Wang
, Xuemin Lin
, Ge Yu

^*此作品的通讯作者

Northeastern University China
Hong Kong University of Science and Technology
University of Vermont
University of New South Wales

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

摘要

The processing of k-NN queries has been studied extensively both in a centralized computing environment and in a structured P2P environment. However, the problem over an unstructured P2P system is not well studied despite of their popularity. Communication-efficient processing of k-NN queries in such an environment is a unique challenge due to the distribution, dynamics and large scale of the system. In this paper, we investigate the problem of efficiently computing k-NN queries over unstructured P2P systems. We first propose a location-based domination model to determine a search space. We then present two types of probing strategies, radius-convergence and radius-expanding. A comprehensive performance study demonstrates that our techniques are efficient and scalable.

源语言	英语
主期刊名	Databases, Information Systems, and Peer-to-Peer Computing - International Workshops, DBISP2P 2005/2006, Revised Selected Papers
页	397-405
页数	9
出版状态	已出版 - 2007
已对外发布	是
活动	International Workshops on Databases, Information Systems and Peer-to-Peer Computing, DBISP2P 2005/2006 - Seoul, 韩国期限: 11 9月 2006 → 11 9月 2006

丛书

姓名	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
卷	4125 LNCS
ISSN（印刷版）	0302-9743
ISSN（电子版）	1611-3349

会议

会议	International Workshops on Databases, Information Systems and Peer-to-Peer Computing, DBISP2P 2005/2006
国家/地区	韩国
市	Seoul
时期	11/09/06 → 11/09/06

其它文件与链接

链接到 Scopus 的出版物

引用此

Wang, B., Yang, X., Wang, G., Chen, L., Wang, S. X., Lin, X., & Yu, G. (2007). Answering constrained k-NN queries in unstructured P2P systems. 在 Databases, Information Systems, and Peer-to-Peer Computing - International Workshops, DBISP2P 2005/2006, Revised Selected Papers (页码 397-405). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 4125 LNCS).

Wang, Bin ; Yang, Xiaochun ; Wang, Guoren 等. / Answering constrained k-NN queries in unstructured P2P systems. Databases, Information Systems, and Peer-to-Peer Computing - International Workshops, DBISP2P 2005/2006, Revised Selected Papers. 2007. 页码 397-405 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5a2e8a96723347f396e686b7f70f60d0,

title = "Answering constrained k-NN queries in unstructured P2P systems",

abstract = "The processing of k-NN queries has been studied extensively both in a centralized computing environment and in a structured P2P environment. However, the problem over an unstructured P2P system is not well studied despite of their popularity. Communication-efficient processing of k-NN queries in such an environment is a unique challenge due to the distribution, dynamics and large scale of the system. In this paper, we investigate the problem of efficiently computing k-NN queries over unstructured P2P systems. We first propose a location-based domination model to determine a search space. We then present two types of probing strategies, radius-convergence and radius-expanding. A comprehensive performance study demonstrates that our techniques are efficient and scalable.",

author = "Bin Wang and Xiaochun Yang and Guoren Wang and Lei Chen and Wang, \{Sean X.\} and Xuemin Lin and Ge Yu",

year = "2007",

language = "English",

isbn = "9783540716600",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "397--405",

booktitle = "Databases, Information Systems, and Peer-to-Peer Computing - International Workshops, DBISP2P 2005/2006, Revised Selected Papers",

note = "International Workshops on Databases, Information Systems and Peer-to-Peer Computing, DBISP2P 2005/2006 ; Conference date: 11-09-2006 Through 11-09-2006",

}

Wang, B, Yang, X, Wang, G, Chen, L, Wang, SX, Lin, X & Yu, G 2007, Answering constrained k-NN queries in unstructured P2P systems. 在 Databases, Information Systems, and Peer-to-Peer Computing - International Workshops, DBISP2P 2005/2006, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 卷 4125 LNCS, 页码 397-405, International Workshops on Databases, Information Systems and Peer-to-Peer Computing, DBISP2P 2005/2006, Seoul, 韩国, 11/09/06.

Answering constrained k-NN queries in unstructured P2P systems. / Wang, Bin; Yang, Xiaochun; Wang, Guoren 等.
Databases, Information Systems, and Peer-to-Peer Computing - International Workshops, DBISP2P 2005/2006, Revised Selected Papers. 2007. 页码 397-405 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 4125 LNCS).

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

TY - GEN

T1 - Answering constrained k-NN queries in unstructured P2P systems

AU - Wang, Bin

AU - Yang, Xiaochun

AU - Wang, Guoren

AU - Chen, Lei

AU - Wang, Sean X.

AU - Lin, Xuemin

AU - Yu, Ge

PY - 2007

Y1 - 2007

N2 - The processing of k-NN queries has been studied extensively both in a centralized computing environment and in a structured P2P environment. However, the problem over an unstructured P2P system is not well studied despite of their popularity. Communication-efficient processing of k-NN queries in such an environment is a unique challenge due to the distribution, dynamics and large scale of the system. In this paper, we investigate the problem of efficiently computing k-NN queries over unstructured P2P systems. We first propose a location-based domination model to determine a search space. We then present two types of probing strategies, radius-convergence and radius-expanding. A comprehensive performance study demonstrates that our techniques are efficient and scalable.

AB - The processing of k-NN queries has been studied extensively both in a centralized computing environment and in a structured P2P environment. However, the problem over an unstructured P2P system is not well studied despite of their popularity. Communication-efficient processing of k-NN queries in such an environment is a unique challenge due to the distribution, dynamics and large scale of the system. In this paper, we investigate the problem of efficiently computing k-NN queries over unstructured P2P systems. We first propose a location-based domination model to determine a search space. We then present two types of probing strategies, radius-convergence and radius-expanding. A comprehensive performance study demonstrates that our techniques are efficient and scalable.

UR - https://www.scopus.com/pages/publications/38149058964

M3 - Conference contribution

AN - SCOPUS:38149058964

SN - 9783540716600

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 397

EP - 405

BT - Databases, Information Systems, and Peer-to-Peer Computing - International Workshops, DBISP2P 2005/2006, Revised Selected Papers

T2 - International Workshops on Databases, Information Systems and Peer-to-Peer Computing, DBISP2P 2005/2006

Y2 - 11 September 2006 through 11 September 2006

ER -

Wang B, Yang X, Wang G, Chen L, Wang SX, Lin X 等. Answering constrained k-NN queries in unstructured P2P systems. 在 Databases, Information Systems, and Peer-to-Peer Computing - International Workshops, DBISP2P 2005/2006, Revised Selected Papers. 2007. 页码 397-405. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Answering constrained k-NN queries in unstructured P2P systems

摘要

丛书

会议

其它文件与链接

学术指纹

引用此