Results 41 to 50 of about 165,392 (160)
Encodings for Range Majority Queries [PDF]
, 2014 We face the problem of designing a data structure that can report the majority within any range of an array A[1,n], without storing A. We show that Ω(n) bits are necessary for such a data structure, and design a structure using O(nlog* n) bits that answers majority queries in O(logn) time. We extend our results to τ-majorities.
Gonzalo Navarro 0001 +1 more
openaire +2 more sources
Range minimum queries in minimal space [PDF]
Theoretical Computer Science, 2022 We consider the problem of computing a sequence of range minimum queries. We assume a sequence of commands that contains values and queries. Our goal is to quickly determine the minimum value that exists between the current position and a previous position $i$.
openaire +3 more sources
UDPLDP-Tree: Range Queries Under User-Distinguished Personalized Local Differential Privacy
InformationLocal Differential Privacy (LDP) and its personalized variants (PLDP) have been widely used for privacy-preserving data analytics. However, existing schemes often enforce a uniform indistinguishability level among users, failing to accommodate the ...
Dongli Deng, Sen Zhao, Meixia Miao
doaj +1 more source
Secure and Efficient Spatial Range Query Scheme over Multi-Type Encrypted Vector Data in the Cloud
Applied SciencesSecure and efficient spatial range query over encrypted outsourced vector data remains a challenging issue, particularly for polyline and polygon data.
Qi Yong +5 more
doaj +1 more source
FGBC-iDistance:fine-grained bit-code filter based high-dimensional index
Tongxin xuebao, 2017 In the high-dimensional vector retrieval,distance computation is a very time-consuming operation,the current research trend is to reduce the distance computation using divide and conquer algorithm.iDistance algorithm divides the vector space into ...
Xin-pan YUAN +4 more
doaj
Approximate Range Queries for Clustering
CoRR, 2018 We study the approximate range searching for three variants of the clustering problem with a set $P$ of $n$ points in $d$-dimensional Euclidean space and axis-parallel rectangular range queries: the $k$-median, $k$-means, and $k$-center range-clustering query problems.
Eunjin Oh 0001, Hee-Kap Ahn
openaire +5 more sources
Range-Max Queries on Uncertain Data [PDF]
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pankaj K. Agarwal +3 more
openaire +4 more sources
Approximate Range Mode and Range Median Queries [PDF]
, 2005 We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is the mode or median label in the sequence of labels between indices i and j. Our results are on approximate versions of this problem.
Prosenjit Bose +3 more
openaire +1 more source
Software: Practice and Experience, 2018 SummaryRange minimum query is an important building brick of many compressed data structures and string matching algorithms. Although this problem is essentially solved in theory, with sophisticated data structures allowing for constant time queries, practical performance and construction time also matter.
Tomasz Marek Kowalski, Szymon Grabowski
openaire +2 more sources
New construction of secure range query on encrypted data in cloud computing
Tongxin xuebao, 2015 To solve the information leakage problem resulting from several assertions of previous range query solutions,there is a secure range query scheme with one assertion (SRQSAE scheme),and the scheme is claimed to be secure against ciphertext-only attack.The
Shao-hui WANG +3 more
doaj +2 more sources