{"id":"https://openalex.org/W2154356512","doi":"https://doi.org/10.1109/69.687976","title":"Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation","display_name":"Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation","alternate_titles":[],"publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2154356512","doi":"https://doi.org/10.1109/69.687976","mag":"2154356512"},"language":"en","primary_location":{"id":"doi:10.1109/69.687976","doi":"https://doi.org/10.1109/69.687976","is_oa":false,"landing_page_url":"https://doi.org/10.1109/69.687976","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-a","cwts-core","dongbi-a","fnege-3","jufo-3","norway-2","poland-200","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2154356512"],"child_works_count":0,"type":"article","is_traditional":true,"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":null,"display_name":"N. Jing","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4405279573","display_name":"Changsha Institute of Technology","ror":"https://ror.org/01pf1k375","country_code":"CN","type":"education","lineage":["https://openalex.org/I4405279573"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"N. Jing","raw_affiliation_strings":["Department of Electrical Engineering, Changsha Institute of Technology, Changsha, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Changsha Institute of Technology, Changsha, China","institution_ids":["https://openalex.org/I4405279573"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113373276","display_name":"Y.-W. Huang","orcid":"https://orcid.org/0000-0002-3133-077X","observed_orcids":["https://orcid.org/0000-0002-3133-077X"]},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Y.-W. Huang","raw_affiliation_strings":["Department of Electrical Engineering, University of Michigan, Ann Arbor, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008269094","display_name":"Elke Angelika Rundensteiner","orcid":"https://orcid.org/0000-0001-5375-9254","observed_orcids":["https://orcid.org/0000-0001-5375-9254"]},"institutions":[{"id":"https://openalex.org/I107077323","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48","country_code":"US","type":"education","lineage":["https://openalex.org/I107077323"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E.A. Rundensteiner","raw_affiliation_strings":["Department of Computer Science, Worcester Polytechnic Institute, Worcester, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Worcester Polytechnic Institute, Worcester, MA, USA","institution_ids":["https://openalex.org/I107077323"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":2.1703,"has_fulltext":false,"cited_by_count":217,"citation_normalized_percentile":{"value":0.84768212,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":100},"biblio":{"volume":"10","issue":"3","first_page":"409","last_page":"432"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.6431000232696533,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.6431000232696533,"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/T11106","display_name":"Data Management and Algorithms","score":0.32350000739097595,"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"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.015200000256299973,"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/transportation-networks","display_name":"transportation networks","score":0.6759999990463257},{"id":"https://openalex.org/keywords/intelligent-transportation-systems","display_name":"intelligent transportation systems","score":0.8320000171661377},{"id":"https://openalex.org/keywords/graph-partitioning","display_name":"graph partitioning","score":0.9359999895095825},{"id":"https://openalex.org/keywords/spatial-efficiency","display_name":"space efficiency","score":0.515999972820282},{"id":"https://openalex.org/keywords/navigation-systems","display_name":"navigation systems","score":0.4580000042915344}],"concepts":[{"id":"https://openalex.org/C159379195","wikidata":"https://www.wikidata.org/wiki/Q7239568","display_name":"Precomputation","level":3,"score":0.8810017108917236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8524162769317627},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6478090882301331},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.5481774806976318},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.49979686737060547},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4926474690437317},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4306495487689972},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4300302267074585},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.40414708852767944},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3852825164794922},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35987192392349243},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3463892936706543},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2637558579444885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20977291464805603},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.20325756072998047},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.19973433017730713},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14001494646072388},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/69.687976","doi":"https://doi.org/10.1109/69.687976","is_oa":false,"landing_page_url":"https://doi.org/10.1109/69.687976","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-a","cwts-core","dongbi-a","fnege-3","jufo-3","norway-2","poland-200","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.124.410","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umn.edu/research/shashi-group/CS8715/SN1_jing_huang_runden.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.32.3062","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.3062","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://davis.wpi.edu/dsrg/SDB/UM_SSDB/TKDE-98-its-opt-hier.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7250000238418579,"id":"https://metadata.un.org/sdg/11"},{"display_name":"Industry, innovation and infrastructure","score":0.7207000255584717,"id":"https://metadata.un.org/sdg/9"}],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306108","display_name":"U.S. Department of Transportation","ror":"https://ror.org/02xfw2e90"},{"id":"https://openalex.org/F4320308157","display_name":"Michigan Department of Transportation","ror":"https://ror.org/01kae7563"},{"id":"https://openalex.org/F4320309652","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291"},{"id":"https://openalex.org/F4320317074","display_name":"Worcester Polytechnic Institute","ror":"https://ror.org/05ejpqr48"},{"id":"https://openalex.org/F4320334945","display_name":"Fok Ying Tong Education Foundation","ror":"https://ror.org/01mv9t934"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W177721096","https://openalex.org/W633205017","https://openalex.org/W1497617721","https://openalex.org/W1503149859","https://openalex.org/W1517450106","https://openalex.org/W1548896448","https://openalex.org/W1574176984","https://openalex.org/W1576103723","https://openalex.org/W1604079351","https://openalex.org/W1646038686","https://openalex.org/W1910272261","https://openalex.org/W1989111470","https://openalex.org/W1993504147","https://openalex.org/W1993901614","https://openalex.org/W2030267609","https://openalex.org/W2030331592","https://openalex.org/W2073019044","https://openalex.org/W2096035728","https://openalex.org/W2097606793","https://openalex.org/W2099624270","https://openalex.org/W2102797945","https://openalex.org/W2104534102","https://openalex.org/W2119430004","https://openalex.org/W2139539792","https://openalex.org/W2139954500","https://openalex.org/W2150521667","https://openalex.org/W2165283038","https://openalex.org/W2169528473","https://openalex.org/W2169910125","https://openalex.org/W2171420765","https://openalex.org/W2227557434","https://openalex.org/W2319958627","https://openalex.org/W2752885492","https://openalex.org/W2891523467","https://openalex.org/W3111526966"],"related_works":["https://openalex.org/W1993901614","https://openalex.org/W567232885","https://openalex.org/W23206853","https://openalex.org/W1555787662","https://openalex.org/W177721096","https://openalex.org/W633205017","https://openalex.org/W1540525845","https://openalex.org/W2092854824","https://openalex.org/W47153646","https://openalex.org/W3199626662"],"abstract_inverted_index":{"Efficient":[0],"path":[1,21,39,47,88,108,136,142,170,176,207],"computation":[2],"is":[3],"essential":[4],"for":[5,68,95,158],"applications":[6],"such":[7],"as":[8],"intelligent":[9],"transportation":[10,31],"systems":[11],"(ITS)":[12],"and":[13,86,130,173,175,194,214],"network":[14,32],"routing.":[15],"In":[16,178],"ITS":[17],"navigation":[18],"systems,":[19],"many":[20],"requests":[22],"can":[23],"be":[24,56],"submitted":[25],"over":[26,150,205],"the":[27,62,79,124,162],"same,":[28],"typically":[29],"huge,":[30],"within":[33],"a":[34,105],"small":[35],"time":[36,129],"window.":[37],"While":[38],"precomputation":[40,137],"(path":[41],"view)":[42],"would":[43],"provide":[44],"an":[45,184],"efficient":[46],"query":[48,101],"response,":[49],"it":[50],"raises":[51],"three":[52,115],"problems":[53],"which":[54],"must":[55],"addressed:":[57],"1)":[58],"precomputed":[59],"paths":[60,148],"exceed":[61],"current":[63],"computer":[64],"main":[65],"memory":[66],"capacity":[67],"large":[69,96],"networks;":[70],"2)":[71],"disk-based":[72],"solutions":[73,157],"are":[74,152],"too":[75,91],"inefficient":[76],"to":[77,93],"meet":[78],"stringent":[80],"requirements":[81,132],"of":[82,161,188,212],"these":[83],"target":[84],"applications;":[85],"3)":[87],"views":[89],"become":[90],"costly":[92],"update":[94],"graphs":[97],"(resulting":[98],"in":[99,210],"out-of-date":[100],"results).":[102],"We":[103,145,154],"propose":[104],"hierarchical":[106],"encoded":[107],"view":[109,125,171],"(HEPV)":[110],"model":[111],"that":[112,147,201],"addresses":[113],"all":[114,159],"problems.":[116],"By":[117],"hierarchically":[118],"encoding":[119,126,172],"partial":[120],"paths,":[121],"HEPV":[122,151,163,189,202],"reduces":[123],"time,":[127],"updating":[128],"storage":[131],"beyond":[133],"previously":[134],"known":[135],"techniques,":[138],"while":[139],"significantly":[140],"minimizing":[141],"retrieval":[143],"time.":[144],"prove":[146],"retrieved":[149],"optimal.":[153],"present":[155,183],"complete":[156],"phases":[160],"approach,":[164],"including":[165],"graph":[166],"partitioning,":[167],"hierarchy":[168],"generation,":[169],"updating,":[174],"retrieval.":[177],"this":[179],"paper,":[180],"we":[181],"also":[182],"in-depth":[185],"experimental":[186],"evaluation":[187],"based":[190],"on":[191],"both":[192],"synthetic":[193],"real":[195],"GIS":[196],"networks.":[197],"Our":[198],"results":[199],"confirm":[200],"offers":[203],"advantages":[204],"alternative":[206],"finding":[208],"approaches":[209],"terms":[211],"performance":[213],"space":[215],"efficiency.":[216]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2154356512","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":17}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
