Results 21 to 30 of about 391,863 (191)

Encoding Two-Dimensional Range Top-k Queries [PDF]

open access: yesAlgorithmica, 2021
AbstractWe consider the problem of encoding two-dimensional arrays, whose elements come from a total order, for answering $${\text{Top-}}{k}$$ Top- k queries.
Seungbum Jo   +2 more
openaire   +5 more sources

Efficient Query Refinement for View Recommendation in Visual Data Exploration

open access: yesIEEE Access, 2021
The need for efficient and effective data exploration has resulted in several solutions that automatically recommend interesting visualizations. The main idea underlying those solutions is to automatically generate all possible views of data, and ...
Mohamed A. Sharaf, Humaira Ehsan
doaj   +1 more source

Top- $k$ Subgraph Query Based on Frequent Structure in Large-Scale Dynamic Graphs

open access: yesIEEE Access, 2018
Frequent structures have emerged as resolving the structural pattern mining issues, such as chemistry, Web applications, and other related problems.
Xiaohuan Shan   +4 more
doaj   +1 more source

Top-k Edge Query Algorithm with Maximum Influence on Uncertain Graph [PDF]

open access: yesJisuanji gongcheng, 2018
Recently,researches on uncertain graphs mostly ignore the influence of edges when information spreading to the networks,meanwhile these influential edges could settle with many practical problems by querying and applying to them.So that this paper ...
HU Yang,HUANG Jinjing,LIU Guangfu,ZHAO Lei
doaj   +1 more source

External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates [PDF]

open access: yes, 2016
An external memory data structure is presented for maintaining a dynamic set of N two-dimensional points under the insertion and deletion of points, and supporting unsorted 3-sided range reporting queries and top-k queries, where top-k queries report the

core   +1 more source

Processing top-k join queries [PDF]

open access: yesProceedings of the VLDB Endowment, 2010
We consider the problem of efficiently finding the top- k answers for join queries over web-accessible databases. Classical algorithms for finding top- k answers use branch-and-bound techniques to avoid computing scores of all candidates in identifying the top- k ...
Wu, Minji   +4 more
openaire   +2 more sources

An Efficient Top- $K$ Spatial Keyword Typicality and Semantic Query

open access: yesIEEE Access, 2019
Existing spatial keyword query processing models mainly consider the spatial proximity and text relevancy between spatial objects and spatial keyword query, which usually makes the top-k answer objects are similar to each other.
Xiaoyan Zhang   +4 more
doaj   +1 more source

Optimal algorithms for selecting top-k combinations of attributes : theory and applications [PDF]

open access: yes, 2017
Traditional top-k algorithms, e.g., TA and NRA, have been successfully applied in many areas such as information retrieval, data mining and databases.
Lin, Chunbin   +4 more
core   +1 more source

SFTopk: Secure Functional Top- $k$ Query via Untrusted Data Storage

open access: yesIEEE Access, 2015
Providing top-k query services is relevant for storage servers which collect valuable files/data and process queries for data owners and mobile users.
Yao-Tung Tsou   +3 more
doaj   +1 more source

Processing Spatial Keyword Query as a Top-k Aggregation Query [PDF]

open access: yes, 2014
We examine the spatial keyword search problem to retrieve objects of interest that are ranked based on both their spatial proximity to the query location as well as the textual relevance of the object’s keywords.
Abbar S.   +12 more
core   +2 more sources

Home - About - Disclaimer - Privacy