Results 121 to 130 of about 165,392 (160)
Some of the next articles are maybe not open access.
2013
Array range queries are of current interest in the field of data structures. Given an array of numbers or arbitrary elements, the general array range query problem is to build a data structure that can efficiently answer queries of a given type stated in terms of an interval of the indices.
openaire +1 more source
Array range queries are of current interest in the field of data structures. Given an array of numbers or arbitrary elements, the general array range query problem is to build a data structure that can efficiently answer queries of a given type stated in terms of an interval of the indices.
openaire +1 more source
2012
There has been a renewal of interest in data structures for range extremum queries. In such problems, the input comprises N points, which are either elements of a d-dimensional matrix, that is, their coordinates are specified by the 1D submatrices they lie in (row and column indices for d = 2), or they are points in ℝ d .
openaire +2 more sources
There has been a renewal of interest in data structures for range extremum queries. In such problems, the input comprises N points, which are either elements of a d-dimensional matrix, that is, their coordinates are specified by the 1D submatrices they lie in (row and column indices for d = 2), or they are points in ℝ d .
openaire +2 more sources
Approximate Colored Range Queries
2005In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate sketching techniques on our framework, we obtained efficient data structures that provide approximate solutions to these problems. In addition, the framework can be employed
Ying Kit Lai +2 more
openaire +2 more sources
Uncertain Range Queries for Necklaces
2010 Eleventh International Conference on Mobile Data Management, 2010We address the problem of efficient processing of spatio-temporal range queries for moving objects whose whereabouts in time are not known exactly. The fundamental question tackled by such queries is, given a spatial region and a temporal interval, retrieve the objects that were inside the region during the given interval.
Goce Trajcevski +4 more
openaire +2 more sources
Algorithms for range-skyline queries
Proceedings of the 20th International Conference on Advances in Geographic Information Systems, 2012Let S be a set of n points in Rd where each point has t ≥ 1 real-valued attributes called features. A range-skyline query on S takes as input a query box q e Rd and returns the skyline of the points of q ∩ S, computed w.r.t. their features (not their coordinates in Rd).
Saladi Rahul, Ravi Janardan
openaire +2 more sources
Categorical range maxima queries
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2014Given an array A[1...n] of n distinct elements from the set {1, 2, ..., n} a range maximum query RMQ(a, b) returns the highest element in A[a...b] along with its position. In this paper, we study a generalization of this classical problem called Categorical Range Maxima Query (CRMQ) problem, in which each element A[i] in the array has an associated ...
Manish Patil +4 more
openaire +2 more sources
2013
Range LCP (longest common prefix) is an extension of the classical LCP problem and is defined as follows: Preprocess a string S[1...n] so that max a,b ∈ {i...j }LCP(S a , S b ) can be computed efficiently for the input i, j ∈ [1, n], where LCP(S a , S b ) is the length of the longest common prefix of the suffixes of S starting at locations a and b.
Manish Patil +2 more
openaire +2 more sources
Range LCP (longest common prefix) is an extension of the classical LCP problem and is defined as follows: Preprocess a string S[1...n] so that max a,b ∈ {i...j }LCP(S a , S b ) can be computed efficiently for the input i, j ∈ [1, n], where LCP(S a , S b ) is the length of the longest common prefix of the suffixes of S starting at locations a and b.
Manish Patil +2 more
openaire +2 more sources
VoRaQue: Range queries on Voronoi overlays
2008 IEEE Symposium on Computers and Communications, 2008This paper presents VoRaQue, a software layer supporting range queries on Voronoi P2P overlays. VoRaQue maps data in a 2-dimensional space. The P2P overlay is defined by links connecting nodes that are close in the 2-dimensional space and by a set of long-range links which guarantee a poly-logarithmic routing.
Michele Albano +3 more
openaire +4 more sources
Epsilon-nets and simplex range queries
Proceedings of the second annual symposium on Computational geometry - SCG '86, 1986The main problem may be described as follows: given a set of n points in d-dimensional Euclidean space, find a data structure that uses linear storage such that the number of points in any query half space can be determined in sublinear time \(O(n^{\alpha})\). A data structure with \(\alpha =d(d-1)/(d(d-1)+1)+\gamma\) for any \(\gamma >0\) is exhibited.
David Haussler, Emo Welzl
openaire +2 more sources
Monitoring Continual Range Queries
2004This paper provides an overview of a query indexing method, called VCR indexing, for monitoring continual range queries. A VCR-based query index enables fast matching of events against a large number of range predicates. We first describe VCR indexing for general event matching against a set of 2D range predicates.
Philip S. Yu +2 more
openaire +1 more source