{"id":"https://openalex.org/W2102842495","doi":"https://doi.org/10.14778/1687627.1687763","title":"Path oracles for spatial networks","display_name":"Path oracles for spatial networks","publication_year":2009,"publication_date":"2009-08-01","ids":{"openalex":"https://openalex.org/W2102842495","doi":"https://doi.org/10.14778/1687627.1687763","mag":"2102842495"},"language":"en","primary_location":{"id":"doi:10.14778/1687627.1687763","is_oa":false,"landing_page_url":"https://doi.org/10.14778/1687627.1687763","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-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/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":true,"raw_author_name":"Jagan Sankaranarayanan","raw_affiliation_strings":["University of Maryland, College Park, MD"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","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":"Hanan Samet","raw_affiliation_strings":["University of Maryland, College Park, MD"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD","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"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050157577"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":9.9988,"has_fulltext":false,"cited_by_count":125,"citation_normalized_percentile":{"value":0.98759947,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":"2","issue":"1","first_page":"1210","last_page":"1221"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9969000220298767,"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/T10757","display_name":"Geographic Information Systems Studies","score":0.9932000041007996,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.7977110743522644},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7075205445289612},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5544113516807556},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5526368618011475},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.45571234822273254},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44966307282447815},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4447265565395355},{"id":"https://openalex.org/keywords/spatial-database","display_name":"Spatial database","score":0.41961660981178284},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4144129753112793},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4132373332977295},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.41157156229019165},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2939035892486572},{"id":"https://openalex.org/keywords/spatial-analysis","display_name":"Spatial analysis","score":0.27240508794784546},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.15622299909591675},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13072293996810913}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.7977110743522644},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7075205445289612},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5544113516807556},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5526368618011475},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.45571234822273254},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44966307282447815},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4447265565395355},{"id":"https://openalex.org/C203689450","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial database","level":3,"score":0.41961660981178284},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4144129753112793},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4132373332977295},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.41157156229019165},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2939035892486572},{"id":"https://openalex.org/C159620131","wikidata":"https://www.wikidata.org/wiki/Q1938983","display_name":"Spatial analysis","level":2,"score":0.27240508794784546},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.15622299909591675},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13072293996810913},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.14778/1687627.1687763","is_oa":false,"landing_page_url":"https://doi.org/10.14778/1687627.1687763","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.147.8435","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.8435","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/users/hjs/pubs/wsp-vldb09.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.151.7095","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.7095","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.vldb.org/pvldb/2/vldb09-486.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":19,"referenced_works":["https://openalex.org/W3423378","https://openalex.org/W172209122","https://openalex.org/W1497953515","https://openalex.org/W1543003006","https://openalex.org/W1561240874","https://openalex.org/W2014889099","https://openalex.org/W2028430839","https://openalex.org/W2050576295","https://openalex.org/W2063738332","https://openalex.org/W2093455937","https://openalex.org/W2127151074","https://openalex.org/W2147713365","https://openalex.org/W2149210101","https://openalex.org/W2154356512","https://openalex.org/W2168872671","https://openalex.org/W2169336598","https://openalex.org/W2171901130","https://openalex.org/W2285562924","https://openalex.org/W7005918426"],"related_works":["https://openalex.org/W1981956918","https://openalex.org/W2050463416","https://openalex.org/W2355582074","https://openalex.org/W2355790495","https://openalex.org/W2362070202","https://openalex.org/W2029306088","https://openalex.org/W2347879483","https://openalex.org/W2372708426","https://openalex.org/W2393970781","https://openalex.org/W2355715453"],"abstract_inverted_index":{"The":[0,20,106],"advent":[1],"of":[2,34,46,69,81,100,108,122,138,160,231,267],"location-based":[3],"services":[4],"has":[5,167],"led":[6],"to":[7,26,84,170,197],"an":[8,208,259,265],"increased":[9],"demand":[10],"for":[11,201],"performing":[12],"operations":[13,28],"on":[14,29,114,151,304],"spatial":[15,30,73,120,171,306],"networks":[16,31,172],"in":[17,23,32,43,71,88,211,215,271,289],"real":[18],"time.":[19],"challenge":[21],"lies":[22],"being":[24],"able":[25],"cast":[27],"terms":[33],"relational":[35,90],"operators":[36],"so":[37],"that":[38,58,145,183,205,256,283,293],"they":[39,294],"can":[40,206,257,298],"be":[41,198],"performed":[42],"the":[44,61,82,109,115,119,129,136,152,158,161,174,228,268,284],"context":[45],"a":[47,53,72,85,89,101,178,212,222,278],"database.":[48],"A":[49],"linear-sized":[50],"construct":[51,226],"termed":[52,227],"path":[54,110,179,214],"oracle":[55,111,180,230],"is":[56,112,181,194,254],"introduced":[57],"compactly":[59],"encodes":[60],"n":[62,76,189,218,235,246,274,290],"2":[63,249,252],"shortest":[64,95,130,153,213],"paths":[65,83,96,131,154],"between":[66,118,132,155],"every":[67],"pair":[68],"vertices":[70,77,127,142,148],"network":[74,175,269,307],"having":[75],"thereby":[78],"reducing":[79],"each":[80],"single":[86,102],"tuple":[87],"database":[91],"and":[92,125,128,140,297],"enables":[93],"finding":[94],"by":[97],"repeated":[98],"application":[99],"SQL":[103],"SELECT":[104],"operator.":[105],"construction":[107],"based":[113],"observed":[116],"coherence":[117],"positions":[121],"both":[123],"source":[124,139],"destination":[126,141],"them":[133],"which":[134,166,291],"facilitates":[135],"aggregation":[137],"into":[143],"groups":[144],"share":[146],"common":[147],"or":[149],"edges":[150],"them.":[156],"With":[157],"aid":[159],"Well-Separated":[162],"Pair":[163],"(WSP)":[164],"technique,":[165],"been":[168],"applied":[169],"using":[173,221,277],"distance":[176],"measure,":[177],"proposed":[182,255,285],"takes":[184],"O":[185,216,233,272],"(":[186,234,245],"s":[187,193,238],"d":[188,239,242],")":[190,219,275],"space,":[191],"where":[192],"empirically":[195],"estimated":[196],"around":[199],"12":[200],"road":[202],"networks,":[203],"but":[204],"retrieve":[207,258],"intermediate":[209,260],"link":[210],"(log":[217,273],"time":[220,276],"B-tree.":[223,279],"An":[224],"additional":[225],"path-distance":[229],"size":[232],"\u00b7":[236,247],"max(":[237],",":[240,250],"1/\u03b5":[241],"))":[243],"(empirically":[244],"max(12":[248],"2.5/\u03b5":[251],")))":[253],"vertex":[261],"as":[262,264],"well":[263],"\u03b5-approximation":[266],"distances":[270],"Experimental":[280],"results":[281],"indicate":[282],"oracles":[286],"are":[287,295],"linear":[288],"means":[292],"scalable":[296],"enable":[299],"complicated":[300],"query":[301],"processing":[302],"scenarios":[303],"massive":[305],"datasets.":[308]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":11}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}