{"id":"https://openalex.org/W7163914537","doi":"https://doi.org/10.4230/lipics.swat.2026.37","title":"Faster Linear-Space Data Structures for Path Frequency Queries","display_name":"Faster Linear-Space Data Structures for Path Frequency Queries","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163914537","doi":"https://doi.org/10.4230/lipics.swat.2026.37"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2604.18667","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2604.18667","pdf_url":"https://arxiv.org/pdf/2604.18667","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2604.18667","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138177411","display_name":"Ovidiu Ra\u021ba","orcid":"https://orcid.org/0009-0006-8816-2478"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Ra\u021ba, Ovidiu","raw_affiliation_strings":["University of Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0009-0006-8816-2478","affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5138177411"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.89680886,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6100000143051147,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6100000143051147,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.17350000143051147,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.061900001019239426,"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/path","display_name":"Path (computing)","score":0.7997999787330627},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.6496000289916992},{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.45969998836517334},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4507000148296356},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.4478999972343445},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.42579999566078186},{"id":"https://openalex.org/keywords/database-query","display_name":"Database query","score":0.39559999108314514},{"id":"https://openalex.org/keywords/mode","display_name":"Mode (computer interface)","score":0.37299999594688416}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7997999787330627},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6496000289916992},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.573199987411499},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.524399995803833},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.45969998836517334},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4507000148296356},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4478999972343445},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.42579999566078186},{"id":"https://openalex.org/C2989070954","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database query","level":2,"score":0.39559999108314514},{"id":"https://openalex.org/C48677424","wikidata":"https://www.wikidata.org/wiki/Q6888088","display_name":"Mode (computer interface)","level":2,"score":0.37299999594688416},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3456999957561493},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3452000021934509},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.34290000796318054},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.30720001459121704},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2946999967098236},{"id":"https://openalex.org/C10551718","wikidata":"https://www.wikidata.org/wiki/Q5227332","display_name":"Data pre-processing","level":2,"score":0.2815000116825104},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.27559998631477356},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.2676999866962433},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.2635999917984009},{"id":"https://openalex.org/C61114434","wikidata":"https://www.wikidata.org/wiki/Q7144649","display_name":"Path expression","level":3,"score":0.2531000077724457}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:2604.18667","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2604.18667","pdf_url":"https://arxiv.org/pdf/2604.18667","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:26073","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.37","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.37/LIPIcs.SWAT.2026.37.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.swat.2026.37","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.37","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2604.18667","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2604.18667","pdf_url":"https://arxiv.org/pdf/2604.18667","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163914537.pdf","grobid_xml":"https://content.openalex.org/works/W7163914537.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,22,121],"present":[1,23,123],"linear-space":[2,26,91,126],"data":[3,27,92,127,158],"structures":[4],"for":[5],"several":[6],"frequency":[7],"queries":[8,44,134],"on":[9],"trees,":[10],"namely:":[11],"path":[12,14,19,37,40,74,148,151],"mode,":[13],"least":[15,41,152],"frequent":[16,42,153],"element,":[17],"and":[18,39,150],"\u03b1-minority":[20,75],"queries.":[21,155],"the":[24,51,73,86,90,124,162,173],"first":[25,125],"structures,":[28,159],"requiring":[29,138],"O(n":[30,139],"\u221a{nw})":[31,140],"preprocessing":[32,141],"time,":[33,83,137],"that":[34],"can":[35],"answer":[36],"mode":[38,149],"element":[43,154],"in":[45,70,135,176],"O(\u221a{n/w})":[46,136],"time.":[47,142],"This":[48,143],"improves":[49],"upon":[50],"best":[52],"previously":[53],"known":[54],"bound":[55],"of":[56,89,94],"O(log":[57],"log":[58,104],"n":[59],"\u221a{n/w})":[60],"achieved":[61],"by":[62,109],"Durocher":[63,95],"et":[64,67,96,99],"al.":[65,97],"[Durocher":[66,98],"al.,":[68,100],"2016]":[69,101],"2016.":[71],"For":[72,156],"problem,":[76],"where":[77,170],"\u03b1":[78],"is":[79,172],"specified":[80],"at":[81],"query":[82,87],"we":[84,160],"reduce":[85],"time":[88],"structure":[93,128],"from":[102],"O(\u03b1^{-1}log":[103],"n)":[105],"down":[106],"to":[107],"O(\u03b1^{-1})":[108],"employing":[110],"a":[111,116],"simple":[112],"randomized":[113],"algorithm":[114],"with":[115,165],"success":[117],"probability":[118],"\u2265":[119],"1/2.":[120],"also":[122],"supporting":[129],"\"Path":[130],"Maximum":[131],"g-value":[132],"Color\"":[133],"general":[144],"framework":[145],"encapsulates":[146],"both":[147],"our":[157],"consider":[161],"word-RAM":[163],"model":[164],"w":[166,171],"\u2208":[167],"\u03a9(log":[168],"n),":[169],"word":[174],"size":[175],"bits.":[177]},"counts_by_year":[],"updated_date":"2026-06-18T10:00:31.954636","created_date":"2026-06-09T00:00:00"}