2010
DOI: 10.1145/1670679.1670682
|View full text |Cite
|
Sign up to set email alerts
|

Location-dependent query processing

Abstract: The continuous development of wireless networks and mobile devices has motivated an intense research in mobile data services. Some of these services provide the user with context-aware information. Specifically, location-based services and location-dependent queries have attracted a lot of interest.In this article, the existing literature in the field of location-dependent query processing is reviewed. The technological context (mobile computing) and support middleware (such as moving object databases and data… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 132 publications
(18 citation statements)
references
References 321 publications
(379 reference statements)
0
18
0
Order By: Relevance
“…The region consists of a polygon with a finite number of vertices, and it may be either convex or non-convex. There are existing algorithms for determining if a queried point (e.g., a footstep location) is within either a simple polygon (Shimrat, 1962) or a non-simple (i.e., self-intersecting) polygon (Chinn and Steenrod, 1966), and these became well-established first for computer graphics (Sutherland et al, 1974) and later in techniques for processing queries to geospatial databases (Jacox and Samet, 2007;Ilarri et al, 2010). When there is only one region of interest then a point either wholly inside the polygon or on a boundary line segment is treated as being in the region.…”
Section: Footstep Track Evaluation Modulementioning
confidence: 99%
“…The region consists of a polygon with a finite number of vertices, and it may be either convex or non-convex. There are existing algorithms for determining if a queried point (e.g., a footstep location) is within either a simple polygon (Shimrat, 1962) or a non-simple (i.e., self-intersecting) polygon (Chinn and Steenrod, 1966), and these became well-established first for computer graphics (Sutherland et al, 1974) and later in techniques for processing queries to geospatial databases (Jacox and Samet, 2007;Ilarri et al, 2010). When there is only one region of interest then a point either wholly inside the polygon or on a boundary line segment is treated as being in the region.…”
Section: Footstep Track Evaluation Modulementioning
confidence: 99%
“…LOQOMOTION LOQOMOTION [34] is a mobile agent-based architecture for distributed processing of continuous location-dependent queries that are issued by mobile users, which allows the retrieval of objects' locations and other interesting data. LOQOMOTION process queries on static and dynamically moving objects with respect to their location, whereas other approaches only focus on queries about static objects that are in the vicinity of a certain static or moving object, objects moving within a fixed region, etc.,.…”
Section: Kmentioning
confidence: 99%
“…Moving objects must update their location to the server according to a certain policy. Therefore these approaches cannot be used when it is not possible to set an update policy on the moving objects or when the objects do not explicitly communicate with the server [9]. Also their approach may overload the user devices and increase the wireless communication overheads.…”
Section: A Distributed Query Processingmentioning
confidence: 99%
“…But this scheme does not address the problem of range queries where the range of the query overlaps with neighboring cells, or partially out of the cell, especially when the mobile is at the edge of the outer cell. Also the data are served from the central server and so, the overhead in the central server is quite high [9]. To reduce the overhead in central server, several caching schemes have been proposed [5,11].…”
Section: Related Workmentioning
confidence: 99%