{"id":"https://openalex.org/W1996888505","doi":"https://doi.org/10.4018/jitwe.2006100101","title":"eDAR Algorithm for Continuous KNN Queries Based on Pine","display_name":"eDAR Algorithm for Continuous KNN Queries Based on Pine","publication_year":2006,"publication_date":"2006-10-01","ids":{"openalex":"https://openalex.org/W1996888505","doi":"https://doi.org/10.4018/jitwe.2006100101","mag":"1996888505"},"language":"en","primary_location":{"id":"doi:10.4018/jitwe.2006100101","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jitwe.2006100101","pdf_url":null,"source":{"id":"https://openalex.org/S152329874","display_name":"International Journal of Information Technology and Web Engineering","issn_l":"1554-1045","issn":["1554-1045","1554-1053"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Information Technology and Web Engineering","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/A5041193229","display_name":"Maytham Safar","orcid":"https://orcid.org/0000-0002-0007-3141"},"institutions":[{"id":"https://openalex.org/I36721946","display_name":"Kuwait University","ror":"https://ror.org/021e5j056","country_code":"KW","type":"education","lineage":["https://openalex.org/I36721946"]}],"countries":["KW"],"is_corresponding":true,"raw_author_name":"Maytham Safar","raw_affiliation_strings":["Kuwait University, Kuwait",", Kuwait University, Kuwait"],"affiliations":[{"raw_affiliation_string":"Kuwait University, Kuwait","institution_ids":["https://openalex.org/I36721946"]},{"raw_affiliation_string":", Kuwait University, Kuwait","institution_ids":["https://openalex.org/I36721946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022986816","display_name":"Dariush Ebrahimi","orcid":"https://orcid.org/0000-0003-2489-8858"},"institutions":[{"id":"https://openalex.org/I36721946","display_name":"Kuwait University","ror":"https://ror.org/021e5j056","country_code":"KW","type":"education","lineage":["https://openalex.org/I36721946"]}],"countries":["KW"],"is_corresponding":false,"raw_author_name":"Dariush Ebrahimi","raw_affiliation_strings":["Kuwait University, Kuwait",", Kuwait University, Kuwait"],"affiliations":[{"raw_affiliation_string":"Kuwait University, Kuwait","institution_ids":["https://openalex.org/I36721946"]},{"raw_affiliation_string":", Kuwait University, Kuwait","institution_ids":["https://openalex.org/I36721946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041193229"],"corresponding_institution_ids":["https://openalex.org/I36721946"],"apc_list":null,"apc_paid":null,"fwci":2.2261,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.86906185,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1","issue":"4","first_page":"1","last_page":"21"},"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/T10757","display_name":"Geographic Information Systems Studies","score":0.9887999892234802,"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.9854999780654907,"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/computer-science","display_name":"Computer science","score":0.7251229286193848},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5873750448226929},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5717724561691284},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.553180456161499},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5150277614593506},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5105813145637512},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4744361937046051},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.46914783120155334},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46221891045570374},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4515938460826874},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4396458566188812},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2090190052986145},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1909273862838745},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09514760971069336}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7251229286193848},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5873750448226929},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5717724561691284},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.553180456161499},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5150277614593506},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5105813145637512},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4744361937046051},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.46914783120155334},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46221891045570374},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4515938460826874},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4396458566188812},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2090190052986145},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1909273862838745},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09514760971069336},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/jitwe.2006100101","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jitwe.2006100101","pdf_url":null,"source":{"id":"https://openalex.org/S152329874","display_name":"International Journal of Information Technology and Web Engineering","issn_l":"1554-1045","issn":["1554-1045","1554-1053"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Information Technology and Web Engineering","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jitwe0:v:1:y:2006:i:4:p:1-21","is_oa":false,"landing_page_url":"https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jitwe.2006100101","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"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/W14679004","https://openalex.org/W2097149198","https://openalex.org/W2023878529","https://openalex.org/W1566651525"],"abstract_inverted_index":{"The":[0,43],"continuous":[1],"K":[2],"nearest":[3],"neighbor":[4],"(CKNN)":[5],"query":[6,12,20,49],"is":[7,50,125],"an":[8,69],"important":[9,119],"type":[10,47],"of":[11,45,48,53,68,75],"that":[13,65,83,154,173],"continuously":[14],"finds":[15],"the":[16,66,76,79,118,122,144,155],"KNN":[17,67,169],"to":[18,138],"a":[19,23,51,88,109],"point":[21,90],"on":[22,31,35,72,101,143,176],"given":[24],"path.":[25],"In":[26,104],"this":[27,46,105],"article":[28],"we":[29,107],"focus":[30],"moving":[32],"queries":[33,141,170],"issued":[34],"stationary":[36],"objects":[37],"in":[38,115],"spatial":[39],"network":[40,126,147],"database":[41],"(SNDB).":[42],"result":[44],"set":[52],"intervals":[54],"(defined":[55],"by":[56],"split":[57,89],"points)":[58],"and":[59,135,162,168],"their":[60],"corresponding":[61],"KNNs.":[62],"This":[63],"means":[64],"object":[70],"travelling":[71],"one":[73],"interval":[74,84],"path":[77,124],"remains":[78],"same":[80],"all":[81],"through":[82],"until":[85],"it":[86],"reaches":[87],"where":[91,117],"its":[92],"KNNs":[93],"change.":[94],"Existing":[95],"methods":[96],"for":[97,112,121],"CKNN":[98,114,140],"are":[99,174],"based":[100,142,175],"Euclidean":[102,130],"distances.":[103,131],"article,":[106],"propose":[108,133],"new":[110],"algorithm":[111],"answering":[113],"SNDB":[116],"measure":[120],"shortest":[123,165],"distances":[127],"rather":[128],"than":[129,171],"We":[132],"DAR":[134],"eDAR":[136,156],"algorithms":[137],"address":[139],"progressive":[145],"incremental":[146],"expansion":[148],"(PINE)":[149],"technique.":[150],"Our":[151],"experiments":[152],"show":[153],"approach":[157],"has":[158],"better":[159],"response":[160],"time,":[161],"requires":[163],"fewer":[164],"distance":[166],"computations":[167],"approaches":[172],"VN3":[177],"using":[178],"IE.":[179]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}