Results 21 to 30 of about 165,392 (160)
STE-based encrypted relational database scheme with reduced leakages
网络与信息安全学报Recently, the concept of partially precomputed indexing for Structured query language (SQL) join (PpSj), which was predicated on structured encryption, has been introduced.
SU Yuchen, MA Changshe
doaj +3 more sources
Distributed Similarity Queries in Metric Spaces
Data Science and Engineering, 2019 Similarity queries, including range queries and k nearest neighbor (kNN) queries, in metric spaces have applications in many areas such as multimedia retrieval, computational biology and location-based services.
Keyu Yang +5 more
doaj +1 more source
Accelerating spatial range queries [PDF]
Proceedings of the 16th International Conference on Extending Database Technology, 2013 It is increasingly common for domain scientists to use computational tools to build and simulate spatial models of the phenomena they are studying. The spatial models they build are more and more detailed as well as dense and are consequently difficult to manage with today's tools. A crucial problem when analyzing spatial models of increasing detail is
Alexandros Stougiannis +3 more
openaire +1 more source
Improved Range Minimum Queries
Journal of Discrete Algorithms, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Héctor Ferrada, Gonzalo Navarro 0001
openaire +4 more sources
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
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
Range Entropy Queries and Partitioning.
CoRR, 2023 Data partitioning that maximizes or minimizes Shannon entropy is a crucial subroutine in data compression, columnar storage, and cardinality estimation algorithms. These partition algorithms can be accelerated if we have a data structure to find the entropy in different subsets of data when the algorithm needs to decide what block to construct.
Krishnan, Sanjay, Sintos, Stavros
openaire +4 more sources
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
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
Spatiotemporal RDF Data Query Based on Subgraph Matching
ISPRS International Journal of Geo-Information, 2021 Resource Description Framework (RDF), as a standard metadata description framework proposed by the World Wide Web Consortium (W3C), is suitable for modeling and querying Web data.
Xiangfu Meng +3 more
doaj +1 more source