MERAL Myanmar Education Research and Learning Portal
Item
{"_buckets": {"deposit": "8eda38d9-b1ef-41a0-bf2d-d9853fe82752"}, "_deposit": {"id": "4235", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "4235"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/4235", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Efficient Indexing Scheme over DHT", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Range query processing is an essential role inmany P2P applications including databaseindexing, distributed computing and locationaware computing and commercial services basedon current user’s location. Most of P2Papplications are running over DHT overlaynetwork. But most of DHT can only provide forexact match queries. If there is no an efficientindexing scheme over DHTs, complex queriessuch as range queries may be major challenge.So in recent years, there are many indexingschemes over DHTs are proposed for rangequery processing. In this paper, an efficientindexing scheme is proposed formultidimensional range query processing. Forbuilding the proposed scheme, data are firstlydistributed over peer nodes. For fairlydistributing of data, k-dimensional tree (kd-tree)is used. While partitioning data on kd-tree,splitting points with each dimension aregenerated. Leave nodes of kd-tree store datarecords with tree information including splittingpoints. The proposed indexing scheme is builtusing these stored tree information. By using theproposed system, bandwidth and time consumingin range query processing over DHTs canreduce."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Indexing over DHT"}, {"interim": "range query processing"}, {"interim": "range query in P2P systems"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-07-03"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "9058.pdf", "filesize": [{"value": "129 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 129000.0, "url": {"url": "https://meral.edu.mm/record/4235/files/9058.pdf"}, "version_id": "dcc7e5c4-ec28-493b-8740-14754ad11d77"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Ninth International Conference On Computer Applications (ICCA 2011)", "subitem_pages": "", "subitem_volume": ""}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "", "subitem_c_date": "", "subitem_conference_title": "", "subitem_part": "", "subitem_place": "", "subitem_session": "", "subitem_website": ""}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{"subitem_book_title": "", "subitem_isbn": "", "subitem_pages": "", "subitem_place": "", "subitem_publisher": ""}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_awarding_university": "", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Mar, Yi Yi"}, {"subitem_authors_fullname": "Nwe, Khine Moe"}, {"subitem_authors_fullname": "Maw, Aung Htein"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2011-05-05"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/194"}, "item_title": "Efficient Indexing Scheme over DHT", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000004235", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-03"}, "publish_date": "2019-07-03", "publish_status": "0", "recid": "4235", "relation": {}, "relation_version_is_last": true, "title": ["Efficient Indexing Scheme over DHT"], "weko_shared_id": -1}
Efficient Indexing Scheme over DHT
http://hdl.handle.net/20.500.12678/0000004235
http://hdl.handle.net/20.500.12678/0000004235006290a8-1535-40ef-bde6-4fe2b8c7bcd0
8eda38d9-b1ef-41a0-bf2d-d9853fe82752
Name / File | License | Actions |
---|---|---|
9058.pdf (129 Kb)
|
|
Publication type | ||||||
---|---|---|---|---|---|---|
Article | ||||||
Upload type | ||||||
Publication | ||||||
Title | ||||||
Title | Efficient Indexing Scheme over DHT | |||||
Language | en | |||||
Publication date | 2011-05-05 | |||||
Authors | ||||||
Mar, Yi Yi | ||||||
Nwe, Khine Moe | ||||||
Maw, Aung Htein | ||||||
Description | ||||||
Range query processing is an essential role inmany P2P applications including databaseindexing, distributed computing and locationaware computing and commercial services basedon current user’s location. Most of P2Papplications are running over DHT overlaynetwork. But most of DHT can only provide forexact match queries. If there is no an efficientindexing scheme over DHTs, complex queriessuch as range queries may be major challenge.So in recent years, there are many indexingschemes over DHTs are proposed for rangequery processing. In this paper, an efficientindexing scheme is proposed formultidimensional range query processing. Forbuilding the proposed scheme, data are firstlydistributed over peer nodes. For fairlydistributing of data, k-dimensional tree (kd-tree)is used. While partitioning data on kd-tree,splitting points with each dimension aregenerated. Leave nodes of kd-tree store datarecords with tree information including splittingpoints. The proposed indexing scheme is builtusing these stored tree information. By using theproposed system, bandwidth and time consumingin range query processing over DHTs canreduce. | ||||||
Keywords | ||||||
Indexing over DHT, range query processing, range query in P2P systems | ||||||
Identifier | http://onlineresource.ucsy.edu.mm/handle/123456789/194 | |||||
Journal articles | ||||||
Ninth International Conference On Computer Applications (ICCA 2011) | ||||||
Conference papers | ||||||
Books/reports/chapters | ||||||
Thesis/dissertations |