{"id":"https://openalex.org/W2171901130","doi":"https://doi.org/10.1145/1376616.1376623","title":"Scalable network distance browsing in spatial databases","display_name":"Scalable network distance browsing in spatial databases","publication_year":2008,"publication_date":"2008-06-09","ids":{"openalex":"https://openalex.org/W2171901130","doi":"https://doi.org/10.1145/1376616.1376623","mag":"2171901130"},"language":"en","primary_location":{"id":"doi:10.1145/1376616.1376623","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1376616.1376623","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 ACM SIGMOD international conference on Management of data","raw_type":"proceedings-article"},"type":"article","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/A5087437068","display_name":"Hanan Samet","orcid":"https://orcid.org/0000-0001-8230-0653"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hanan Samet","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050157577","display_name":"Jagan Sankaranarayanan","orcid":"https://orcid.org/0009-0006-0369-816X"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jagan Sankaranarayanan","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065267529","display_name":"Houman Alborzi","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Houman Alborzi","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5087437068"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":30.3826,"has_fulltext":false,"cited_by_count":304,"citation_normalized_percentile":{"value":0.99850124,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"43","last_page":"54"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"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":1.0,"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/T10757","display_name":"Geographic Information Systems Studies","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9919999837875366,"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/computer-science","display_name":"Computer science","score":0.6545879244804382},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6529287695884705},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5977652072906494},{"id":"https://openalex.org/keywords/quadtree","display_name":"Quadtree","score":0.5747286081314087},{"id":"https://openalex.org/keywords/precomputation","display_name":"Precomputation","score":0.5683000087738037},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.520571768283844},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4343319535255432},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39108431339263916},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38215315341949463},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3616181015968323},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3140694499015808},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.11711928248405457},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.10105851292610168}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6545879244804382},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6529287695884705},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5977652072906494},{"id":"https://openalex.org/C151416825","wikidata":"https://www.wikidata.org/wiki/Q934791","display_name":"Quadtree","level":2,"score":0.5747286081314087},{"id":"https://openalex.org/C159379195","wikidata":"https://www.wikidata.org/wiki/Q7239568","display_name":"Precomputation","level":3,"score":0.5683000087738037},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.520571768283844},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4343319535255432},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39108431339263916},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38215315341949463},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3616181015968323},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3140694499015808},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.11711928248405457},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.10105851292610168},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1376616.1376623","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1376616.1376623","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 ACM SIGMOD international conference on Management of data","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.145.3930","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.3930","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/~hjs/pubs/sigmod08.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.227.3492","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.227.3492","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/%7Ehjs/slides/sigmod-slides.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.323.8782","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.323.8782","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://infolab.usc.edu/csci599/Fall2009/papers/Scalable network distance browsing in spatial databases.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5899999737739563,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W26550955","https://openalex.org/W197260046","https://openalex.org/W1497953515","https://openalex.org/W1543003006","https://openalex.org/W1561240874","https://openalex.org/W1600592911","https://openalex.org/W1931818007","https://openalex.org/W1973444249","https://openalex.org/W1980293260","https://openalex.org/W1990111898","https://openalex.org/W2000288754","https://openalex.org/W2007695015","https://openalex.org/W2014889099","https://openalex.org/W2030670215","https://openalex.org/W2044012461","https://openalex.org/W2046144220","https://openalex.org/W2050734958","https://openalex.org/W2065759448","https://openalex.org/W2083016274","https://openalex.org/W2088171019","https://openalex.org/W2088630449","https://openalex.org/W2094078373","https://openalex.org/W2100586428","https://openalex.org/W2134874858","https://openalex.org/W2154356512","https://openalex.org/W2161008043","https://openalex.org/W2168872671","https://openalex.org/W2169336598","https://openalex.org/W2169528473","https://openalex.org/W2169893912","https://openalex.org/W2171330332"],"related_works":["https://openalex.org/W3032870653","https://openalex.org/W3149063625","https://openalex.org/W2357644463","https://openalex.org/W1996697202","https://openalex.org/W4388031360","https://openalex.org/W94062305","https://openalex.org/W4287775348","https://openalex.org/W2237480599","https://openalex.org/W2018146256","https://openalex.org/W2094515718"],"abstract_inverted_index":{"An":[0],"algorithm":[1,22,264],"is":[2,23,134,144,261],"presented":[3],"for":[4],"finding":[5,216],"the":[6,27,35,48,51,60,70,74,83,86,92,100,105,116,121,132,147,173,190,196,200,204,211,217,223,227,233,237,242,246,249,258,263,269,273],"k":[7],"nearest":[8],"neighbors":[9,238],"in":[10,14,34,82,120,272],"a":[11,15,150,158,167],"spatial":[12,141,250,259,274],"network":[13,19,36,201,212,260,275],"best-first":[16],"manner":[17],"using":[18],"distance.":[20],"The":[21,123,193],"based":[24,68],"on":[25,69,73,91,104,115,157],"precomputing":[26],"shortest":[28,52,75,106,151,197,208,270],"paths":[29,53,76,107,198,209,271],"between":[30],"all":[31,58],"possible":[32],"vertices":[33,62,119,247],"and":[37,99,219,230,265],"then":[38],"making":[39],"use":[40],"of":[41,47,59,88,94,102,118,125,131,139,149,160,186,195,206,215,226,232,245,248,268,282],"an":[42,184],"encoding":[43],"that":[44,50,96,172,214,231,254],"takes":[45],"advantage":[46,138],"fact":[49],"from":[54,79,110,178,213,235,241],"vertex":[55],"u":[56],"to":[57,77,108,128,180,189],"remaining":[61],"can":[63,276],"be":[64,277],"decomposed":[65],"into":[66],"subsets":[67,133],"first":[71],"edges":[72],"them":[78,109],"u.":[80],"Thus,":[81],"worst":[84],"case,":[85],"amount":[87,124],"work":[89],"depends":[90],"number":[93,101,117,159],"objects":[95,229,234],"are":[97,239],"examined":[98],"links":[103],"q,":[111],"rather":[112],"than":[113],"depending":[114],"network.":[122,251],"storage":[126,174],"required":[127],"keep":[129],"track":[130],"reduced":[135,177],"by":[136,146,183],"taking":[137],"their":[140],"coherence":[142],"which":[143,236],"captured":[145],"aid":[148],"path":[152],"quadtree.":[153],"In":[154],"particular,":[155],"experiments":[156],"large":[161],"road":[162],"networks":[163],"as":[164,166,255,257],"well":[165],"theoretical":[168],"analysis":[169],"have":[170],"shown":[171],"has":[175],"been":[176],"O(N3)":[179],"O(N1.5)":[181],"(i.e.,":[182],"order":[185],"magnitude":[187],"equal":[188],"square":[191],"root).":[192],"precomputation":[194],"along":[199,210],"essentially":[202],"decouples":[203,222],"process":[205],"computing":[207],"neighbors,":[218],"thereby":[220],"also":[221],"domain":[224,243],"S":[225],"query":[228],"drawn":[240],"V":[244],"This":[252],"means":[253],"long":[256],"unchanged,":[262],"underlying":[266],"representation":[267],"used":[278],"with":[279],"different":[280],"sets":[281],"objects.":[283]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":19},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":22},{"year":2015,"cited_by_count":20},{"year":2014,"cited_by_count":23},{"year":2013,"cited_by_count":29},{"year":2012,"cited_by_count":29}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}