eprintid: 115
rev_number: 7
eprint_status: archive
userid: 4
dir: disk0/00/00/01/15
datestamp: 2013-01-08 08:01:41
lastmod: 2013-06-29 04:44:03
status_changed: 2013-01-08 08:01:41
type: conference_item
metadata_visibility: show
creators_name: Nguyen, Hoai-Son
creators_name: Tan, Yasuo
creators_name: Shinoda, Y.
creators_id: sonnh@vnu.edu.vn
corp_creators: VNU-UET
title: Building Distributed Attribute-Value Trees on DHT-based Networks
ispublished: pub
subjects: IT
subjects: IT_CN
divisions: fac_fit
keywords: Buildings;Indexes;Information services;Load management;Routing;Routing protocols;Search problems;Internet;cryptography;file organisation;information resources;query processing;trees (mathematics);AV tree;DHT-based networks;Internet;distributed attribute-value trees;information resources;multiple-attribute searching;query processing;DHT;Load balancing;Multiple Attribute/Value Searching;
abstract: Today, when a huge number of information resources appear in the Internet, one problem arising is how to search and exploit these information resources efficiently and flexibly with high scalability. We believe that the realization of multiple-attribute searching in a distributed manner is an important solution for this problem. In this paper, we propose a solution of building a distributed attribute-value tree (AV tree) on DHT-based networks to realize multiple-attribute searching. Each resource is named by an AV tree and DHT keys are created from each AV branch of a resource name. Resource information is distributed to a DHT-based network by the use of these DHT keys. Our solution keeps the locality of resource names in the key space of DHT networks such that AV branches that share a number of attribute/value pairs (AV pairs) will be mapped to a continuous portion of the key space. Therefore, multiple-attribute searching can be achieved efficiently by querying nodes responsible for a continuous portion of the key space. Our system can achieve both efficiency and a good degree of load balancing even when the distribution of AV pairs in resource names is skewed. Our simulation result shows the efficiency of our solution in respects of query success ratio and the degree of load balancing, comparing with conventional approaches.
date: 2012-03-26
date_type: published
official_url: http://dx.doi.org/10.1109/AINA.2012.98
full_text_status: none
pres_type: paper
pagerange: 795 -802
event_title: 2012 IEEE 26th International Conference on Advanced Information Networking and Applications (AINA)
event_location: Fukuoka, Japan
event_dates: 26-29 March 2012
event_type: conference
refereed: TRUE
citation:   Nguyen, Hoai-Son and Tan, Yasuo and Shinoda, Y.  (2012) Building Distributed Attribute-Value Trees on DHT-based Networks.  In: 2012 IEEE 26th International Conference on Advanced Information Networking and Applications (AINA), 26-29 March 2012, Fukuoka, Japan.