{"id":"https://openalex.org/W2947251974","doi":"https://doi.org/10.1007/978-3-030-20867-7_20","title":"A Fast, Memory-Efficient Alpha-Tree Algorithm Using Flooding and Tree Size Estimation","display_name":"A Fast, Memory-Efficient Alpha-Tree Algorithm Using Flooding and Tree Size Estimation","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2947251974","doi":"https://doi.org/10.1007/978-3-030-20867-7_20","mag":"2947251974"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-20867-7_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-20867-7_20","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":true,"oa_status":"green","oa_url":"https://research.rug.nl/files/93414664/A_Fast_Memory_Efficient_Alpha_Tree_Algorithm_using_Flooding_and_Tree_Size_Estimation.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052721139","display_name":"Jiwoo You","orcid":null},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Jiwoo You","raw_affiliation_strings":["Bernoulli Institute of Mathematics, Computer Science and Artificial Intelligence, University of Groningen, Groningen, The Netherlands","Kapteyn Astronomical Institute, University of Groningen, Groningen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Bernoulli Institute of Mathematics, Computer Science and Artificial Intelligence, University of Groningen, Groningen, The Netherlands","institution_ids":["https://openalex.org/I169381384"]},{"raw_affiliation_string":"Kapteyn Astronomical Institute, University of Groningen, Groningen, The Netherlands","institution_ids":["https://openalex.org/I169381384"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014887248","display_name":"S. C. Trager","orcid":"https://orcid.org/0000-0001-6994-3566"},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Scott C. Trager","raw_affiliation_strings":["Kapteyn Astronomical Institute, University of Groningen, Groningen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Kapteyn Astronomical Institute, University of Groningen, Groningen, The Netherlands","institution_ids":["https://openalex.org/I169381384"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015726919","display_name":"Michael H. F. Wilkinson","orcid":"https://orcid.org/0000-0001-6258-1128"},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Michael H. F. Wilkinson","raw_affiliation_strings":["Bernoulli Institute of Mathematics, Computer Science and Artificial Intelligence, University of Groningen, Groningen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Bernoulli Institute of Mathematics, Computer Science and Artificial Intelligence, University of Groningen, Groningen, The Netherlands","institution_ids":["https://openalex.org/I169381384"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5052721139"],"corresponding_institution_ids":["https://openalex.org/I169381384"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.2563,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.44331395,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"256","last_page":"267"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10036","display_name":"Advanced Neural Network Applications","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10036","display_name":"Advanced Neural Network Applications","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11019","display_name":"Image Enhancement Techniques","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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","display_name":"Tree (set theory)","score":0.6640056371688843},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.617302656173706},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4673272371292114},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.46158507466316223},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4408552348613739},{"id":"https://openalex.org/keywords/alpha","display_name":"Alpha (finance)","score":0.4404166340827942},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.3339861035346985},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.31857067346572876},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2482399046421051},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.20642966032028198},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1902274191379547}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6640056371688843},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.617302656173706},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4673272371292114},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.46158507466316223},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4408552348613739},{"id":"https://openalex.org/C64943373","wikidata":"https://www.wikidata.org/wiki/Q2651003","display_name":"Alpha (finance)","level":4,"score":0.4404166340827942},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.3339861035346985},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.31857067346572876},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2482399046421051},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.20642966032028198},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1902274191379547},{"id":"https://openalex.org/C171606756","wikidata":"https://www.wikidata.org/wiki/Q506132","display_name":"Psychometrics","level":2,"score":0.0},{"id":"https://openalex.org/C49453240","wikidata":"https://www.wikidata.org/wiki/Q1592163","display_name":"Construct validity","level":3,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-030-20867-7_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-20867-7_20","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"},{"id":"pmh:oai:pure.rug.nl:openaire_cris_publications/0bc52b56-bc14-4b25-85a8-5411e2ad8627","is_oa":true,"landing_page_url":"https://hdl.handle.net/11370/0bc52b56-bc14-4b25-85a8-5411e2ad8627","pdf_url":"https://research.rug.nl/files/93414664/A_Fast_Memory_Efficient_Alpha_Tree_Algorithm_using_Flooding_and_Tree_Size_Estimation.pdf","source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"You, J, Trager, S & Wilkinson, M H F 2019, A Fast, Memory-Efficient Alpha-Tree Algorithm using Flooding and Tree Size Estimation. in B Burgeth , A Kleefeld , B Naegel , N Passat & B Perret (eds), Mathematical Morphology and Its Applications to Signal and Image Processing. Lecture Notes in Computer Science, vol. 11564, Springer, Cham, pp. 256-267, International Symposium on Mathematical Morphology, Saarbr\u00fccken, Saarland, Germany, 08/07/2019. https://doi.org/10.1007/978-3-030-20867-7_20","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.rug.nl:publications/0bc52b56-bc14-4b25-85a8-5411e2ad8627","is_oa":true,"landing_page_url":"https://research.rug.nl/en/publications/0bc52b56-bc14-4b25-85a8-5411e2ad8627","pdf_url":"https://pure.rug.nl/ws/files/93414664/A_Fast_Memory_Efficient_Alpha_Tree_Algorithm_using_Flooding_and_Tree_Size_Estimation.pdf","source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"You, J, Trager, S & Wilkinson, M H F 2019, A Fast, Memory-Efficient Alpha-Tree Algorithm using Flooding and Tree Size Estimation. in B Burgeth , A Kleefeld , B Naegel , N Passat & B Perret (eds), Mathematical Morphology and Its Applications to Signal and Image Processing. Lecture Notes in Computer Science, vol. 11564, Springer, Cham, pp. 256-267, International Symposium on Mathematical Morphology, Saarbr\u00fccken, Saarland, Germany, 08/07/2019. https://doi.org/10.1007/978-3-030-20867-7_20","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.rug.nl:openaire_cris_publications/0bc52b56-bc14-4b25-85a8-5411e2ad8627","is_oa":true,"landing_page_url":"https://hdl.handle.net/11370/0bc52b56-bc14-4b25-85a8-5411e2ad8627","pdf_url":"https://research.rug.nl/files/93414664/A_Fast_Memory_Efficient_Alpha_Tree_Algorithm_using_Flooding_and_Tree_Size_Estimation.pdf","source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"You, J, Trager, S & Wilkinson, M H F 2019, A Fast, Memory-Efficient Alpha-Tree Algorithm using Flooding and Tree Size Estimation. in B Burgeth , A Kleefeld , B Naegel , N Passat & B Perret (eds), Mathematical Morphology and Its Applications to Signal and Image Processing. Lecture Notes in Computer Science, vol. 11564, Springer, Cham, pp. 256-267, International Symposium on Mathematical Morphology, Saarbr\u00fccken, Saarland, Germany, 08/07/2019. https://doi.org/10.1007/978-3-030-20867-7_20","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2947251974.pdf","grobid_xml":"https://content.openalex.org/works/W2947251974.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1595072032","https://openalex.org/W1875942627","https://openalex.org/W1966828720","https://openalex.org/W1978331308","https://openalex.org/W1981143975","https://openalex.org/W2028089458","https://openalex.org/W2093555426","https://openalex.org/W2099096599","https://openalex.org/W2124032926","https://openalex.org/W2146842130","https://openalex.org/W2154174545","https://openalex.org/W2469505884","https://openalex.org/W2601359817","https://openalex.org/W2751754953","https://openalex.org/W3102789751","https://openalex.org/W3105618524"],"related_works":["https://openalex.org/W2227684440","https://openalex.org/W1521720839","https://openalex.org/W2160311168","https://openalex.org/W2083751087","https://openalex.org/W2156833871","https://openalex.org/W2779092424","https://openalex.org/W2243922648","https://openalex.org/W2093863113","https://openalex.org/W2114231158","https://openalex.org/W2092152400"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-17T17:19:04.345684","created_date":"2025-10-10T00:00:00"}