Results 221 to 230 of about 157,946 (258)
Some of the next articles are maybe not open access.
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 +1 more source
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 +1 more source
IEEE Transactions on Knowledge and Data Engineering, 2006
A range nearest-neighbor (RNN) query retrieves the nearest neighbor (NN) for every point in a range. It is a natural generalization of point and continuous nearest-neighbor queries and has many applications. In this paper, we consider the ranges as (hyper)rectangles and propose efficient in-memory processing and secondary memory pruning techniques for ...
Haibo Hu 0001, Dik Lun Lee
openaire +2 more sources
A range nearest-neighbor (RNN) query retrieves the nearest neighbor (NN) for every point in a range. It is a natural generalization of point and continuous nearest-neighbor queries and has many applications. In this paper, we consider the ranges as (hyper)rectangles and propose efficient in-memory processing and secondary memory pruning techniques for ...
Haibo Hu 0001, Dik Lun Lee
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 +1 more source
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 +1 more source
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 +1 more source
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 +1 more source
2015
The Range LCP problem is to preprocess a string $$S[1\dots n]$$, to enable efficient solutions of the following query: given a range [l,i¾źr] as the input, report $$\max _{i, j \in \{l,\ldots ,r\}} |\mathsf {LCP}S_{i}, S_j|$$. Here $$\mathsf {LCP}S_i, S_j$$ is the longest common prefix of the suffixes of S starting at locations i and j and $$|\mathsf ...
Amihood Amir +2 more
openaire +1 more source
The Range LCP problem is to preprocess a string $$S[1\dots n]$$, to enable efficient solutions of the following query: given a range [l,i¾źr] as the input, report $$\max _{i, j \in \{l,\ldots ,r\}} |\mathsf {LCP}S_{i}, S_j|$$. Here $$\mathsf {LCP}S_i, S_j$$ is the longest common prefix of the suffixes of S starting at locations i and j and $$|\mathsf ...
Amihood Amir +2 more
openaire +1 more source
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 +1 more source
Opportunistic Data Structures for Range Queries
Journal of Combinatorial Optimization, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chung Keung Poon, Wai Keung Yiu
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
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 +3 more sources