Data Structures for Storing File Namespace in Distributed File System

The distributed file system (DFS) provides a mechanism where a file can be stored across several physical computer nodes ensuring replication transparency and failure transparency. In order to achieve this, one important feature of DFS's data structure is to employ a proper way to organize the...

Full description

Saved in:
Bibliographic Details
Main Authors: Luu Hoang Long, Eunmi Choi, SangBum Kim, Pilsung Kim
Format: Conference Proceeding
Language:English
Subjects:
Arrays
AVL Tree
B-tree
Binary search trees
Data structures
Distributed File System
File systems
Namespace
Pediatrics
Tree data structures
Writing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 255
container_issue
container_start_page 250
container_title
container_volume 1
creator Luu Hoang Long
Eunmi Choi
SangBum Kim
Pilsung Kim
description The distributed file system (DFS) provides a mechanism where a file can be stored across several physical computer nodes ensuring replication transparency and failure transparency. In order to achieve this, one important feature of DFS's data structure is to employ a proper way to organize the large scale data and file namespaces to provide a fast access speed. In order to analyze file namespace issue, we present the comparison among three major data structures, AVL, Red-Black (RB) and B trees which are popular for organizing file namespace for DFS. This paper also presents significant results obtained from our intensive experiments. From the results collected, we conduct a precise vision about the performance comparison of these data structures and propose that AVL tree is the most appropriate solution.
doi_str_mv 10.1109/NCM.2008.163
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4624013</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4624013</ieee_id><sourcerecordid>4624013</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-22d91df46130a28b9638d5ed9f7250a3e5cbbecb2f1422c3945e390a39ae69fe3</originalsourceid><addsrcrecordid>eNotjLFOwzAURS2hStDSjY0lP5Dw_Bw7eSNKW0AqZSjMlZM8I6OmrWxn6N9TVKarc450hXiQUEgJ9LRp3gsEqAtp1I2YQmVIK4UoJ2L65wlrVdGtmMf4AwCSTAWEd2K5sMlm2xTGLo2BY-aO4YLH4A_f2crvOdvYgePJdpz5Q7bwMQXfjon7a92eY-LhXkyc3Uee_-9MfK2Wn81rvv54eWue17mXlU45Yk-yd6WRCizWLRlV95p7chVqsIp117bctehkidgpKjUrugSybMixmonH669n5t0p-MGG8640WIJU6hdbbEow</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Data Structures for Storing File Namespace in Distributed File System</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Luu Hoang Long ; Eunmi Choi ; SangBum Kim ; Pilsung Kim</creator><creatorcontrib>Luu Hoang Long ; Eunmi Choi ; SangBum Kim ; Pilsung Kim</creatorcontrib><description>The distributed file system (DFS) provides a mechanism where a file can be stored across several physical computer nodes ensuring replication transparency and failure transparency. In order to achieve this, one important feature of DFS's data structure is to employ a proper way to organize the large scale data and file namespaces to provide a fast access speed. In order to analyze file namespace issue, we present the comparison among three major data structures, AVL, Red-Black (RB) and B trees which are popular for organizing file namespace for DFS. This paper also presents significant results obtained from our intensive experiments. From the results collected, we conduct a precise vision about the performance comparison of these data structures and propose that AVL tree is the most appropriate solution.</description><identifier>ISBN: 0769533221</identifier><identifier>ISBN: 9780769533223</identifier><identifier>DOI: 10.1109/NCM.2008.163</identifier><identifier>LCCN: 2008928379</identifier><language>eng</language><publisher>IEEE</publisher><subject>Arrays ; AVL Tree ; B-tree ; Binary search trees ; Data structures ; Distributed File System ; File systems ; Namespace ; Pediatrics ; Tree data structures ; Writing</subject><ispartof>2008 Fourth International Conference on Networked Computing and Advanced Information Management, 2008, Vol.1, p.250-255</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4624013$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4624013$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Luu Hoang Long</creatorcontrib><creatorcontrib>Eunmi Choi</creatorcontrib><creatorcontrib>SangBum Kim</creatorcontrib><creatorcontrib>Pilsung Kim</creatorcontrib><title>Data Structures for Storing File Namespace in Distributed File System</title><title>2008 Fourth International Conference on Networked Computing and Advanced Information Management</title><addtitle>NCM</addtitle><description>The distributed file system (DFS) provides a mechanism where a file can be stored across several physical computer nodes ensuring replication transparency and failure transparency. In order to achieve this, one important feature of DFS's data structure is to employ a proper way to organize the large scale data and file namespaces to provide a fast access speed. In order to analyze file namespace issue, we present the comparison among three major data structures, AVL, Red-Black (RB) and B trees which are popular for organizing file namespace for DFS. This paper also presents significant results obtained from our intensive experiments. From the results collected, we conduct a precise vision about the performance comparison of these data structures and propose that AVL tree is the most appropriate solution.</description><subject>Arrays</subject><subject>AVL Tree</subject><subject>B-tree</subject><subject>Binary search trees</subject><subject>Data structures</subject><subject>Distributed File System</subject><subject>File systems</subject><subject>Namespace</subject><subject>Pediatrics</subject><subject>Tree data structures</subject><subject>Writing</subject><isbn>0769533221</isbn><isbn>9780769533223</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotjLFOwzAURS2hStDSjY0lP5Dw_Bw7eSNKW0AqZSjMlZM8I6OmrWxn6N9TVKarc450hXiQUEgJ9LRp3gsEqAtp1I2YQmVIK4UoJ2L65wlrVdGtmMf4AwCSTAWEd2K5sMlm2xTGLo2BY-aO4YLH4A_f2crvOdvYgePJdpz5Q7bwMQXfjon7a92eY-LhXkyc3Uee_-9MfK2Wn81rvv54eWue17mXlU45Yk-yd6WRCizWLRlV95p7chVqsIp117bctehkidgpKjUrugSybMixmonH669n5t0p-MGG8640WIJU6hdbbEow</recordid><startdate>200809</startdate><enddate>200809</enddate><creator>Luu Hoang Long</creator><creator>Eunmi Choi</creator><creator>SangBum Kim</creator><creator>Pilsung Kim</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200809</creationdate><title>Data Structures for Storing File Namespace in Distributed File System</title><author>Luu Hoang Long ; Eunmi Choi ; SangBum Kim ; Pilsung Kim</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-22d91df46130a28b9638d5ed9f7250a3e5cbbecb2f1422c3945e390a39ae69fe3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Arrays</topic><topic>AVL Tree</topic><topic>B-tree</topic><topic>Binary search trees</topic><topic>Data structures</topic><topic>Distributed File System</topic><topic>File systems</topic><topic>Namespace</topic><topic>Pediatrics</topic><topic>Tree data structures</topic><topic>Writing</topic><toplevel>online_resources</toplevel><creatorcontrib>Luu Hoang Long</creatorcontrib><creatorcontrib>Eunmi Choi</creatorcontrib><creatorcontrib>SangBum Kim</creatorcontrib><creatorcontrib>Pilsung Kim</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Explore</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Luu Hoang Long</au><au>Eunmi Choi</au><au>SangBum Kim</au><au>Pilsung Kim</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Data Structures for Storing File Namespace in Distributed File System</atitle><btitle>2008 Fourth International Conference on Networked Computing and Advanced Information Management</btitle><stitle>NCM</stitle><date>2008-09</date><risdate>2008</risdate><volume>1</volume><spage>250</spage><epage>255</epage><pages>250-255</pages><isbn>0769533221</isbn><isbn>9780769533223</isbn><abstract>The distributed file system (DFS) provides a mechanism where a file can be stored across several physical computer nodes ensuring replication transparency and failure transparency. In order to achieve this, one important feature of DFS's data structure is to employ a proper way to organize the large scale data and file namespaces to provide a fast access speed. In order to analyze file namespace issue, we present the comparison among three major data structures, AVL, Red-Black (RB) and B trees which are popular for organizing file namespace for DFS. This paper also presents significant results obtained from our intensive experiments. From the results collected, we conduct a precise vision about the performance comparison of these data structures and propose that AVL tree is the most appropriate solution.</abstract><pub>IEEE</pub><doi>10.1109/NCM.2008.163</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 0769533221
ispartof 2008 Fourth International Conference on Networked Computing and Advanced Information Management, 2008, Vol.1, p.250-255
issn
language eng
recordid cdi_ieee_primary_4624013
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Arrays
AVL Tree
B-tree
Binary search trees
Data structures
Distributed File System
File systems
Namespace
Pediatrics
Tree data structures
Writing
title Data Structures for Storing File Namespace in Distributed File System
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T18%3A21%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Data%20Structures%20for%20Storing%20File%20Namespace%20in%20Distributed%20File%20System&rft.btitle=2008%20Fourth%20International%20Conference%20on%20Networked%20Computing%20and%20Advanced%20Information%20Management&rft.au=Luu%20Hoang%20Long&rft.date=2008-09&rft.volume=1&rft.spage=250&rft.epage=255&rft.pages=250-255&rft.isbn=0769533221&rft.isbn_list=9780769533223&rft_id=info:doi/10.1109/NCM.2008.163&rft_dat=%3Cieee_6IE%3E4624013%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-22d91df46130a28b9638d5ed9f7250a3e5cbbecb2f1422c3945e390a39ae69fe3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4624013&rfr_iscdi=true