期刊： PROCEEDINGS OF THE VLDB ENDOWMENT, 2021; 14 (6)
Interactive graph search leverages human intelligence to categorize target labels in a hierarchy, which is useful for image classification, product ca......
期刊： PROCEEDINGS OF THE VLDB ENDOWMENT, 2021; 14 (6)
Path-based solutions have been shown to be useful for various graph analysis tasks, such as link prediction and graph clustering. However, they are no......
期刊： PROCEEDINGS OF THE VLDB ENDOWMENT, 2021; 14 (9)
The ever-growing amount of dynamic graph data demands efficient techniques of incremental graph processing. However, incremental graph algorithms are ......
期刊： PROCEEDINGS OF THE VLDB ENDOWMENT, 2021; 14 (6)
Data confidentiality is one of the biggest concerns that hinders enterprise customers from moving their workloads to the cloud. Thanks to the trusted ......
期刊： PROCEEDINGS OF THE VLDB ENDOWMENT, 2021; 14 (8)
Indoor venues accommodate many people who collectively form crowds. Such crowds in turn influence people's routing choices, e.g., people may prefer to......
期刊： PROCEEDINGS OF THE VLDB ENDOWMENT, 2021; 14 (7)
Influence maximization (IM) is a fundamental task in social network analysis. Typically, IM aims at selecting a set of seeds for the network that infl......
期刊： PROCEEDINGS OF THE VLDB ENDOWMENT, 2021; 14 (7)
Given an undirected graph and a number of vertex groups, the group Steiner tree problem is to find a tree such that (i) this tree contains at least on......
期刊： PROCEEDINGS OF THE VLDB ENDOWMENT, 2021; 14 (8)
This paper studies how to catch duplicates, mismatches and conflicts in the same process. We adopt a class of entity enhancing rules that embed machin......
期刊： PROCEEDINGS OF THE VLDB ENDOWMENT, 2021; 14 (5)
Many modern data-oriented applications are built on top of distributed OLTP databases for both scalability and high availability. Such distributed dat......
期刊： PROCEEDINGS OF THE VLDB ENDOWMENT, 2021; 14 (6)
Despite the fact that GPUs and accelerators are more efficient in deep learning (DL), commercial clouds like Facebook and Amazon now heavily use CPUs ......
期刊： PROCEEDINGS OF THE VLDB ENDOWMENT, 2021; 14 (9)
Query optimizers rely on accurate cardinality estimation (CardEst) to produce good execution plans. The core problem of CardEst is how to model the ri......
期刊： PROCEEDINGS OF THE VLDB ENDOWMENT, 2021; 14 (6)
Searching a community containing a given query vertex in an online social network enjoys wide applications like recommendation, team organization, etc......
期刊： PROCEEDINGS OF THE VLDB ENDOWMENT, 2021; 14 (9)
Network kernel density visualization, or NKDV, has been extensively used to visualize spatial data points in various domains, including traffic accide......
期刊： PROCEEDINGS OF THE VLDB ENDOWMENT, 2021; 14 (7)
Real-world data is dirty, which causes serious problems in (supervised) machine learning (ML). The widely used practice in such scenario is to first r......
期刊： PROCEEDINGS OF THE VLDB ENDOWMENT, 2021; 14 (9)
The distance-generalized core, also called (k, h)-core, is defined as the maximal subgraph in which every vertex has at least k vertices at distance n......
