Globase.KOM - A P2P overlay for fully retrievable location-based search

被引：17

作者：

Kovacevic, Aleksandra ^{[1
]}

Liebau, Nicolas ^{[1
]}

Steinmetz, Ralf ^{[1
]}

机构：

[1] Tech Univ Darmstadt, Darmstadt, Germany

来源：

P2P: SEVENTH INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS | 2007年

关键词：

D O I：

10.1109/P2P.2007.18

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Location based services are becoming increasingly popular as devices that determine geographical position become more available to end users. The main problem of existing solutions to location-based search is keeping information updated requires centralized maintenance at specific times. Therefore, retrieved results do not include all objects that exist in reality. A peer-to-peer (P2P) approach can easily overcome this issue as peers are responsible for the information users are searching for Unfortunately, current state-of-the-art overlays cannot fulfill the requirements for efficient and fully retrievable location-based search. In this paper we present Globase.KOM, a hierarchical tree-based P2P overlay that enables fully retrievable location-based overlay operations which proved to be highly efficient and logarithmically scalable.

引用

页码：87 / 94

页数：8

共 21 条

[1]

ARAUJO F, 2004, P NCA 04

[2] MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING [J].

BENTLEY, JL .

COMMUNICATIONS OF THE ACM, 1975, 18 (09) :509-517

[3]

CHAWATHE Y, 2005, SIGCOMM, P97

[4]

GARCIAMOLINA H, 1982, IEEE T COMPUT, V31, P48, DOI 10.1109/TC.1982.1675885

[5]

HARWOOD A, 2003, ATNAC, P5

[6]

HECKMANN O, 2006, P PTPP TRACK AMCIS

[7]

HEUTELBECK D, 2005, THESIS FERNUNIVERSIT

[8]

JAIN S, 2003, USENIX S INT TECHN S

[9]

KANEKO Y, 2005, SAINT W 05

[10]

KNOLL M, 2006, IWSOS 06

← 1 2 3 →