{"id":"https://openalex.org/W2163395303","doi":"https://doi.org/10.1109/dictap.2014.6821646","title":"A Peer-to-Peer multiway tree network with efficient range query search using multidimensional indexing","display_name":"A Peer-to-Peer multiway tree network with efficient range query search using multidimensional indexing","publication_year":2014,"publication_date":"2014-05-01","ids":{"openalex":"https://openalex.org/W2163395303","doi":"https://doi.org/10.1109/dictap.2014.6821646","mag":"2163395303"},"language":"en","primary_location":{"id":"doi:10.1109/dictap.2014.6821646","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dictap.2014.6821646","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Fourth International Conference on Digital Information and Communication Technology and its Applications (DICTAP)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052100070","display_name":"Shivangi Surati","orcid":"https://orcid.org/0000-0003-4381-5130"},"institutions":[{"id":"https://openalex.org/I42014448","display_name":"Sardar Vallabhbhai National Institute of Technology Surat","ror":"https://ror.org/02y394t43","country_code":"IN","type":"education","lineage":["https://openalex.org/I42014448"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Shivangi Surati","raw_affiliation_strings":["Department of Computer Engineering, Sardar Vallabhbhai National Institute Of Technology, Surat, Gujarat, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Sardar Vallabhbhai National Institute Of Technology, Surat, Gujarat, India","institution_ids":["https://openalex.org/I42014448"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028565396","display_name":"Devesh C. Jinwala","orcid":"https://orcid.org/0000-0003-4830-1702"},"institutions":[{"id":"https://openalex.org/I42014448","display_name":"Sardar Vallabhbhai National Institute of Technology Surat","ror":"https://ror.org/02y394t43","country_code":"IN","type":"education","lineage":["https://openalex.org/I42014448"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Devesh C Jinwala","raw_affiliation_strings":["Department of Computer Engineering, Sardar Vallabhbhai National Institute Of Technology, Surat, Gujarat, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Sardar Vallabhbhai National Institute Of Technology, Surat, Gujarat, India","institution_ids":["https://openalex.org/I42014448"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008473098","display_name":"Sanjay Garg","orcid":"https://orcid.org/0000-0002-2279-9373"},"institutions":[{"id":"https://openalex.org/I165831266","display_name":"Nirma University","ror":"https://ror.org/05qkq7x38","country_code":"IN","type":"education","lineage":["https://openalex.org/I165831266"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sanjay Garg","raw_affiliation_strings":["Department of Computer Engineering, Nirma University, Ahmedabad, Gujarat, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Nirma University, Ahmedabad, Gujarat, India","institution_ids":["https://openalex.org/I165831266"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5052100070"],"corresponding_institution_ids":["https://openalex.org/I42014448"],"apc_list":null,"apc_paid":null,"fwci":0.3448,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.68256703,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"7","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7725409269332886},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.7584524154663086},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7098078727722168},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.6759516000747681},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5769596099853516},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.5510146021842957},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5303493142127991},{"id":"https://openalex.org/keywords/peer-to-peer","display_name":"Peer-to-peer","score":0.4520844519138336},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.43447068333625793},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.43103542923927307},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.4256075620651245},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37961331009864807},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.3372785747051239},{"id":"https://openalex.org/keywords/web-query-classification","display_name":"Web query classification","score":0.2527023255825043},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.247335284948349},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.16922038793563843},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.15031713247299194},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11129087209701538}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7725409269332886},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.7584524154663086},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7098078727722168},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.6759516000747681},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5769596099853516},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.5510146021842957},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5303493142127991},{"id":"https://openalex.org/C534932454","wikidata":"https://www.wikidata.org/wiki/Q161410","display_name":"Peer-to-peer","level":2,"score":0.4520844519138336},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.43447068333625793},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.43103542923927307},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.4256075620651245},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37961331009864807},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.3372785747051239},{"id":"https://openalex.org/C118689300","wikidata":"https://www.wikidata.org/wiki/Q7978614","display_name":"Web query classification","level":4,"score":0.2527023255825043},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.247335284948349},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.16922038793563843},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.15031713247299194},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11129087209701538},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dictap.2014.6821646","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dictap.2014.6821646","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Fourth International Conference on Digital Information and Communication Technology and its Applications (DICTAP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/1","score":0.5400000214576721,"display_name":"No poverty"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1603413294","https://openalex.org/W1616277517","https://openalex.org/W2000806336","https://openalex.org/W2007563198","https://openalex.org/W2012771762","https://openalex.org/W2035937973","https://openalex.org/W2048799895","https://openalex.org/W2052547919","https://openalex.org/W2057016719","https://openalex.org/W2057995790","https://openalex.org/W2077302079","https://openalex.org/W2085997030","https://openalex.org/W2100047673","https://openalex.org/W2101810220","https://openalex.org/W2117268753","https://openalex.org/W2118269922","https://openalex.org/W2121531691","https://openalex.org/W2121763550","https://openalex.org/W2128368884","https://openalex.org/W2143749118","https://openalex.org/W2155776210","https://openalex.org/W2160230795","https://openalex.org/W2161735290","https://openalex.org/W2164433993","https://openalex.org/W2172227078","https://openalex.org/W3105243111","https://openalex.org/W6677859298"],"related_works":["https://openalex.org/W4282568653","https://openalex.org/W2119380317","https://openalex.org/W2070155952","https://openalex.org/W2082868123","https://openalex.org/W2533706070","https://openalex.org/W2184474188","https://openalex.org/W3094024929","https://openalex.org/W2162466004","https://openalex.org/W2066869521","https://openalex.org/W2105258824"],"abstract_inverted_index":{"Multidimensional":[0,98],"complex":[1,75],"query":[2,110,114,160,199],"searching":[3,30],"is":[4,82,117,174,193,249],"difficult":[5],"in":[6,34,214,237,246],"Peer-to-Peer":[7],"(P2P)":[8],"overlay":[9],"networks":[10,96,222],"due":[11,58],"to":[12,59,86,107,119,155,195,203,231,250,264],"its":[13],"characteristics":[14],"of":[15,31,63,70,74,149,176,220,259,271,274],"high":[16],"scalability,":[17],"dynamicity":[18],"and":[19,97,185],"decentralized":[20],"architecture.":[21],"On":[22],"the":[23,26,42,46,54,60,68,72,87,104,108,112,130,136,142,150,157,171,177,189,197,234,238,243,256,260,272,275],"other":[24],"side,":[25],"P2P":[27,95,182,221],"applications":[28],"like":[29,77],"multimedia":[32],"contents":[33],"social":[35],"networking":[36],"or":[37,79,111,125],"multiplayer":[38],"games":[39],"(that":[40],"combines":[41],"search":[43,81,115,161,200,257],"based":[44,140,187,227],"on":[45,141,164,188,228],"multiple":[47],"game":[48],"scenarios)":[49],"are":[50],"becoming":[51],"popular":[52],"among":[53,67],"end":[55],"users.":[56],"However,":[57],"large":[61],"amount":[62],"multidimensional":[64,158,240,276],"data":[65],"distributed":[66,239],"thousands":[69],"peers,":[71],"support":[73,106],"queries":[76,236,262],"similarity":[78],"range":[80,109,113,159,198,235,261],"essential":[83],"as":[84,223,225],"compared":[85],"exact":[88],"match":[89],"queries.":[90],"The":[91],"existing":[92],"literature":[93],"(combining":[94],"Indexing":[99],"(MI))":[100],"either":[101],"suffers":[102],"from":[103],"poorer":[105],"cost":[116],"limited":[118],"O(log":[120,204,265],"<sub":[121,205,266],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[122,206,267],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[123],"N)":[124,269],"else":[126],"it":[127],"varies":[128],"with":[129],"dimensionality.":[131],"To":[132],"address":[133],"these":[134],"problems,":[135],"traditional":[137],"MI":[138,186,226],"techniques":[139],"multiway":[143],"tree":[144,183,230],"structure":[145],"(having":[146],"larger":[147],"fanout":[148,175],"tree)":[151],"can":[152],"be":[153],"employed":[154],"strengthen":[156],"capabilities.":[162],"Based":[163],"our":[165,247],"observations,":[166],"a":[167],"hybrid":[168],"model":[169,213,254],"combining":[170],"m-ary":[172],"(m":[173],"tree,":[178],"m":[179],">":[180],"2)":[181],"network":[184],"space":[190],"containment":[191],"relationships":[192],"preferred":[194],"reduce":[196],"performance":[201,258],"bound":[202],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">m</sub>":[207,268],"N).":[208],"We":[209],"show":[210,251],"an":[211],"illustrative":[212],"this":[215,253],"paper":[216,248],"that":[217],"takes":[218],"advantages":[219],"well":[224],"mary":[229],"efficiently":[232],"handle":[233],"applications.":[241],"However":[242],"main":[244],"focus":[245],"how":[252],"improves":[255],"(bound":[263],"independent":[270],"dimensionality":[273],"objects.":[277]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}