{"id":"https://openalex.org/W2147713365","doi":"https://doi.org/10.1007/978-3-540-69497-7_12","title":"Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks","display_name":"Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks","publication_year":2008,"publication_date":"2008-08-12","ids":{"openalex":"https://openalex.org/W2147713365","doi":"https://doi.org/10.1007/978-3-540-69497-7_12","mag":"2147713365"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-69497-7_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-69497-7_12","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":"conference-paper","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/A5109848174","display_name":"Hans\u2010Peter Kriegel","orcid":null},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Hans-Peter Kriegel","raw_affiliation_strings":["Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Oettingenstr. 67, 80538, Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Oettingenstr. 67, 80538, Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074196124","display_name":"Peer Kr\u00f6ger","orcid":"https://orcid.org/0000-0001-5646-3299"},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peer Kr\u00f6ger","raw_affiliation_strings":["Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Oettingenstr. 67, 80538, Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Oettingenstr. 67, 80538, Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016653456","display_name":"Matthias Renz","orcid":"https://orcid.org/0000-0002-2024-7700"},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Matthias Renz","raw_affiliation_strings":["Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Oettingenstr. 67, 80538, Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Oettingenstr. 67, 80538, Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000501317","display_name":"Tim Schmidt","orcid":"https://orcid.org/0009-0001-1383-2899"},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tim Schmidt","raw_affiliation_strings":["Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Oettingenstr. 67, 80538, Munich, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Oettingenstr. 67, 80538, Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I8204097"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":4.1134,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.95909022,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"150","last_page":"167"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9912999868392944,"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"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.989300012588501,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.8085830211639404},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.7009003758430481},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6926005482673645},{"id":"https://openalex.org/keywords/graph-embedding","display_name":"Graph embedding","score":0.6471307873725891},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5055935382843018},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4508481025695801},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4457743167877197},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11142554879188538}],"concepts":[{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.8085830211639404},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7009003758430481},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6926005482673645},{"id":"https://openalex.org/C75564084","wikidata":"https://www.wikidata.org/wiki/Q5597085","display_name":"Graph embedding","level":3,"score":0.6471307873725891},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5055935382843018},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4508481025695801},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4457743167877197},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11142554879188538}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-69497-7_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-69497-7_12","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:CiteSeerX.psu:10.1.1.452.1013","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.452.1013","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dbs.informatik.uni-muenchen.de/~kroegerp/papers/SSDBM08-Traffic.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W197260046","https://openalex.org/W1493828742","https://openalex.org/W1543003006","https://openalex.org/W1600592911","https://openalex.org/W1810931192","https://openalex.org/W1866249310","https://openalex.org/W1985324218","https://openalex.org/W1993504147","https://openalex.org/W2000480596","https://openalex.org/W2007695015","https://openalex.org/W2099624270","https://openalex.org/W2139539792","https://openalex.org/W2141793995","https://openalex.org/W2151400766","https://openalex.org/W2168872671","https://openalex.org/W2169336598","https://openalex.org/W2169528473","https://openalex.org/W2274435092","https://openalex.org/W2476097413","https://openalex.org/W2495528278","https://openalex.org/W2752885492","https://openalex.org/W2895284333","https://openalex.org/W3145128584","https://openalex.org/W4235974311"],"related_works":["https://openalex.org/W2601821547","https://openalex.org/W3036264823","https://openalex.org/W2912814903","https://openalex.org/W3206528106","https://openalex.org/W2950907416","https://openalex.org/W3038102983","https://openalex.org/W2082479932","https://openalex.org/W2123605750","https://openalex.org/W2932872266","https://openalex.org/W2088740331"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}