Search

Your search keyword '"He, Bingsheng"' showing total 1,127 results
Start Over Author "He, Bingsheng"

Refine your results

1,127 results on '"He, Bingsheng"'

164. MROrder: Flexible Job Ordering Optimization for Online MapReduce Workloads

Author

Tang, Shanjiang, Lee, Bu-Sung, He, Bingsheng, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Wolf, Felix, editor, Mohr, Bernd, editor, and an Mey, Dieter, editor

Published
2013
Full Text
View/download PDF

165. A Framework for Analyzing Monetary Cost of Database Systems in the Cloud

Author

Chen, Changbing, He, Bingsheng, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Wang, Jianyong, editor, Xiong, Hui, editor, Ishikawa, Yoshiharu, editor, Xu, Jianliang, editor, and Zhou, Junfeng, editor

Published
2013
Full Text
View/download PDF

166. Spectral Decomposition for Optimal Graph Index Prediction

Author

Song, Liyan, Peng, Yun, Choi, Byron, Xu, Jianliang, He, Bingsheng, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Pei, Jian, editor, Tseng, Vincent S., editor, Cao, Longbing, editor, Motoda, Hiroshi, editor, and Xu, Guandong, editor

Published
2013
Full Text
View/download PDF

167. GViewer: GPU-Accelerated Graph Visualization and Mining

Author

Zhong, Jianlong, He, Bingsheng, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Datta, Anwitaman, editor, Shulman, Stuart, editor, Zheng, Baihua, editor, Lin, Shou-De, editor, Sun, Aixin, editor, and Lim, Ee-Peng, editor

Published
2011
Full Text
View/download PDF

168. Spade

Author

Jiang, Jiaxin, primary, Li, Yuan, additional, He, Bingsheng, additional, Hooi, Bryan, additional, Chen, Jia, additional, and Kang, Johan Kok Zhi, additional

Published
2022
Full Text
View/download PDF

172. A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs

Author

Zhu, Linhong, Choi, Byron, He, Bingsheng, Yu, Jeffrey Xu, Ng, Wee Keong, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Zhou, Xiaofang, editor, Yokota, Haruo, editor, Deng, Ke, editor, and Liu, Qing, editor

Published
2009
Full Text
View/download PDF

173. A Quantitative Summary of XML Structures

Author

Lin, Zi, He, Bingsheng, Choi, Byron, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Embley, David W., editor, Olivé, Antoni, editor, and Ram, Sudha, editor

Published
2006
Full Text
View/download PDF

181. Stereotactic body radiation therapy (SBRT) increases anti-PD-1 antitumor activity by enhancing the tumor immune microenvironment in mice with metastatic hepatocellular carcinoma

Author

Xu, Ke, primary, Gu, Tao, additional, Su, Ke, additional, Guo, Lu, additional, Liu, Xin, additional, He, Bingsheng, additional, He, Jie, additional, Liu, Hanlin, additional, Xiao, Rui, additional, Chi, Hao, additional, Tang, Xue, additional, Ye, Qinni, additional, Zhou, Xue, additional, Liu, Yingpeng, additional, Xiong, Jie, additional, Wang, Pan, additional, Li, Han, additional, He, Kun, additional, and Han, Yunwei, additional

Published
2022
Full Text
View/download PDF

183. RapidFlow

Author

Sun, Shixuan, primary, Sun, Xibo, additional, He, Bingsheng, additional, and Luo, Qiong, additional

Published
2022
Full Text
View/download PDF

186. TDGraph

Author

Zhao, Jin, primary, Yang, Yun, additional, Zhang, Yu, additional, Liao, Xiaofei, additional, Gu, Lin, additional, He, Ligang, additional, He, Bingsheng, additional, Jin, Hai, additional, Liu, Haikun, additional, Jiang, Xinyu, additional, and Yu, Hui, additional

Published
2022
Full Text
View/download PDF

187. Accurate Emulation of Wireless Sensor Networks

Author

Wu, Hejun, Luo, Qiong, Zheng, Pei, He, Bingsheng, Ni, Lionel M., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Dough, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Jin, Hai, editor, Gao, Guang R., editor, Xu, Zhiwei, editor, and Chen, Hao, editor

Published
2004
Full Text
View/download PDF

188. The HKUST Frog Pond – A Case Study of Sensory Data Analysis

Author

Xue, Wenwei, He, Bingsheng, Wu, Hejun, Luo, Qiong, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Dough, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Jin, Hai, editor, Gao, Guang R., editor, Xu, Zhiwei, editor, and Chen, Hao, editor

Published
2004
Full Text
View/download PDF

189. An In-Depth Study of Continuous Subgraph Matching

Author

Sun, Xibo, Sun, Shixuan, Luo, Qiong, He, Bingsheng, Sun, Xibo, Sun, Shixuan, Luo, Qiong, and He, Bingsheng

Abstract

Continuous subgraph matching (CSM) algorithms find the occurrences of a given pattern on a stream of data graphs online. A number of incremental CSM algorithms have been proposed. However, a systematical study on these algorithms is missing to identify their advantages and disadvantages on a wide range of workloads. Therefore, we first propose to model CSM as incremental view maintenance (IVM) to capture the design space of existing algorithms. Then, we implement six representative CSM algorithms, including IncIsoMatch, SJ-Tree, Graphflow, IEDyn, TurboFlux, and SymBi, in a common framework based on IVM. We further conduct extensive experiments to evaluate the overall performance of competing algorithms as well as study the effectiveness of individual techniques to pinpoint the key factors leading to the performance differences. We obtain the following new insights into the performance: (1) existing algorithms start the search from an edge in the query graph that maps to an updated data edge, potentially leading to many invalid partial results; (2) all matching orders are based on simple heuristics, which appear ineffective at times; (3) index updates dominate the query time on some queries; and (4) the algorithm with constant delay enumeration bears significant index update cost. Consequently, no algorithm dominate the others in all cases. Therefore, we give a few recommendations based on our experiment results. In particular, the SymBi index is useful for sparse queries or long running queries. The matching orders of IEDyn and TurboFlux work well on tree queries, those of Graphflow on dense queries or when both query and data graphs are sparse, and otherwise, we recommend SymBi’s matching orders. © 2022, American Mathematical Society. All rights reserved.

Published
2022

190. RapidFlow: An Efficient Approach to Continuous Subgraph Matching

Author

Sun, Shixuan, Sun, Xibo, He, Bingsheng, Luo, Qiong, Sun, Shixuan, Sun, Xibo, He, Bingsheng, and Luo, Qiong

Abstract

Continuous subgraph matching (CSM) is an important building block in many real-time graph processing applications. Given a subgraph query Q and a data graph stream, a CSM algorithm reports the occurrences of Q in the stream. Speciffcally, when a new edge 4 arrives in the stream, existing CSM algorithms start from the inserted 4 in the current data graph G to search Q. However, this rigid matching order of always starting from 4 can lead to a massive number of partial results that will turn out futile. Also, if Q contains automorphisms, there will be a lot of redundant computation in the matching process. To address these two problems, we propose RapidFlow, an effiective approach to CSM. First, we design a query reduction technique, which reduces CSM to batch subgraph matching (BSM) where we enumerate all results in a region of G that will be affected by the update. The well-established BSM techniques can determine effiective matching orders, not necessarily starting from the newly inserted edge. Second, to eliminate redundant computation caused by automorphisms in Q, we propose dual matching, which leverages the duality of Q and G in the matching process. Extensive experiment results show that RapidFlow outperforms state-of-the-art algorithms, including TurboFlux and SymBi, by up to two orders of magnitude on various workloads. © 2022, VLDB Endowment. All rights reserved.

Published
2022

Catalog

Books, media, physical & digital resources
See catalog results