{"id":"https://openalex.org/W2975668984","doi":"https://doi.org/10.1007/978-3-030-32047-8_2","title":"Storing Data Once in M-tree and PM-tree","display_name":"Storing Data Once in M-tree and PM-tree","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2975668984","doi":"https://doi.org/10.1007/978-3-030-32047-8_2","mag":"2975668984"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-32047-8_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-32047-8_2","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5014315681","display_name":"Humberto Razente","orcid":"https://orcid.org/0000-0001-9687-5730"},"institutions":[{"id":"https://openalex.org/I80850581","display_name":"Universidade Federal de Uberl\u00e2ndia","ror":"https://ror.org/04x3wvr31","country_code":"BR","type":"education","lineage":["https://openalex.org/I80850581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Humberto Razente","raw_affiliation_strings":["Faculdade de Computa\u00e7\u00e3o (FACOM), Universidade Federal de Uberl\u00e2ndia (UFU), Uberl\u00e2ndia, Brazil"],"raw_orcid":"https://orcid.org/0000-0001-9687-5730","affiliations":[{"raw_affiliation_string":"Faculdade de Computa\u00e7\u00e3o (FACOM), Universidade Federal de Uberl\u00e2ndia (UFU), Uberl\u00e2ndia, Brazil","institution_ids":["https://openalex.org/I80850581"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009825422","display_name":"Maria Camila N. Barioni","orcid":"https://orcid.org/0000-0002-5809-0243"},"institutions":[{"id":"https://openalex.org/I80850581","display_name":"Universidade Federal de Uberl\u00e2ndia","ror":"https://ror.org/04x3wvr31","country_code":"BR","type":"education","lineage":["https://openalex.org/I80850581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Maria Camila Nardini Barioni","raw_affiliation_strings":["Faculdade de Computa\u00e7\u00e3o (FACOM), Universidade Federal de Uberl\u00e2ndia (UFU), Uberl\u00e2ndia, Brazil"],"raw_orcid":"https://orcid.org/0000-0002-5809-0243","affiliations":[{"raw_affiliation_string":"Faculdade de Computa\u00e7\u00e3o (FACOM), Universidade Federal de Uberl\u00e2ndia (UFU), Uberl\u00e2ndia, Brazil","institution_ids":["https://openalex.org/I80850581"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.5839,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.82756917,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"18","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11269","display_name":"Algorithms and Data Compression","score":0.993399977684021,"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"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9889000058174133,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/tree-traversal","display_name":"Tree traversal","score":0.9059177041053772},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7985032200813293},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.7208872437477112},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.7020052075386047},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6671103835105896},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.6019242405891418},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5297670960426331},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4873098134994507},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.48529356718063354},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4846554398536682},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.4768487215042114},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4565652310848236},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4413835406303406},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44013625383377075},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.42861688137054443},{"id":"https://openalex.org/keywords/data-reduction","display_name":"Data reduction","score":0.4152204692363739},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.37901270389556885},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.34986087679862976},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.1562066674232483},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13070037961006165},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09900331497192383}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.9059177041053772},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7985032200813293},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7208872437477112},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7020052075386047},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6671103835105896},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6019242405891418},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5297670960426331},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4873098134994507},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.48529356718063354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4846554398536682},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.4768487215042114},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4565652310848236},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4413835406303406},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44013625383377075},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.42861688137054443},{"id":"https://openalex.org/C153914771","wikidata":"https://www.wikidata.org/wiki/Q5227343","display_name":"Data reduction","level":2,"score":0.4152204692363739},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.37901270389556885},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.34986087679862976},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.1562066674232483},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13070037961006165},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09900331497192383},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-32047-8_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-32047-8_2","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1487438942","https://openalex.org/W1497953515","https://openalex.org/W1539111076","https://openalex.org/W1861510175","https://openalex.org/W1968566320","https://openalex.org/W1973836650","https://openalex.org/W1994655805","https://openalex.org/W2000142883","https://openalex.org/W2009233076","https://openalex.org/W2049797265","https://openalex.org/W2157092487","https://openalex.org/W2157956941","https://openalex.org/W2161694911","https://openalex.org/W2166904988","https://openalex.org/W2323774291","https://openalex.org/W2472247590","https://openalex.org/W2620638645","https://openalex.org/W2724806710","https://openalex.org/W2895248135"],"related_works":["https://openalex.org/W2227684440","https://openalex.org/W2359095153","https://openalex.org/W2083751087","https://openalex.org/W2280371997","https://openalex.org/W1521720839","https://openalex.org/W2376256808","https://openalex.org/W2160311168","https://openalex.org/W2156833871","https://openalex.org/W3140891626","https://openalex.org/W2359983499"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}