Results 51 to 60 of about 391,863 (191)
Asymptotically Optimal Encodings for Range Selection [PDF]
, 2014 We consider the problem of preprocessing an array A[1..n] to answer range selection and range top-k queries. Given a query interval [i..j] and a value k, the former query asks for the position of the k-th largest value in A[i..j], whereas the latter asks
Navarro, Gonzalo +2 more
core +1 more source
Fast Top-K Graph Similarity Search Via Representative Matrices
IEEE Access, 2018 Graph similarity search is a crucial problem in many applications, such as cheminformatics, data mining, and pattern recognition. Top-k graph similarity search aims to find the most similar k graphs to a query graph in graph databases.
Zhigang Sun, Hongwei Huo, Xiaoyang Chen
doaj +1 more source
Crowdsourcing for Top-K Query Processing over Uncertain Data [PDF]
, 2016 Querying uncertain data has become a prominent application due to the proliferation of user-generated content from social media and of data streams from sensors.
Ciceri, Eleonora +3 more
core +2 more sources
MapReduce Algorithm for Variants of Skyline Queries: Skyband and Dominating Queries
Algorithms, 2019 The skyline query and its variant queries are useful functions in the early stages of a knowledge-discovery processes. The skyline query and its variant queries select a set of important objects, which are better than other common objects in the dataset.
Md. Anisuzzaman Siddique +3 more
doaj +1 more source
Forbidden Extension Queries [PDF]
, 2015 Document retrieval is one of the most fundamental problem in information retrieval. The objective is to retrieve all documents from a document collection that are relevant to an input pattern.
Biswas, Sudip +3 more
core +1 more source
Joint Top-K Spatial Keyword Query Processing [PDF]
IEEE Transactions on Knowledge and Data Engineering, 2012 Web users and content are increasingly being geopositioned, and increased focus is being given to serving local content in response to web queries. This development calls for spatial keyword queries that take into account both the locations and textual descriptions of content.
Wu, Dingming +3 more
openaire +3 more sources
A Dynamic I/O-Efficient Structure for One-Dimensional Top-k Range Reporting
, 2014 We present a structure in external memory for "top-k range reporting", which uses linear space, answers a query in O(lg_B n + k/B) I/Os, and supports an update in O(lg_B n) amortized I/Os, where n is the input size, and B is the block size. This improves
Tao, Yufei
core +1 more source
Cleaning uncertain data for top-k queries [PDF]
, 2013 The information managed in emerging applications, such as sensor networks, location-based services, and data integration, is inherently imprecise. To handle data uncertainty, probabilistic databases have been recently developed.
Cheng, R +4 more
core +3 more sources
Towards a Top-K SPARQL Query Benchmark Generator [PDF]
, 2014 The research on optimization of top-k SPARQL query would largely benefit from the establishment of a benchmark that allows comparing different approaches.
Bozzon, Alessandro +3 more
core +3 more sources
Finding Top-k Dominance on Incomplete Big Data Using Map-Reduce Framework
, 2017 Incomplete data is one major kind of multi-dimensional dataset that has random-distributed missing nodes in its dimensions. It is very difficult to retrieve information from this type of dataset when it becomes huge. Finding top-k dominant values in this
Ezatpoor, Payam
core +1 more source