Results 11 to 20 of about 157,946 (258)
Compressed range minimum queries [PDF]
Theoretical Computer Science, 2020 Given a string $S$ of $n$ integers in $[0,σ)$, a range minimum query RMQ$(i, j)$ asks for the index of the smallest integer in $S[i \dots j]$. It is well known that the problem can be solved with a succinct data structure of size $2n + o(n)$ and constant query-time.
Pawel Gawrychowski +3 more
openaire +3 more sources
CoRR, 2023 We study the query version of the approximate heavy hitter and quantile problems. In the former problem, the input is a parameter $\varepsilon$ and a set $P$ of $n$ points in $\mathbb{R}^d$ where each point is assigned a color from a set $C$, and we want to build a structure s.t.
Peyman Afshani +3 more
openaire +4 more sources
Synchronised Range Queries [PDF]
2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications, 2009 In this paper, we present and evaluate a system for performing logical-time synchronised Range Queries over data in the context of parallel and distributed simulations of Multi-Agent Systems (MAS). MAS are often extremely complex and simulation is commonly used to understand their behaviour or investigate the implications of alternative agent ...
Vinoth Suryanarayanan +2 more
openaire +1 more source
Range queries on uncertain data [PDF]
Theoretical Computer Science, 2014 Given a set $P$ of $n$ uncertain points on the real line, each represented by its one-dimensional probability density function, we consider the problem of building data structures on $P$ to answer range queries of the following three types for any query interval $I$: (1) top-$1$ query: find the point in $P$ that lies in $I$ with the highest probability,
Jian Li 0015, Haitao Wang 0001
openaire +3 more sources
Partitioning Space for Range Queries [PDF]
SIAM Journal on Computing, 1989 The authors consider a database with a multidimensional key \((k_ 1,...,k_ d)\). By making clever use of the Borsuk-Ulam theorem (or the ham-sandwich-theorem) they show that given n points in \({\mathbb{R}}^ 3\), there exist three planes such that at most n/8 points lie in each of the eight open octants defined by the planes.
F. Frances Yao +3 more
openaire +1 more source
Efficient Evaluation of Arbitrary Relational Calculus Queries [PDF]
Logical Methods in Computer Science, 2023 The relational calculus (RC) is a concise, declarative query language. However, existing RC query evaluation approaches are inefficient and often deviate from established algorithms based on finite tables used in database management systems.
Martin Raszyk +3 more
doaj +1 more source
A Hierarchical Spatial Network Index for Arbitrarily Distributed Spatial Objects
ISPRS International Journal of Geo-Information, 2021 The range query is one of the most important query types in spatial data processing. Geographic information systems use it to find spatial objects within a user-specified range, and it supports data mining tasks, such as density-based clustering. In many
Xiangqiang Min +3 more
doaj +1 more source
Range Query Method Based on Compressed HMAC Algorithm for Sensor Networks [PDF]
Jisuanji gongcheng, 2021 Traditional range query methods are mainly aimed at one-dimensional data, and require more uploaded information at perception nodes, resulting in high energy consumption.Therefore, a multi-dimensional data range query method for two-layer wireless sensor
HU Qiaomu, DENG Yun
doaj +1 more source
A Secure and Efficient Privacy-Preserving Range Query Scheme in Location-Based Services
IEEE Access, 2018 With the rapid development of wireless communications and mobile devices with location capability, location-based services (LBS) have been extensively used in almost all social and business domains.
Zhisheng Huang +4 more
doaj +1 more source