{"id":"https://openalex.org/W2093729646","doi":"https://doi.org/10.1109/icde.2013.6544863","title":"Memory-efficient algorithms for spatial network queries","display_name":"Memory-efficient algorithms for spatial network queries","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2093729646","doi":"https://doi.org/10.1109/icde.2013.6544863","mag":"2093729646"},"language":"en","primary_location":{"id":"doi:10.1109/icde.2013.6544863","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2013.6544863","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 29th International Conference on Data Engineering (ICDE)","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/A5071030042","display_name":"Sarana Nutanong","orcid":"https://orcid.org/0000-0003-1068-850X"},"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":"S. Nutanong","raw_affiliation_strings":["Center for Automation Research, Institute for Advanced Computer Studies, Department of Computer Science, University of Maryland, College Park, MD, USA","Dept. of Comput. Sci., Univ. of Maryland, College Park, MD, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Center for Automation Research, Institute for Advanced Computer Studies, Department of Computer Science, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. of Maryland, College Park, MD, USA#TAB#","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","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":false,"raw_author_name":"H. Samet","raw_affiliation_strings":["Center for Automation Research, Institute for Advanced Computer Studies, Department of Computer Science, University of Maryland, College Park, MD, USA","Dept. of Comput. Sci., Univ. of Maryland, College Park, MD, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Center for Automation Research, Institute for Advanced Computer Studies, Department of Computer Science, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. of Maryland, College Park, MD, USA#TAB#","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071030042"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":3.5372,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.93260306,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"649","last_page":"660"},"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.9966999888420105,"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.9850000143051147,"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/heuristic","display_name":"Heuristic","score":0.6795787811279297},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6650025248527527},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6643697619438171},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.6272183656692505},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6113901138305664},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5673666596412659},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5119386911392212},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.49645930528640747},{"id":"https://openalex.org/keywords/estimator","display_name":"Estimator","score":0.42207467555999756},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.282542884349823},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27232420444488525},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22807088494300842},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13993173837661743},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10285413265228271}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6795787811279297},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6650025248527527},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6643697619438171},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.6272183656692505},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6113901138305664},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5673666596412659},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5119386911392212},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.49645930528640747},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.42207467555999756},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.282542884349823},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27232420444488525},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22807088494300842},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13993173837661743},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10285413265228271},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icde.2013.6544863","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2013.6544863","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 29th International Conference on Data Engineering (ICDE)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.299.853","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.853","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/icde13-yi.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W1516784847","https://openalex.org/W1543003006","https://openalex.org/W1598618182","https://openalex.org/W1646038686","https://openalex.org/W1969483458","https://openalex.org/W1979075286","https://openalex.org/W1980293260","https://openalex.org/W1981031568","https://openalex.org/W1989519960","https://openalex.org/W1990111898","https://openalex.org/W1994286274","https://openalex.org/W1996865658","https://openalex.org/W2002471647","https://openalex.org/W2014635219","https://openalex.org/W2014889099","https://openalex.org/W2024678590","https://openalex.org/W2035579749","https://openalex.org/W2041892841","https://openalex.org/W2046144220","https://openalex.org/W2046609653","https://openalex.org/W2072145795","https://openalex.org/W2077765427","https://openalex.org/W2100344784","https://openalex.org/W2102729946","https://openalex.org/W2102842495","https://openalex.org/W2118269922","https://openalex.org/W2123060058","https://openalex.org/W2127151074","https://openalex.org/W2134479550","https://openalex.org/W2134634502","https://openalex.org/W2134874858","https://openalex.org/W2136390693","https://openalex.org/W2151369660","https://openalex.org/W2169336598","https://openalex.org/W2169717584","https://openalex.org/W2171901130","https://openalex.org/W2621446776","https://openalex.org/W4249924957","https://openalex.org/W6630686185","https://openalex.org/W6635900049","https://openalex.org/W6636945615","https://openalex.org/W6644822220","https://openalex.org/W6654186649","https://openalex.org/W6685173291"],"related_works":["https://openalex.org/W2990663423","https://openalex.org/W2090152127","https://openalex.org/W3171568022","https://openalex.org/W1965169884","https://openalex.org/W3125580510","https://openalex.org/W2008939113","https://openalex.org/W2033213447","https://openalex.org/W14679004","https://openalex.org/W2097149198","https://openalex.org/W2023878529"],"abstract_inverted_index":{"Incrementally":[0],"finding":[1,58],"the":[2,29,47,66,84,93,108,114,120,127,147,154,169,197,218,236,243,248,251,262,276,312,326],"k":[3,30,68,94,128,165],"nearest":[4,31,49,69,95,129],"neighbors":[5,32,50,96,130],"(kNN)":[6],"in":[7,15,51,71,113,214,231,235],"a":[8,99,139,177,189,202,211,232,270],"spatial":[9,115,252],"network":[10,41,74,116,253],"is":[11,63,152,185,257,269,282,319,335,343],"an":[12],"important":[13],"problem":[14],"location-based":[16],"services.":[17],"One":[18],"method":[19,26,78,183],"(INE)":[20],"simply":[21],"applies":[22],"Dijkstra's":[23],"algorithm.":[24],"Another":[25],"(IER)":[27],"computes":[28],"using":[33,98,138],"Euclidean":[34,55,61,100,140],"distance":[35,56,62,264],"followed":[36],"by":[37,82,97,106,131],"computing":[38],"their":[39],"corresponding":[40],"distances,":[42],"and":[43,103,168,223,323,349],"then":[44],"incrementally":[45],"finds":[46],"next":[48],"order":[52],"of":[53,73,86,126,135,156,159,206,247,275,303],"increasing":[54],"until":[57],"one":[59,208,226],"whose":[60],"greater":[64],"than":[65,347,353],"current":[67],"neighbor":[70],"terms":[72],"distance.":[75],"The":[76],"LBC":[77],"improves":[79],"on":[80,104,119,143,305],"INE":[81],"avoiding":[83,107],"visit":[85],"nodes":[87,112],"that":[88,117,153,187,317,333],"cannot":[89],"possibly":[90],"lead":[91],"to":[92,111,123,173,250,260,284,292,295],"heuristic":[101,136,141,160,191,287,329],"estimator,":[102],"IER":[105],"repeated":[109],"visits":[110],"appear":[118],"shortest":[121],"paths":[122],"different":[124],"members":[125],"performing":[132],"multiple":[133,157,221,271],"instances":[134,158],"search":[137,161,330],"estimator":[142],"candidate":[144],"objects":[145,195],"around":[146],"query":[148,198,272],"point.":[149],"LBC's":[150],"drawback":[151],"maintenance":[155],"(called":[162],"wavefronts)":[163],"requires":[164],"priority":[166,227],"queues":[167],"queue":[170],"operations":[171],"required":[172],"maintain":[174],"them":[175],"incur":[176],"high":[178],"in-memory":[179,237],"processing":[180,238],"cost.":[181],"A":[182],"(SWH)":[184],"proposed":[186],"utilizes":[188],"novel":[190],"function":[192],"which":[193,268],"considers":[194],"surrounding":[196],"point":[199,273],"together":[200],"as":[201,207,213,254,299],"single":[203],"unit,":[204],"instead":[205],"destination":[209],"at":[210],"time":[212],"LBC,":[215,325],"thereby":[216,289],"eliminating":[217],"need":[219],"for":[220,307],"wavefronts":[222],"needs":[224],"just":[225],"queue.":[228],"These":[229],"results":[230],"significant":[233],"reduction":[234],"cost":[239,246],"components":[240],"while":[241],"having":[242],"same":[244],"reduced":[245],"access":[249],"LBC.":[255],"SWH":[256,281,306,318,334],"also":[258],"extended":[259],"support":[261,285],"incremental":[263],"semi-join":[265],"(IDSJ)":[266],"query,":[267],"generalization":[274],"kNN":[277,308],"query.":[278],"In":[279],"addition,":[280],"shown":[283],"landmark-based":[286],"functions,":[288],"enabling":[290],"it":[291],"be":[293],"applied":[294],"non-spatial":[296],"networks/graphs":[297],"such":[298],"social":[300],"networks.":[301],"Comparisons":[302],"experiments":[304],"queries":[309],"with":[310,324],"INE,":[311],"best":[313,327],"single-wavefront":[314],"method,":[315,331],"show":[316,332],"2.5":[320],"times":[321,337,345,351],"faster,":[322],"existing":[328],"3.5":[336],"faster.":[338],"For":[339],"IDSJ":[340],"queries,":[341],"SWH-IDSJ":[342],"5":[344],"faster":[346,352],"INE-IDSJ,":[348],"4":[350],"LBC-IDSJ.":[354]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}