VoRaQue: Range Queries on Voronoi Overlays

被引：0
|
作者：
Albano, Michele [1 ]
Ricci, Laura [1 ]
Baldanzi, Martina [2 ]
Baraglia, Ranieri [2 ]
机构：
[1] Univ Pisa, Dept Comp Sci, Largo B Pontecorvo 3, I-56127 Pisa, Italy
[2] CNR, Inst Sci & Technol Informat, Pisa 56124, Italy
来源：
2008 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, VOLS 1-3 | 2008年
关键词：
peer-to-peer; multicast; compass routing; delaunay triangulation;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper presents VoRaQue, a software layer supporting range queries on Voronoi P2P overlays. VoRaQue maps data in a 2-dimensional space. The P2P overlay is defined by links connecting nodes that are close in the 2-dimensional space and by a set of long-range links which guarantee a poly-logarithmic routing. When a query is submitted, VoRaQue finds out a node belonging to the region defined by the query. A multicast spanning tree covering that region is then built by applying compass routing, a distributed protocol to embed a spanning tree into a Delaunay Triangulation. The paper presents the basic VoRaQue protocol, then introduces a set of optimizations and finally presents some experimental results.
引用
收藏
页码：397 / +
页数：2
相关论文
共 50 条
  • [1] Multidimensional range queries on hierarchical Voronoi overlays
    Ferrucci, L.
    Ricci, L.
    Albano, M.
    Baraglia, R.
    Mordacchini, M.
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2016, 82 (07) : 1161 - 1179
  • [2] Range queries in trie-structured overlays
    Datta, A
    Hauswirth, M
    John, R
    Schmidt, R
    Aberer, K
    [J]. FIFTH IEEE INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS, 2005, : 57 - 66
  • [3] Completeness estimation of range queries in structured overlays
    Karnstedt, Marcel
    Sattler, Kai-Uwe
    Schmidt, Roman
    [J]. P2P: SEVENTH INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS, 2007, : 71 - +
  • [4] Queries with segments in Voronoi diagrams
    Bespamyatnikh, S
    Snoeyink, J
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2000, 16 (01): : 23 - 33
  • [5] Queries with segments in Voronoi diagrams
    Bespamyatnikh, S
    Snoeyink, J
    [J]. PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 122 - 129
  • [6] The CoQUOS Approach to Continuous Queries in Unstructured Overlays
    Ramaswamy, Lakshmish
    Chen, Jianxia
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2011, 23 (03) : 463 - 478
  • [7] Area Queries Based on Voronoi Diagrams
    Li, Yang
    [J]. 2020 IEEE 36TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2020), 2020, : 2064 - 2068
  • [8] Queries on Voronoi diagrams of moving points
    Devillers, O
    Golin, M
    Kedem, K
    Schirra, S
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1996, 6 (05): : 315 - 327
  • [9] Supporting similarity range queries efficiently by using reference points in structured P2P overlays
    Lee, Guanling
    Chen, Yi-Chun
    Lee, Chung Chi
    [J]. Smart Innovation, Systems and Technologies, 2013, 20 : 645 - 652
  • [10] Cost-aware skyline queries in structured overlays
    Karnstedt, Marcel
    Mueller, Jessica
    Sattler, Kai-Uwe
    [J]. 2007 IEEE 23RD INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOP, VOLS 1-2, 2007, : 285 - 288
12345