DANTE: Data and Information Management Research at Nanyang Technological University
Abstract
The data management group at the Nanyang Technological University (dante) was founded in 2009 by the first author when the School of Computer Science and Engineering hired two young faculty members in this area. The group currently consists of three faculty members and more than twenty graduate students, research assistants, and postdocs. Our alumni include faculty members at the Chinese University of Hong Kong, National University of Singapore, University of New South Wales, and several researchers and engineers at Facebook, Google, eBay, Huawei, and other technology companies. The group's major funding is from the Ministry of Education in Singapore, National Research Foundation, and companies such as Huawei.
References
[1]
S. S. Bhowmick, B.-S. Seah. Summarizing Biological Networks. Springer Verlag, May 2017.
[2]
S. S. Bhowmick, A. Sun, B. Q. Truong. Why Not, WINE?: Towards Answering Why-Not Questions in Social Image Search. In ACM MM, 2013.
[3]
S.S. Bhowmick, H.-E. Chua, B. Choi, C. Dyreson. ViSual: Simulation of Visual Subgraph Query Formulation to Enable Automated Performance Benchmarking. IEEE TKDE 29(8), 2017.
[4]
X. Cao, L. Chen, G. Cong, X. Xiao. Keyword-aware Optimal Route Search. In PVLDB, 5(11), 2012.
[5]
X. Cao, G. Cong, T. Guo, C. S. Jensen, B. C. Ooi. Efficient Processing of Spatial Group Keyword Queries. ACM Trans. Database Syst., 40(2):13, 2015.
[6]
X. Cao, G. Cong, et al. Retrieving Regions of Interest for User Exploration. In PVLDB, 7(9), 2014.
[7]
A. Chapman and H. V. Jagadish. Why not?, In SIGMOD, 2009.
[8]
L. Chen, G. Cong, X. Cao. An Efficient Query Indexing Mechanism for Filtering Geo-textual Data. In SIGMOD, 2013.
[9]
L. Chen, G. Cong, et al. Temporal Spatial-keyword Top-k Publish/Subscribe. In ICDE, 2015.
[10]
Z. Chen, G. Cong, Z. Zhang, T. Z. J. Fu, L. Chen. Distributed Publish/Subscribe Query Processing on the Spatio-Textual Data Stream. In ICDE, 2017.
[11]
J. Cheng, Y. Ke, A. Fu, J. Xu Yu, L. Zhu. Finding Maximal Cliques in Massive Networks by H*-graph. In SIGMOD, 2010.
[12]
J. Cheng, et al. Fast Algorithms for Maximal Clique Enumeration with Limited Memory. In KDD, 2012.
[13]
J. Cheng, Y. Ke, S. Chu, M. T. ¨ Ozsu. Efficient Core Decomposition in Massive Networks. In ICDE, 2011.
[14]
J. Cheng, S. Huang, H. Wu, A. Fu. TF-Label: A Topological-folding Labeling scheme for Reachability Querying in a Large Graph. In SIGMOD, 2013.
[15]
J. Cheng, Y. Ke, S. Chu, C. Cheng. Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach. In SIGMOD, 2012.
[16]
J. Cheng, Y. Ke, et al. Fast Graph Query Processing with a Low-cost Index. In VLDB J. 20(4), 2011.
[17]
Shumo Chu, James Cheng. Triangle listing in Massive Networks. In TKDD, 6(4), 2012.
[18]
H. E. Chua, S.S. Bhowmick, L. Tucker-Kellogg. Synergistic Target Combination Prediction From Curated Signaling Networks: Machine Learning Meets Systems Biology and Pharmacology. Methods, Vol. 129, 2017.
[19]
C. Dwork. Differential Privacy. In ICALP, 2006.
[20]
K. Feng, G. Cong, S. S. Bhowmick, S. Ma. In Search of Influential Event Organizers in Online Social Networks. In SIGMOD, 2014.
[21]
K. Feng, G. Cong, S. S. Bhowmick, W.-C. Peng, C. Miao. Towards Best Region Search for Data Exploration. In SIGMOD, 2016.
[22]
K. Feng, T. Guo, G. Cong, S. S. Bhowmick, S. Ma. SURGE: Continuous Detection of Bursty Regions Over a Stream of Spatial Objects. In ICDE, 2018.
[23]
T. Guo, X. Cao, G. Cong. Efficient Algorithms for Answering the m-Closest Keywords Query. In SIGMOD, 2015.
[24]
T. Guo, X. Cao, G. Cong, J. Lu, X. Lin. Distributed Algorithms on Exact Personalized PageRank. In SIGMOD, 2017
[25]
K. Huang, S. S. Bhowmick, S. Zhou, B. Choi. PICASSO: Exploratory Search of Connected Subgraph Substructures in Graph Databases. PVLDB, 10(12), 2017.
[26]
H. H. Hung, S. S. Bhowmick, B. Q. Truong, B. Choi, S. Zhou. QUBLE: Towards Blending Interactive Visual Subgraph Search Queries on Large Networks. VLDB J. 23(3), 2014.
[27]
T. Ideker, T. Galitski, L. Hood. A New Approach to Decoding Life: Systems Biology. Annual review of genomics and human genetics, vol. 2, January 2001.
[28]
C. Jin, S. S. Bhowmick, X. Xiao, J. Cheng, B. Choi. Gblender: Towards Blending Visual Query Formulation and Query Processing in Graph Databases. In SIGMOD, 2010.
[29]
C. Jin, S. S. Bhowmick, et al. prague: A Practical Framework for Blending Visual Subgraph Query Formulation and Query Processing. In ICDE, 2012.
[30]
G. Kellaris, S. Papadopoulos, X. Xiao, D. Papadias. Differentially Private Event Sequences over Infinite Streams. In PVLDB, 7(12), 2014.
[31]
H. Kim, J. Lee, S. S. Bhowmick, W. S. Han, J. H. Lee, S. Ko, M. Jarrah. DualSim: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine. In SIGMOD, 2016.
[32]
X. Li, C. G. M. Snoek, M. Worring. Learning Social Tag Relevance by Neighbor Voting. IEEE Transactions on Multimedia, 11(7), 2009.
[33]
H. Li, S. S. Bhowmick, et al. GetReal: Towards Realistic Selection of Influence Maximization Strategies in Competitive Networks. In SIGMOD, 2015.
[34]
H. Li, S. S. Bhowmick, A. Sun. CASINO: Towards Conformity-aware Social Influence Analysis in Online Social Networks. In ACM CIKM, 2011.
[35]
H. Li, S. S. Bhowmick, A. Sun, J. Cui. Conformity-aware Influence Maximization in Online Social Networks. In VLDB J, 24(1), 2015.
[36]
W. Lin, X. Xiao, G. Ghinita. Large-scale Frequent Subgraph Mining in MapReduce. In ICDE, 2014.
[37]
W. Lin, X. Xiao, X. Xie, X. Li. Network Motif Discovery: A GPU Approach. In ICDE, 2015.
[38]
Y. Liu, B. Zheng, X. He, Z. Wei, X. Xiao, K. Zheng, J. Lu. ProbeSim: Scalable Single-Source and Top-k SimRank Computations on Dynamic Graphs. In PVLDB, 11(1), 2017
[39]
Y. Liu, J. Lu, H. Yang, X. Xiao, Z. Wei. Towards Maximum Independent Sets on Massive Graphs. In PVLDB, 8(13), 2015.
[40]
Z. Qin, T. Yu, Y. Yang, I. Khalil, X. Xiao, K. Ren. Generating Synthetic Decentralized Social Graphs with Local Differential Privacy. In CCS, 2017.
[41]
Z. Qin, Y. Yang, T. Yu, I. Khalil, X. Xiao, K. Ren. Heavy Hitter Estimation over Set-Valued Data with Local Differential Privacy. In CCS, 2016.
[42]
B. S. Seah, S. S. Bhowmick, and A. Sun. PRISM: Concept-preserving social image search results summarization. In ACM SIGIR, 2014.
[43]
B.-S. Seah, S. S. Bhowmick, et al. FUSE: Towards Multi-Level Functional Summarization of Protein Interaction Networks.In BCB, 2011.
[44]
Y. Song, H. E. Chua, S. S. Bhowmick, B. Choi, S. Zhou. BOOMER: Blending Visual Formulation and Processing of p-Homomorphic Queries on Large Networks. In ACM SIGMOD, 2018.
[45]
Y. Sun, J. Han, et al. PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks. In PVLDB, 4(11), 2011.
[46]
Y. Tang, X. Xiao, Y. Shi. Influence Maximization: Near-optimal Time Complexity meets Practical Efficiency. In SIGMOD, 2014.
[47]
Y. Tang, Y. Shi, X. Xiao. Influence Maximization in Near-Linear Time: A Martingale Approach. In SIGMOD, 2015
[48]
B. Tian, X. Xiao. SLING: A Near-Optimal Index Structure for SimRank. In SIGMOD, 2016.
[49]
Jia Wang, James Cheng. Truss Decomposition in Massive Networks. PVLDB 5(9): 812--823, 2012.
[50]
N. Wang, X. Xiao, et al. PrivSuper: A Superset-First Approach to Frequent Itemset Mining under Differential Privacy. In ICDE, 2017.
[51]
S. Wang, R. Yang, X. Xiao, Z. Wei, Y. Yang. FORA: Simple and Effective Approximate Single-Source Personalized PageRank. In SIGKDD, 2017
[52]
S. Wang, Y. Tang, X. Xiao, Y. Yang, Z. Li. HubPPR: Effective Indexing for Approximate Personalized PageRank. In PVLDB, 2016.
[53]
S. Wu, Leong H. U, S. S. Bhowmick, W. Gatterbauer. Conflict of Interest Declaration and Detection System in Heterogeneous Networks. In CIKM, 2017
[54]
S. Wu, Leong H. U, S. S. Bhowmick, W. Gatterbauer. PISTIS: A Conflict of Interest Declaration and Detection System for Peer Review Management. In SIGMOD, 2018.
[55]
J. Xu, Z. Zhang, X. Xiao, Y. Yang, G. Yu. Differentially Private Histogram Publication. In ICDE, 2012.
[56]
X. Xiao, G. Wang, J. Gehrke. Differential Privacy via Wavelet Transforms. In ICDE, 2010.
[57]
X. Xiao, G. Bender, M. Hay, J. Gehrke. iReduct: Differential Privacy with Reduced Relative Errors. In SIGMOD, 2011.
[58]
X. Xiao, Y. Tao, M. Chen. Optimal Random Perturbation at Multiple Privacy Levels. PVLDB, 2(1), 2009.
[59]
M. Xie, S. S. Bhowmick, G. Cong, Q. Wang. PANDA: Towards Partial Topology-based Search on Large Networks in a Single Machine. In VLDB J, 26(2), 2016.
[60]
Z. Xu, Y. Ke, Y. Wang, H. Cheng, J. Cheng. A Model-based approach to Attributed Graph Clustering. In SIGMOD, 2012.
[61]
B. Yao, F. Li, X. Xiao. Secure Nearest Neighbor Revisited. In ICDE, 2013
[62]
B. Yao, X. Xiao, F. Li, Y Wu. Dynamic Monitoring of Optimal Locations in Road Network Databases. In VLDB J., 23(5), 2014.
[63]
P. Yi, B. Choi, S. S. Bhowmick, J. Xu. AutoG: A Visual Query Autocompletion Framework for Graph Databases. In The VLDB Journal, 26(3), 2017.
[64]
G. Yuan, Z. Zhang, M. Winslett, X. Xiao, Y. Yang, Z. Hao. Optimizing Batch Linear Queries under Exact and Approximate Differential Privacy. ACM Trans. Database Syst., 40(2), 2015.
[65]
J. Zhang, G. Cormode, C. M. Procopiuc, D. Srivastava, X. Xiao. Private Release of Graph Statistics using Ladder Functions. In SIGMOD, 2015.
[66]
J. Zhang, G. Cormode, C. M. Procopiuc, D. Srivastava, X. Xiao. PrivBayes: Private Data Release via Bayesian Networks. In TODS, 42(4), 2017.
[67]
J. Zhang, X. Xiao, X. Xie. PrivTree: A Differentially Private Algorithm for Hierarchical Decompositions. In SIGMOD, 2016.
[68]
J. Zhang, Z. Zhang, X. Xiao, Y. Yang, M. Winslett. Functional Mechanism: Regression Analysis under Differential Privacy. In PVLDB, 5(11), 2012.
[69]
K. Zhao, L. Chen, G. Cong. Topic Exploration in Spatio-temporal Document Collections. In SIGMOD, 2016.
[70]
A. D. Zhu, W. Lin, S. Wang, X. Xiao. Reachability Queries on Large Dynamic Graphs: A Total Order Approach. In SIGMOD, 2014.
[71]
A. D. Zhu, X. Xiao, S. Wang, W. Lin. Efficient Single-source Shortest Path and Distance Queries on Large Graphs. In SIGKDD, 2013.
Recommendations
Dante's Inferno: Hell Awaits
SIGGRAPH '10: ACM SIGGRAPH 2010 Computer Animation FestivalLove knows no bounds and sometimes makes one do crazy things, even go through Hell. Drawn by his beloved Beatrice, Dante casts all fears aside and plunges deep into the fiery abyss battling every kind of evil imaginable on the way down.
RETRACTED ARTICLE: Educational reforms and internationalization of universities: evidence from major regions of the world
Internationalization of universities has become a worldwide phenomenon as global economic integration continues to make its way forcefully into the higher education. The objective of the study is to develop a model for internationalization of ...
An analysis of global research funding from subject field and funding agencies perspectives in the G9 countries
This study analyzed journal articles published by authors from the G9 countries (Canada, China, France, Germany, Italy, Japan, Russia, the United Kingdom, and the United States) to identify the distribution of research funding and funding agencies in ...
Comments
Information & Contributors
Information
Published In
Copyright © 2018 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 11 December 2018
Published in SIGMOD Volume 47, Issue 2
Check for updates
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 114Total Downloads
- Downloads (Last 12 months)7
- Downloads (Last 6 weeks)2
Reflects downloads up to 08 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in