Results 31 to 40 of about 165,392 (160)

Set-Difference Range Queries

open access: yesCoRR, 2013
We introduce the problem of performing set-difference range queries, where answers to queries are set-theoretic symmetric differences between sets of items in two geometric ranges. We describe a general framework for answering such queries based on a novel use of data-streaming sketches we call signed symmetric-difference sketches.
David Eppstein   +2 more
openaire   +4 more sources

VPRQ: Efficient verifiable privacy-preserving range query processing in two-tiered wireless sensor networks

open access: yesInternational Journal of Distributed Sensor Networks, 2016
In the field of wireless sensor networks, the secure range query technique is a challenging issue. In two-tiered wireless sensor networks, a verifiable privacy-preserving range query processing method is proposed that is based on bucket partition ...
Hua Dai   +5 more
doaj   +1 more source

CSRQ: Communication-Efficient Secure Range Queries in Two-Tiered Sensor Networks

open access: yesSensors, 2016
In recent years, we have seen many applications of secure query in two-tiered wireless sensor networks. Storage nodes are responsible for storing data from nearby sensor nodes and answering queries from Sink.
Hua Dai   +4 more
doaj   +1 more source

Efficient and Verifiable Range Query Scheme for Encrypted Geographical Information in Untrusted Cloud Environments

open access: yesISPRS International Journal of Geo-Information
With the rapid development of geo-positioning technologies, location-based services have become increasingly widespread. In the field of location-based services, range queries on geographical data have emerged as an important research topic, attracting ...
Zhuolin Mei   +7 more
doaj   +1 more source

Quadrant-Based Minimum Bounding Rectangle-Tree Indexing Method for Similarity Queries over Big Spatial Data in HBase

open access: yesSensors, 2018
With the rapid development of mobile devices and sensors, effective searching methods for big spatial data have recently received a significant amount of attention.
Bumjoon Jo, Sungwon Jung
doaj   +1 more source

Authentication of moving range queries [PDF]

open access: yesProceedings of the 21st ACM international conference on Information and knowledge management, 2012
A moving range query continuously reports the query result (e.g., restaurants) that are within radius $r$ from a moving query point (e.g., moving tourist). To minimize the communication cost with the mobile clients, a service provider that evaluates moving range queries also returns a safe region that bounds the validity of query results.
Duncan Yung, Eric Lo 0001, Man Lung Yiu
openaire   +1 more source

Distributed Efficient Similarity Search Mechanism in Wireless Sensor Networks

open access: yesSensors, 2015
The Wireless Sensor Network similarity search problem has received considerable research attention due to sensor hardware imprecision and environmental parameter variations. Most of the state-of-the-art distributed data centric storage (DCS) schemes lack
Khandakar Ahmed, Mark A. Gregory
doaj   +1 more source

A Probabilistic Range Query of Moving Objects in Road Network

open access: yesIEEE 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

Efficient Privacy-Preserving Range Query With Leakage Suppressed for Encrypted Data in Cloud-Based Internet of Things

open access: yesIEEE Access
Data owners are increasingly drawn to outsource their data due to the massive processing capabilities and scalable storage offered by cloud-based Internet of Things (IoT) solutions.
Sultan Basudan, Abdulrahman Alamer
doaj   +1 more source

Encoding Range Minimum Queries

open access: yesCoRR, 2013
We consider the problem of encoding range minimum queries (RMQs): given an array A[1..n] of distinct totally ordered values, to pre-process A and create a data structure that can answer the query RMQ(i,j), which returns the index containing the smallest element in A[i..j], without access to the array A at query time.
Pooya Davoodi   +3 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy