{"id":"https://openalex.org/W1538219519","doi":"https://doi.org/10.1007/978-3-540-71703-4_32","title":"Construction of Tree-Based Indexes for Level-Contiguous Buffering Support","display_name":"Construction of Tree-Based Indexes for Level-Contiguous Buffering Support","publication_year":2007,"publication_date":"2007-08-02","ids":{"openalex":"https://openalex.org/W1538219519","doi":"https://doi.org/10.1007/978-3-540-71703-4_32","mag":"1538219519"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-71703-4_32","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-71703-4_32","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/A5013042933","display_name":"Tom\u00e1\u0161 Skopal","orcid":"https://orcid.org/0000-0002-6591-0879"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Tom\u00e1\u0161 Skopal","raw_affiliation_strings":["Charles University in Prague, FMP, Department of Software Engineering, Malostransk\u00e9 n\u00e1m. 25, 118 00 Prague, Czech Republic","Charles University in Prague, FMP, Department of Software Engineering, Prague, Czech Republic#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University in Prague, FMP, Department of Software Engineering, Malostransk\u00e9 n\u00e1m. 25, 118 00 Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Charles University in Prague, FMP, Department of Software Engineering, Prague, Czech Republic#TAB#","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049617942","display_name":"David Hoksza","orcid":"https://orcid.org/0000-0003-4679-0557"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"David Hoksza","raw_affiliation_strings":["Charles University in Prague, FMP, Department of Software Engineering, Malostransk\u00e9 n\u00e1m. 25, 118 00 Prague, Czech Republic","Charles University in Prague, FMP, Department of Software Engineering, Prague, Czech Republic#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University in Prague, FMP, Department of Software Engineering, Malostransk\u00e9 n\u00e1m. 25, 118 00 Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Charles University in Prague, FMP, Department of Software Engineering, Prague, Czech Republic#TAB#","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085303426","display_name":"Jaroslav Pokorn\u00fd","orcid":"https://orcid.org/0000-0003-3177-4183"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jaroslav Pokorn\u00fd","raw_affiliation_strings":["Charles University in Prague, FMP, Department of Software Engineering, Malostransk\u00e9 n\u00e1m. 25, 118 00 Prague, Czech Republic","Charles University in Prague, FMP, Department of Software Engineering, Prague, Czech Republic#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University in Prague, FMP, Department of Software Engineering, Malostransk\u00e9 n\u00e1m. 25, 118 00 Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Charles University in Prague, FMP, Department of Software Engineering, Prague, Czech Republic#TAB#","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.6819,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.64611737,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"361","last_page":"373"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9958000183105469,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9948999881744385,"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-traversal","display_name":"Tree traversal","score":0.9268052577972412},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7359221577644348},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.7085161209106445},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6600598096847534},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5894477367401123},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.5154339075088501},{"id":"https://openalex.org/keywords/quadtree","display_name":"Quadtree","score":0.49445557594299316},{"id":"https://openalex.org/keywords/instruction-prefetch","display_name":"Instruction prefetch","score":0.479015052318573},{"id":"https://openalex.org/keywords/access-method","display_name":"Access method","score":0.44575265049934387},{"id":"https://openalex.org/keywords/r-tree","display_name":"R-tree","score":0.4402354061603546},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.37203386425971985},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34659355878829956},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.32957881689071655},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3153967261314392},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.3079058527946472},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2934616208076477},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2547951638698578},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.2069823145866394},{"id":"https://openalex.org/keywords/spatial-database","display_name":"Spatial database","score":0.19925260543823242},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1738770306110382},{"id":"https://openalex.org/keywords/spatial-analysis","display_name":"Spatial analysis","score":0.13749703764915466},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08670148253440857},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07224977016448975}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.9268052577972412},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7359221577644348},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7085161209106445},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6600598096847534},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5894477367401123},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.5154339075088501},{"id":"https://openalex.org/C151416825","wikidata":"https://www.wikidata.org/wiki/Q934791","display_name":"Quadtree","level":2,"score":0.49445557594299316},{"id":"https://openalex.org/C133588205","wikidata":"https://www.wikidata.org/wiki/Q28455645","display_name":"Instruction prefetch","level":3,"score":0.479015052318573},{"id":"https://openalex.org/C70000936","wikidata":"https://www.wikidata.org/wiki/Q4672467","display_name":"Access method","level":2,"score":0.44575265049934387},{"id":"https://openalex.org/C106278948","wikidata":"https://www.wikidata.org/wiki/Q1198051","display_name":"R-tree","level":4,"score":0.4402354061603546},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.37203386425971985},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34659355878829956},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.32957881689071655},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3153967261314392},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.3079058527946472},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2934616208076477},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2547951638698578},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.2069823145866394},{"id":"https://openalex.org/C203689450","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial database","level":3,"score":0.19925260543823242},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1738770306110382},{"id":"https://openalex.org/C159620131","wikidata":"https://www.wikidata.org/wiki/Q1938983","display_name":"Spatial analysis","level":2,"score":0.13749703764915466},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08670148253440857},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07224977016448975},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-71703-4_32","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-71703-4_32","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1487438942","https://openalex.org/W1492745069","https://openalex.org/W1500187046","https://openalex.org/W1541459201","https://openalex.org/W1608146864","https://openalex.org/W2019258238","https://openalex.org/W2021283827","https://openalex.org/W2038044292","https://openalex.org/W2040892657","https://openalex.org/W2045291104","https://openalex.org/W2046441184","https://openalex.org/W2054308357","https://openalex.org/W2083113964","https://openalex.org/W2106642566","https://openalex.org/W2122244530","https://openalex.org/W2124222502","https://openalex.org/W2140815597","https://openalex.org/W2157092487","https://openalex.org/W2163772659","https://openalex.org/W2492593041","https://openalex.org/W2753710282","https://openalex.org/W2983346532","https://openalex.org/W3149201378","https://openalex.org/W4231676608","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W22108090","https://openalex.org/W1548214008","https://openalex.org/W2289983027","https://openalex.org/W2098841067","https://openalex.org/W272774291","https://openalex.org/W2021790858","https://openalex.org/W2070665098","https://openalex.org/W2383581812","https://openalex.org/W1770616178","https://openalex.org/W2051407949"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}