Approximate algorithms for static and continuous range queries in mobile navigation

For many years, spatial range search has been applied to computational geometry and multimedia problems to find interest objects within a given radius. Range search query has traditionally been used to return all objects within a given radius. However, having all objects is not necessary, especially...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computing Ročník 95; číslo 10-11; s. 949 - 976
Hlavní autoři: AL-Khalidi, Haidar, Taniar, David, Safar, Maytham
Médium: Journal Article
Jazyk:angličtina
Vydáno: Vienna Springer Vienna 01.10.2013
Springer Nature B.V
Témata:
Algorithms
Approximation
Artificial Intelligence
Boundaries
Computer Appl. in Administrative Data Processing
Computer Communication Networks
Computer Science
Digital maps
Information Systems Applications (incl.Internet)
Minimization
Mobile communications networks
Multimedia
Navigation
Optimization
Queries
Restaurants
Searching
Software Engineering
Studies
Wireless networks
Secondary 68U35
Spatial databases
Primary 68P20
Approximate static range
Approximate continuous range
Query processing
ISSN:0010-485X, 1436-5057
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:For many years, spatial range search has been applied to computational geometry and multimedia problems to find interest objects within a given radius. Range search query has traditionally been used to return all objects within a given radius. However, having all objects is not necessary, especially when there are already enough objects closer to the query point. Furthermore, expanding the radius may give users better results, especially when there are a lot of objects just outside the search boundary. Therefore, in this paper, we focus on approximate range search, where the query results are approximate, rather than exact. We propose approximate static range search (ARS) which combines two approaches, namely (i) lowerbound approximate range search , and (ii) upperbound approximate range search . Using ARS , we are able to deliver a better performance, together with low false hit and reasonable false miss. We also extend ARS in the context of a continuous query setting, in which the query moves. This is particularly important in spatial databases as a mobile user who invokes the query is moving. In terms of continuous range search, the intention is to find split points—the locations where the query results will be updated. Accordingly, we propose two methods for approximate continuous range search , namely (i) range search minimization , and (ii) split points minimization . Our performance evaluation which compares our methods with the traditional continuous range search shows that our methods considerably reduce the number of split points, thereby improving overall performance.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0010-485X
1436-5057
DOI:10.1007/s00607-012-0219-7