{"id":"https://openalex.org/W3041959623","doi":"https://doi.org/10.1109/meco49872.2020.9134263","title":"Indexing Data Based on the CW-tree Algorithm Using Parallel Data Reading","display_name":"Indexing Data Based on the CW-tree Algorithm Using Parallel Data Reading","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3041959623","doi":"https://doi.org/10.1109/meco49872.2020.9134263","mag":"3041959623"},"language":"en","primary_location":{"id":"doi:10.1109/meco49872.2020.9134263","is_oa":false,"landing_page_url":"https://doi.org/10.1109/meco49872.2020.9134263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 9th Mediterranean Conference on Embedded Computing (MECO)","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/A5082085857","display_name":"Vladislav S. Shevskiy","orcid":"https://orcid.org/0000-0001-5121-201X"},"institutions":[{"id":"https://openalex.org/I41518628","display_name":"Saint Petersburg State Electrotechnical University","ror":"https://ror.org/023bq8521","country_code":"RU","type":"education","lineage":["https://openalex.org/I41518628"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Vladislav S. Shevskiy","raw_affiliation_strings":["Department of Computer Science and Engineering, Saint Petersburg Electrotechnical University \u201cLETI\u201d, Saint Petersburg, Russia","Department of Computer Science and Engineering, Saint Petersburg Electrotechnical University \"LETI\", Saint Petersburg, Russia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Saint Petersburg Electrotechnical University \u201cLETI\u201d, Saint Petersburg, Russia","institution_ids":["https://openalex.org/I41518628"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Saint Petersburg Electrotechnical University \"LETI\", Saint Petersburg, Russia","institution_ids":["https://openalex.org/I41518628"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5082085857"],"corresponding_institution_ids":["https://openalex.org/I41518628"],"apc_list":null,"apc_paid":null,"fwci":0.1515,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.42132982,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9969000220298767,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9969000220298767,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9962000250816345,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.782149076461792},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.7125779986381531},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.6951302886009216},{"id":"https://openalex.org/keywords/reading","display_name":"Reading (process)","score":0.5229694843292236},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5162396430969238},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.47869303822517395},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.47512108087539673},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.4725508391857147},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.46062391996383667},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.37636926770210266},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.36610978841781616},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3439440131187439},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15139058232307434},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1479131281375885},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.14725074172019958},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.1380467414855957}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.782149076461792},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7125779986381531},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6951302886009216},{"id":"https://openalex.org/C554936623","wikidata":"https://www.wikidata.org/wiki/Q199657","display_name":"Reading (process)","level":2,"score":0.5229694843292236},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5162396430969238},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.47869303822517395},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.47512108087539673},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.4725508391857147},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.46062391996383667},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.37636926770210266},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.36610978841781616},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3439440131187439},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15139058232307434},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1479131281375885},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.14725074172019958},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.1380467414855957},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political 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},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/meco49872.2020.9134263","is_oa":false,"landing_page_url":"https://doi.org/10.1109/meco49872.2020.9134263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 9th Mediterranean Conference on Embedded Computing (MECO)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8799999952316284,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1675992738","https://openalex.org/W1985704385","https://openalex.org/W2020601345","https://openalex.org/W2037168816","https://openalex.org/W2045425603","https://openalex.org/W2084277162","https://openalex.org/W2086014488","https://openalex.org/W2167679350","https://openalex.org/W2258474445","https://openalex.org/W2820414666","https://openalex.org/W6692437779"],"related_works":["https://openalex.org/W2022598760","https://openalex.org/W2351720606","https://openalex.org/W2227684440","https://openalex.org/W2359095153","https://openalex.org/W2083751087","https://openalex.org/W1521720839","https://openalex.org/W2156833871","https://openalex.org/W2566588687","https://openalex.org/W2374319888","https://openalex.org/W1770616178"],"abstract_inverted_index":{"The":[0],"research":[1],"objective":[2],"is":[3,30,33,61],"to":[4,9,46],"develop":[5],"indexing":[6,22],"data":[7,23,88,94,110],"algorithm":[8,24],"reduce":[10],"database":[11],"searching":[12],"time":[13,111],"by":[14],"using":[15,80],"multithreaded":[16],"frameworks.":[17],"In":[18],"this":[19],"article":[20],"the":[21,52,57,66,72],"in":[25,103],"a":[26],"tree":[27],"form":[28],"which":[29,60],"called":[31],"CW-tree":[32,37,53,82,96,113],"supposed.":[34],"Traversing":[35],"through":[36],"occurs":[38],"asynchronously":[39],"with":[40,89,95,112,117],"help":[41,90],"additional":[42],"start":[43],"nodes.":[44],"Compared":[45],"existing":[47],"analogs":[48],"of":[49,59,68,74,81,100],"tree-based":[50],"algorithms,":[51],"has":[54],"some":[55],"advantages,":[56],"main":[58],"full":[62],"parallelization":[63],"both":[64],"on":[65,71],"levels":[67,73],"branches":[69],"and":[70,92,106],"leaves.":[75],"To":[76],"confirm":[77],"benefits":[78],"from":[79],"algorithm,":[83],"comparison":[84],"test":[85,101],"between":[86],"reading":[87,93,109,116],"B-tree":[91],"was":[97],"conducted.":[98],"Result":[99],"described":[102],"chapter":[104],"4":[105],"shows":[107],"that":[108],"less":[114],"than":[115],"B-tree.":[118]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}