{"id":"https://openalex.org/W2060325926","doi":"https://doi.org/10.1145/1463434.1463486","title":"Efficient search of moving objects on a planar graph","display_name":"Efficient search of moving objects on a planar graph","publication_year":2008,"publication_date":"2008-11-05","ids":{"openalex":"https://openalex.org/W2060325926","doi":"https://doi.org/10.1145/1463434.1463486","mag":"2060325926"},"language":"en","primary_location":{"id":"doi:10.1145/1463434.1463486","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1463434.1463486","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems","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/A5079794854","display_name":"Thuy T. Le","orcid":"https://orcid.org/0000-0001-8925-7205"},"institutions":[{"id":"https://openalex.org/I106938459","display_name":"University of New Brunswick","ror":"https://ror.org/05nkf0n29","country_code":"CA","type":"education","lineage":["https://openalex.org/I106938459"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Thuy Thi Thu Le","raw_affiliation_strings":["University of New Brunswick, Fredericton, N.B. Canada"],"affiliations":[{"raw_affiliation_string":"University of New Brunswick, Fredericton, N.B. Canada","institution_ids":["https://openalex.org/I106938459"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112275493","display_name":"Bradford G. Nickerson","orcid":null},"institutions":[{"id":"https://openalex.org/I106938459","display_name":"University of New Brunswick","ror":"https://ror.org/05nkf0n29","country_code":"CA","type":"education","lineage":["https://openalex.org/I106938459"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Bradford G. Nickerson","raw_affiliation_strings":["University of New Brunswick, Fredericton, N.B. Canada"],"affiliations":[{"raw_affiliation_string":"University of New Brunswick, Fredericton, N.B. Canada","institution_ids":["https://openalex.org/I106938459"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079794854"],"corresponding_institution_ids":["https://openalex.org/I106938459"],"apc_list":null,"apc_paid":null,"fwci":1.00508892,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.78123973,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"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.991100013256073,"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/T13282","display_name":"Automated Road and Building Extraction","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.8067886829376221},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6970634460449219},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6035410165786743},{"id":"https://openalex.org/keywords/auxiliary-memory","display_name":"Auxiliary memory","score":0.5251079201698303},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5240756869316101},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.4927537739276886},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.469482958316803},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.45470908284187317},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4135183095932007},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3633337914943695},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36045849323272705},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.277978777885437},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2376253604888916},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21129539608955383},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1679489016532898}],"concepts":[{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.8067886829376221},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6970634460449219},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6035410165786743},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.5251079201698303},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5240756869316101},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.4927537739276886},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.469482958316803},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.45470908284187317},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4135183095932007},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3633337914943695},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36045849323272705},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.277978777885437},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2376253604888916},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21129539608955383},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1679489016532898},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1463434.1463486","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1463434.1463486","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1977949265","https://openalex.org/W1979207937","https://openalex.org/W2029331355","https://openalex.org/W2086474457","https://openalex.org/W2101429492","https://openalex.org/W2148539226","https://openalex.org/W2149906774","https://openalex.org/W2166258313","https://openalex.org/W4206231591","https://openalex.org/W6609400226"],"related_works":["https://openalex.org/W2354057059","https://openalex.org/W2090103608","https://openalex.org/W2376570066","https://openalex.org/W2037710955","https://openalex.org/W2008046591","https://openalex.org/W2181360821","https://openalex.org/W2378762226","https://openalex.org/W3098335909","https://openalex.org/W2605620386","https://openalex.org/W2049361636"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,20,48,68,85],"dynamic":[3],"spatio-temporal":[4],"data":[5,46],"structure":[6],"called":[7],"the":[8,32,42,77,90,99,116,127,133],"Graph":[9],"Strip":[10],"Tree":[11],"(GStree)":[12],"for":[13,59,76,101,122],"indexing":[14],"objects":[15,65,82],"constrained":[16],"to":[17,26,62,72,94],"move":[18],"on":[19,80],"graph.":[21],"The":[22],"GStree":[23,69,91,117],"is":[24,92,130],"designed":[25],"efficiently":[27],"answer":[28],"range":[29],"queries":[30,61,79],"about":[31],"current":[33],"or":[34],"past":[35],"positions":[36],"of":[37,44,51,135],"moving":[38,64,81],"objects.":[39],"To":[40],"test":[41],"efficiency":[43],"our":[45],"structure,":[47],"road":[49],"network":[50],"66,437":[52],"roads":[53],"was":[54],"used.":[55],"Average":[56],"search":[57,74,125,128],"times":[58,75,96,111],"random":[60],"find":[63],"indexed":[66,83],"by":[67,84,132],"were":[70],"compared":[71],"average":[73],"same":[78],"MON-tree.":[86],"Results":[87],"indicate":[88],"that":[89],"up":[93],"24":[95],"faster":[97,121],"than":[98],"MON-tree":[100],"internal":[102],"memory":[103,124],"searching,":[104],"and":[105,109],"visits":[106],"between":[107],"3.6":[108],"38":[110],"fewer":[112],"nodes.":[113],"Analysis":[114],"indicates":[115],"will":[118],"be":[119],"significantly":[120],"external":[123],"where":[126],"time":[129],"dominated":[131],"number":[134],"disk":[136],"I/Os.":[137]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}