Results 1 to 10 of about 391,843 (171)

Reverse Spatial Visual Top- $k$ Query [PDF]

open access: yesIEEE Access, 2020
With the wide application of mobile Internet techniques an location-based services (LBS), massive multimedia data with geo-tags has been generated and collected.
Lei Zhu   +5 more
doaj   +3 more sources

Distributed top-k aggregation queries at large [PDF]

open access: yesDistributed and Parallel Databases, 2009
Top-k query processing is a fundamental building block for efficient ranking in a large number of applications. Efficiency is a central issue, especially for distributed settings, when the data is spread across different nodes in a network.
A. Marian   +16 more
core   +5 more sources

Top-K Collective Spatial Keyword Queries [PDF]

open access: yesIEEE Access, 2019
With the advent of a large number of spatial-textual data, collective spatial keyword queries have been widely studied in recent years. However, the collective spatial keyword query studied so far usually looks for only a set of objects. In addition, the
Danni Su   +4 more
doaj   +2 more sources

IO-Top-k: index-access optimized top-k query processing

open access: yes, 2006
Top-k query processing is an important building block for ranked retrieval, with applications ranging from text and data integration to distributed aggregation of network logs and sensor data. Top-k queries operate on index lists for a query's elementary
Bast, H.   +4 more
core   +3 more sources

Node Similarity Top-k Query Method with Probabilistic Walk Constraint in Large-Scale Dynamic Graphs [PDF]

open access: yesJisuanji gongcheng, 2021
The existing large-scale dynamic graphs node similarity Top-k query methods for large-scale graphs are inefficient and fail to adaptively update the query results when the graph changes dynamically,which leads to a reduction in the accuracy of query ...
CHEN Ze, DING Linlin, SONG Baoyan, WANG Junlu
doaj   +1 more source

Top-k Densest Subgraphs Search in Temporal Graphs [PDF]

open access: yesJisuanji kexue, 2021
The dense subgraph search problem is one of the most important graph analysis problems.It is widely used in many fields,such as the social user correlation analysis in social networks,the community discovery in the Web,etc.However,the current research ...
MU Cong-cong, WANG Yi-shu, YUAN Ye, QIAO Bai-you, MA Yu-liang
doaj   +1 more source

Improved Top-k Query Algorithm in Distributed Networks [PDF]

open access: yesJisuanji gongcheng, 2017
Existing Top-k query algorithms are mainly applied in the centralized relational database.However,the algorithms will cause huge communication costs and low efficiency in the distributed networks.In order to solve these problems,an improved Top-k Query ...
YANG Hao,LIN Xijun,QU Haipeng
doaj   +1 more source

Approximate distributed top-k queries [PDF]

open access: yesDistributed Computing, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Patt-Shamir, Boaz, Shafrir, Allon
openaire   +2 more sources

Securing top-k query processing in two-tiered sensor networks

open access: yesConnection Science, 2021
Integrity and privacy are two important secure matrices in cyber security. Due to the limited resources and computing capability of the sensor nodes, it is challenging to simultaneously satisfy these two matrices for top-k querying in two-tiered sensor ...
Xiaoyan Kui   +6 more
doaj   +1 more source

Top-k Spatial Preference Queries [PDF]

open access: yes2007 IEEE 23rd International Conference on Data Engineering, 2007
A spatial preference query ranks objects based on the qualities of features in their spatial neighborhood. For example, consider a real estate agency office that holds a database with available flats for lease. A customer may want to rank the flats with respect to the appropriateness of their location, defined after aggregating the qualities of other ...
Mamoulis, N, Vaitis, M, Dai, X, Yiu, ML
openaire   +2 more sources

Home - About - Disclaimer - Privacy