Results 21 to 30 of about 164,582 (257)
Query Optimization for Distributed Spatio-Temporal Sensing Data Processing
Sensors, 2022 The unprecedented development of Internet of Things (IoT) technology produces humongous amounts of spatio-temporal sensing data with various geometry types.
Xin Li +3 more
doaj +1 more source
Computing range skyline query on uncertain dimension [PDF]
, 2016 A user sometimes prefers to not be restricted when querying for information. Querying information within a range of search often provides a different perspective to user as opposed to a rigid search.
Ibrahim, Hamidah +10 more
core +1 more source
A Large Scale Code Resolution Service Network in the Internet of Things
Sensors, 2012 In the Internet of Things a code resolution service provides a discovery mechanism for a requester to obtain the information resources associated with a particular product code immediately.
Xiangzhan Yu +3 more
doaj +1 more source
Making Queries Tractable on Big Data with Preprocessing [PDF]
, 2013 A query class is traditionally considered tractable if there exists a polynomial-time (PTIME) algorithm to answer its queries. When it comes to big data, however, PTIME algorithms often become infeasible in practice.
Neven, Frank +6 more
core +1 more source
A KNN Dynamic Extended Query Strategy Based on GPU [PDF]
Jisuanji gongcheng, 2018 Traditional Graphics Processing Unit(GPU) executing PGrid index K-Nearest Neighbor(KNN) query method has problems such as large query granularity,redundant calculation,and unstable performance.Therefore,facing spatial KNN relation queries,a KNN query ...
TANG Jia,GONG Yili,LI Wenhai
doaj +1 more source
Finding pairwise intersections inside a query range [PDF]
, 2017 We study the following problem: preprocess a set O of objects into a data structure that allows us to efficiently report all pairs of objects from O that intersect inside an axis-aligned query range Q .
Mark de Berg +8 more
core +1 more source
A VOMR-TREE BASED PARALLEL RANGE QUERY METHOD ON DISTRIBUTED SPATIAL DATABASE [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2012 Spatial index impacts upon the efficiency of spatial query seriously in distributed spatial database. In this paper, we introduce a parallel spatial range query algorithm, based on VoMR-tree index, which incorporates Voronoi diagrams into MR-tree ...
Z. Fu, Z. Fu, S. Liu
doaj +1 more source
Finding pairwise intersections inside a query range [PDF]
, 2015 We study the following problem: preprocess a set O of objects into a data structure that allows us to efficiently report all pairs of objects from O that intersect inside an axis-aligned query range Q. We present data structures of size $O(n({\rm polylog}
Mark de Berg +9 more
core +1 more source
Dynamic range query in spatial network environments
, 2006 Moving range queries over mobile objects are important in many location management applications. There have been quite a few research works in this area. However, all existing solutions assume an open space environment, which are either not applicable to
Kien A. Hua +5 more
core +2 more sources
A Probabilistic Range Query of Moving Objects in Road Network
IEEE Access, 2019 The range query of moving objects in a road network is widely used in battlefield environment, intelligent transportation systems, and mobile phone location. It has gradually become a research hotspot in the field of spatiotemporal data management.
Yaqing Shi +3 more
doaj +1 more source