On character-based index schemes for complex wildcard search in peer-to-peer networks

被引：4

作者：

Joung, Yuh-Jzer ^{[1
]}

Yang, Li-Wei ^{[2
]}

机构：

[1] Natl Taiwan Univ, Dept Informat Management, Taipei 106, Taiwan

[2] eLand Technol, Taipei 106, Taiwan

来源：

INFORMATION SCIENCES | 2014年 / 272卷

关键词：

Wildcard search; Keyword search; Character-based index scheme; Distributed search; Structured peer-to-peer (P2P) networks; DHT; RANGE QUERIES;

D O I：

10.1016/j.ins.2014.02.095

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We present a family of character-based index schemes for wildcard search in peer-to-peer networks. The supported query format allows the two wildcard matching operators '?' and '*' to be used arbitrarily. To our knowledge, no distributed solution for this general form of wildcard search has been proposed thus far. Moreover, the schemes can achieve balanced loads, avoid hot-spots and single points of failure, reduce storage and maintenance costs, and offer ranking mechanisms for matching objects. The main focus is on a thorough comparative study on these index schemes from the following perspectives: query expressiveness, encoding effectiveness, load balance, and search performance. (C) 2014 Elsevier Inc. All rights reserved.

引用

页码：209 / 222

页数：14

共 34 条

[1]

Aekaterinidis I., 2006, ICDCS 06 P IEEE INT, P23

[2]

Aekaterinidis I, 2007, PROC INT CONF DATA, P1365

[3] Scalable, efficient range queries for grid information services [J].

Andrzejak, A ;

Xu, ZC .

SECOND INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS, 2002, :33-40

[4]

Aspnes J., 2004, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, P115

[5]

Awerbuch Baruch., 2003, Proceedings of the twenty-second annual symposium on Principles of distributed computing, P123

[6] Mercury: Supporting scalable multi-attribute range queries [J].

Bharambe, AR ;

Agrawal, M ;

Seshan, S .

ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2004, 34 (04) :353-366

[7] Replica-aware, multi-dimensional range queries in Distributed Hash Tables [J].

Chazapis, Antony ;

Asiki, Athanasia ;

Tsoukalas, Georgios ;

Tsoumakos, Dimitrios ;

Koziris, Nectarios .

COMPUTER COMMUNICATIONS, 2010, 33 (08) :984-996

[8] Optimizing Bloom Filter Settings in Peer-to-Peer Multikeyword Searching [J].

Chen, Hanhua ;

Jin, Hai ;

Chen, Lei ;

Liu, Yunhao ;

Ni, Lionel M. .

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2012, 24 (04) :692-706

[9] Range queries in trie-structured overlays [J].

Datta, A ;

Hauswirth, M ;

John, R ;

Schmidt, R ;

Aberer, K .

FIFTH IEEE INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS, 2005, :57-66

[10]

Ganesan P, 2005, PROC INT CONF DATA, P256

← 1 2 3 4 →