Results 111 to 120 of about 165,392 (160)
Some of the next articles are maybe not open access.
Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018
The range skyline query retrieves the dynamic skyline for every individual query point in a range by generalizing the point-based dynamic skyline query. Its wide-ranging applications enable users to submit their preferences within an interval of 'ideally sought' values across every dimension, instead of being limited to submit their preference in ...
Theodoros Tzouramanis +3 more
openaire +2 more sources
The range skyline query retrieves the dynamic skyline for every individual query point in a range by generalizing the point-based dynamic skyline query. Its wide-ranging applications enable users to submit their preferences within an interval of 'ideally sought' values across every dimension, instead of being limited to submit their preference in ...
Theodoros Tzouramanis +3 more
openaire +2 more sources
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 ...
Dik Lun Lee, Haibo Hu
exaly +3 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 ...
Dik Lun Lee, Haibo Hu
exaly +3 more sources
Maintenance of Range Skyline Query
2020 IEEE International Conference on Knowledge Graph (ICKG), 2020Skyline query has attracted much attention from the data management community. It is widely used in many practical applications, such as multi-criteria decision-making, product recommendations, and decision analysis. The range skyline query retrieves skyline results for each query point in the specified range, which means that users can set their ideal
Xiaoxue Li +3 more
openaire +2 more sources
Are window queries representative for arbitrary range queries?
Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, 1996In this paper, we characterize the eciency of spatial access structures in terms of the expected number of data bucket accesses needed to perform a range query. We derive performance formulas for various kinds of range queries like intersection, containment, and enclosure queries with dierent geometric shapes.
Bernd-Uwe Pagel, Hans-Werner Six
openaire +2 more sources
2013
Efficient correlation computation has been an active research area of data mining. Given a large dataset and a specified query item, we are interested in finding items in the dataset that are within certain range of correlation with the query item. Such a problem, known as the correlation range query (CRQ), has been a common task in many application ...
Wenjun Zhou 0001, Hao Zhang 0011
openaire +2 more sources
Efficient correlation computation has been an active research area of data mining. Given a large dataset and a specified query item, we are interested in finding items in the dataset that are within certain range of correlation with the query item. Such a problem, known as the correlation range query (CRQ), has been a common task in many application ...
Wenjun Zhou 0001, Hao Zhang 0011
openaire +2 more sources
A Concise Representation of Range Queries
2009 IEEE 25th International Conference on Data Engineering, 2009With the advance of wireless communication technology, it is quite common for people to view maps or get related services from the handheld devices, such as mobile phones and PDAs. Range queries, as one of the most commonly used tools, are often posed by the users to retrieve needful information from a spatial database.
Ke Yi 0001 +3 more
openaire +2 more sources
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