Results 11 to 20 of about 391,863 (191)
A novel top‐k key node query problem in subgraph matching and its greedy strategy
Top‐k node selection in graph data is an essential problem in computer science and applications. In view of an important issue in the field of graph data, subgraph matching issue, we define the problem and propose its method for the top‐k key node query ...
Zhengyuan Xue
doaj +1 more source
Ranking Large Temporal Data [PDF]
Ranking temporal data has not been studied until recently, even though ranking is an important operator (being promoted as a firstclass citizen) in database systems.
Jestes, Jeffrey +3 more
core +3 more sources
Diversifying Top-K Results [PDF]
Top-k query processing finds a list of k results that have largest scores w.r.t the user given query, with the assumption that all the k results are independent to each other.
Chang, Lijun, Qin, Lu, Yu, Jeffrey Xu
core +1 more source
Efficient Authentication of Multi-Dimensional Top-
With the increasing popularity of cloud computing, query outsourcing services are becoming widely available for many business applications. However, the third-party cloud server which provides query service is untrusted, and thus the correctness of query
Xiaoyu Zhu +4 more
doaj +1 more source
Top-k Queries over Digital Traces [PDF]
Recent advances in social and mobile technology have enabled an abundance of digital traces (in the form of mobile check-ins, association of mobile devices to specific WiFi hotspots, etc.) revealing the physical presence history of diverse sets of entities (e.g., humans, devices, and vehicles).
Li, Yifan, Yu, Xiaohui, Koudas, Nick
openaire +2 more sources
Top-k Window Aggregation Query Method for Uncertain Time Series [PDF]
The analysis and mining of uncertain time series data has attracted attention in various industries. Top-k queries, a popular research Topic in the database field, aim to retrieve the Top-k results that best match a user's query conditions from large ...
ZHANG Hang, XIONG Haoran, HE Zhenying
doaj +1 more source
Multi-dimensional top-k dominating queries [PDF]
The top-k dominating query returns k data objectswhich dominate the highest number of objects in adataset. This query is an important tool for decision supportsince it provides data analysts an intuitive way for findingsignificant objects. In addition, it combines the advantagesof top-k and skyline queries without sharing their disadvantages:(i) the ...
Mamoulis, N, Yiu, ML
openaire +4 more sources
Node Similarity Top-k Query of the Large-Scale Dynamic Graph With Weak Repeated Path Constraint
Node similarity Top-k query has always been a hot topic in the graph field. The existing node similarity Top-k query methods often need to traverse the whole graph, so its iterative calculation process is very inefficient on the large-scale graph ...
Wang Junlu, Song Yulong, Song Baoyan
doaj +1 more source
After the failure of the power system, a large amount of alarm information will flood into the dispatching terminal instantly. At the same time, there are inevitable problems, such as the abnormal operation of the protection and the circuit breaker, the ...
Lei Jin +3 more
doaj +1 more source
Image Retrieval Method Based on Fuzzy Color Features and Fuzzy Smiliarity [PDF]
The performance of content-based image retrieval(CBIR) system mainly depends on two key technologies:image feature extraction and image feature matching.In this paper,the color features of all the images are extracted,and an appropriate fuzzy algorithm ...
WANG Chun-jing, LIU Li, TAN Yan-yan, ZHANG Hua-xiang
doaj +1 more source

