Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IN, NS (Joint) |
2023-03-03 12:00 |
Okinawa |
Okinawa Convention Centre + Online (Primary: On-site, Secondary: Online) |
Multi-Attribute Queries in IPFS Hidehiro (TUT), Kenji Kanai, Hidenori Nakazato (WAS) IN2022-114 |
IPFS (InterPlanetary File System) is a distributed database middleware, and that is focused on as a Web3.0 key technolog... [more] |
IN2022-114 pp.289-292 |
IA |
2021-01-29 14:25 |
Online |
Online |
A Routing Method for Range Queries Utilizing Detour Routes on Skip Graph Yuya Miki, Takeshi Kaneko (Tokyo Tech), Ryohei Banno (Tokyo Tech/Kogakuin Univ.), Kazuyuki Shudo (Tokyo Tech) IA2020-33 |
A structured overlay is a technique to construct an autonomous decentralized network of nodes and to achieve efficient r... [more] |
IA2020-33 pp.15-20 |
IA |
2018-09-04 14:40 |
Hokkaido |
Hokkaido Univ. Conference Hall |
Reducing Average Path Lengths of Range Queries on Skip Graphs Ryohei Banno, Kazuyuki Shudo (Tokyo Tech) IA2018-27 |
Structured overlay networks are useful techniques to enable a large number of nodes to discover each other in an autonom... [more] |
IA2018-27 pp.69-76 |
IA |
2016-01-29 15:15 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. B3 Kenshu-2 room |
An effective and cost efficient load balancing method for range queriable cloud storage Xun Shao, Masahiro Jibiki, Yuuichi Teranishi, Nozomu Nishinaga (NICT) IA2015-85 |
The rising popularity of big data processing for semantically rich applications such as social networks and IoT (Interne... [more] |
IA2015-85 pp.37-42 |
IA |
2014-01-30 16:15 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
A Proximity Aware Extension of Skip Graph for World Wide Range Queries Xun Shao, Masahiro Jibiki, Yuuichi Teranishi, Nozomu Nishinaga (NICT) IA2013-74 |
The rapid development of crowd sensing and cloud computing makes it possible to build world wide Cyber Physical Systems ... [more] |
IA2013-74 pp.37-42 |
ISEC, LOIS |
2011-11-15 15:40 |
Osaka |
Osaka Electro-Communication University |
Content Authentication for Range Queries in Peer-to-Peer Networks Shoichi Hirose (Univ. of Fukui) ISEC2011-60 LOIS2011-54 |
In this article, we propose a distributed authenticated data structure for range queries, which is called distributed au... [more] |
ISEC2011-60 LOIS2011-54 pp.177-180 |
IN |
2009-01-23 14:15 |
Aichi |
Nagoya Institute of Technology |
Multi-dimensional Indexing in P2P Network with Content Heat Hironobu Kiyota, Yu Suzuki, Kyoji Kawagoe (Ritsumeikan Univ.) IN2008-120 |
In P2P networks, there is a trade-off between completeness and retrieval speed.
Especially, this problem is extreamly n... [more] |
IN2008-120 pp.69-74 |
DE |
2007-07-03 11:20 |
Miyagi |
Akiu hot springs (Sendai) |
Processing Spatial Queries Based on Imprecise Location Information Yoshiharu Ishikawa (Nagoya Univ.) DE2007-70 |
In sensor environments and mobile robot applications, we often find the situation in which the location of an object is ... [more] |
DE2007-70 pp.289-295 |
NS |
2006-05-18 13:55 |
Kyoto |
Kyoto University Clock Tower Centenial Hall |
DHR-Trees: A Distributed Multidimentional Indexing Structure for P2P Systems Xinfa Wei, Kaoru Sezaki (Univ. of Tokyo) NS2006-22 |
Supporting complex queries over Peer-to-Peer systems has attracted many research efforts in recent years. In this paper,... [more] |
NS2006-22 pp.5-8 |
CS, IN, NS (Joint) |
2005-09-16 17:05 |
Miyagi |
Tohoku Univ. |
A Hypercube-based Routing Algorithm for Scalable Multi-Attribute Range Queries Hoaison Nguyen, Hiroyuki Morikawa, Tomonori Aoyama (Tokyo Univ.) |
We design a scalable and expressive naming system called SENS, which can retrieve information of computing and content r... [more] |
IN2005-87 pp.155-160 |