000167838 001__ 167838
000167838 005__ 20260122161100.0
000167838 0247_ $$2doi$$a10.1016/j.pmcj.2016.12.006
000167838 0248_ $$2sideral$$a99660
000167838 037__ $$aART-2017-99660
000167838 041__ $$aeng
000167838 100__ $$0(orcid)0000-0003-4239-8785$$aBobed, C.$$uUniversidad de Zaragoza
000167838 245__ $$aProbabilistic location-dependent queries at different location granularities
000167838 260__ $$c2017
000167838 5060_ $$aAccess copy available to the general public$$fUnrestricted
000167838 5203_ $$aApproaches for the processing of location-dependent queries usually assume that the location data are expressed precisely, usually using GPS locations. However, this is unrealistic because positioning methods do not have a perfect accuracy (e.g., the positioning approach used in cellular networks handles only the cell where mobile users are located). Besides, users may need to express queries based on concepts of locations other than traditional GPS locations, which we call location granules. In this paper, we focus on location granule-based query processing (i.e., processing of queries with location granules) in situations where the location data available is imprecise, which we have called probabilistic location-dependent queries. For that purpose, we exploit the concept of uncertainty location granule, which represents the location uncertainty of an object. In particular, we tackle the problem of processing probabilistic inside (range) constraints. We analyze in detail how those constraints can be processed, taking into account both the existence of location uncertainty affecting the relevant objects and the location granularity specified. An extensive experimental evaluation shows the feasibility of the proposed probabilistic query processing approach and analyzes the advantages of using index structures to speed up the query processing.
000167838 536__ $$9info:eu-repo/grantAgreement/ES/MINECO/TIN2013-46238-C4-4-R
000167838 540__ $$9info:eu-repo/semantics/openAccess$$aby-nc-nd$$uhttps://creativecommons.org/licenses/by-nc-nd/4.0/deed.es
000167838 590__ $$a2.974$$b2017
000167838 591__ $$aCOMPUTER SCIENCE, INFORMATION SYSTEMS$$b33 / 148 = 0.223$$c2017$$dQ1$$eT1
000167838 591__ $$aTELECOMMUNICATIONS$$b27 / 87 = 0.31$$c2017$$dQ2$$eT1
000167838 592__ $$a0.368$$b2017
000167838 593__ $$aComputer Science (miscellaneous)$$c2017$$dQ2
000167838 593__ $$aApplied Mathematics$$c2017$$dQ3
000167838 655_4 $$ainfo:eu-repo/semantics/article$$vinfo:eu-repo/semantics/submittedVersion
000167838 700__ $$0(orcid)0000-0001-8531-353X$$aBernad, J.$$uUniversidad de Zaragoza
000167838 700__ $$0(orcid)0000-0002-7073-219X$$aIlarri, S.$$uUniversidad de Zaragoza
000167838 700__ $$0(orcid)0000-0002-7462-0080$$aMena, E.$$uUniversidad de Zaragoza
000167838 7102_ $$15007$$2570$$aUniversidad de Zaragoza$$bDpto. Informát.Ingenie.Sistms.$$cÁrea Lenguajes y Sistemas Inf.
000167838 773__ $$g39 (2017), 304-321$$pPERVASIVE AND MOBILE COMPUTING$$tPERVASIVE AND MOBILE COMPUTING$$x1574-1192
000167838 8564_ $$s883593$$uhttps://zaguan.unizar.es/record/167838/files/texto_completo.pdf$$yPreprint
000167838 8564_ $$s1546969$$uhttps://zaguan.unizar.es/record/167838/files/texto_completo.jpg?subformat=icon$$xicon$$yPreprint
000167838 909CO $$ooai:zaguan.unizar.es:167838$$particulos$$pdriver
000167838 951__ $$a2026-01-22-16:09:37
000167838 980__ $$aARTICLE