default search action
Yang Cao 0012
Person information
- affiliation (PhD 2016): University of Edinburgh, UK
- affiliation: Beihang University, China
Other persons with the same name
- Yang Cao — disambiguation page
- Yang Cao 0001
(aka: Young Cao) — Virginia Tech, Department of Computer Science, Blacksburg, VA, USA
- Yang Cao 0002
- Yang Cao 0003
- Yang Cao 0004
- Yang Cao 0005
- Yang Cao 0006
- Yang Cao 0007
- Yang Cao 0008 — Shanghai Jiao Tong University, MOE-Microsoft Key Laboratory for Intelligent Computing and Intelligent Systems, China
- Yang Cao 0009
- Yang Cao 0010
- Yang Cao 0011
- Yang Cao 0013 — Georgia Institute of Technology, School of Industrial and Systems Engineering, Atlanta, GA, USA
- Yang Cao 0014
- Yang Cao 0015
- Yang Cao 0016 — Dalian University of Technology, Faculty of Electronic Information and Electrical Engineering, China
- Yang Cao 0017 — Hong Kong University of Science and Technology
- Yang Cao 0018
- Yang Cao 0019
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Shuai An
Relative Keys: Putting Feature Explanation into Context. Proc. ACM Manag. Data 2(1): 8:1-8:28 (2024) - [j16]Shuai An
Counterfactual Explanation at Will, with Zero Privacy Leakage. Proc. ACM Manag. Data 2(3): 130 (2024) - 2023
- [j15]Yang Cao
Transaction Scheduling: From Conflicts to Runtime Conflicts. Proc. ACM Manag. Data 1(1): 26:1-26:26 (2023) - [j14]Jia Li, Wenyue Zhao, Nikos Ntarmos, Yang Cao
MITra: A Framework for Multi-Instance Graph Traversal. Proc. VLDB Endow. 16(10): 2551-2564 (2023) - [c15]Yang Cao
Extracting Graphs Properties with Semantic Joins. ICDE 2023: 2262-2275 - 2022
- [j13]Shuai An, Yang Cao
Making Cache Monotonic and Consistent. Proc. VLDB Endow. 16(4): 891-904 (2022) - [c14]Shuai An, Yang Cao
Competitive Consistent Caching for Transactions. ICDE 2022: 2154-2167 - 2020
- [j12]Yang Cao
Bounded Evaluation: Querying Big Data with Bounded Resources. Int. J. Autom. Comput. 17(4): 502-526 (2020) - [j11]Abdulhakim Ali Qahtan
Pattern Functional Dependencies for Data Cleaning. Proc. VLDB Endow. 13(5): 684-697 (2020) - [c13]Yang Cao
Querying Shared Data with Security Heterogeneity. SIGMOD Conference 2020: 575-585
2010 – 2019
- 2019
- [j10]Yang Cao
Block as a Value for SQL over NoSQL. Proc. VLDB Endow. 12(10): 1153-1166 (2019) - [c12]Abdulhakim Ali Qahtan, Nan Tang, Mourad Ouzzani, Yang Cao
ANMAT: Automatic Knowledge Discovery and Error Detection through Pattern Functional Dependencies. SIGMOD Conference 2019: 1977-1980 - 2018
- [j9]Wenfei Fan
From Think Parallel to Think Sequential. SIGMOD Rec. 47(1): 15-22 (2018) - [j8]Yang Cao, Wenfei Fan
Bounded Query Rewriting Using Views. ACM Trans. Database Syst. 43(1): 6:1-6:46 (2018) - [j7]Wenfei Fan
Parallelizing Sequential Graph Computations. ACM Trans. Database Syst. 43(4): 18:1-18:39 (2018) - 2017
- [j6]Yang Cao, Wenfei Fan
Virtual Network Mapping in Cloud Computing: A Graph Pattern Matching Approach. Comput. J. 60(3): 287-307 (2017) - [j5]Yang Cao, Wenfei Fan:
Data Driven Approximation with Bounded Resources. Proc. VLDB Endow. 10(9): 973-984 (2017) - [c11]Jia Li, Yang Cao, Shuai Ma:
Relaxing Graph Pattern Matching With Explanations. CIKM 2017: 1677-1686 - [c10]Wenfei Fan
Parallelizing Sequential Graph Computations. SIGMOD Conference 2017: 495-510 - [c9]Yang Cao, Wenfei Fan
BEAS: Bounded Evaluation of SQL Queries. SIGMOD Conference 2017: 1667-1670 - 2016
- [b1]Yang Cao:
Querying big data with bounded data access. University of Edinburgh, UK, 2016 - [c8]Jia Li, Yang Cao, Xudong Liu:
Approximating Graph Pattern Queries Using Views. CIKM 2016: 449-458 - [c7]Yang Cao, Wenfei Fan
Bounded Query Rewriting Using Views. PODS 2016: 107-119 - [c6]Yang Cao, Wenfei Fan
An Effective Syntax for Bounded Relational Queries. SIGMOD Conference 2016: 599-614 - 2015
- [c5]Yang Cao, Wenfei Fan
Virtual Network Mapping: A Graph Pattern Matching Approach. BICOD 2015: 49-61 - [c4]Yang Cao, Wenfei Fan
Making pattern queries bounded in big graphs. ICDE 2015: 161-172 - [c3]Wenfei Fan
Querying Big Data by Accessing Small Data. PODS 2015: 173-184 - 2014
- [j4]Yang Cao, Ting Deng, Wenfei Fan
On the data complexity of relative information completeness. Inf. Syst. 45: 18-34 (2014) - [j3]Yang Cao, Wenfei Fan, Tianyu Wo, Wenyuan Yu:
Bounded Conjunctive Queries. Proc. VLDB Endow. 7(12): 1231-1242 (2014) - [j2]Shuai Ma, Yang Cao, Wenfei Fan
Strong simulation: Capturing topology in graph pattern matching. ACM Trans. Database Syst. 39(1): 4:1-4:46 (2014) - 2013
- [c2]Yang Cao, Wenfei Fan
Determining the relative accuracy of attributes. SIGMOD Conference 2013: 565-576 - 2012
- [c1]Shuai Ma, Yang Cao, Jinpeng Huai, Tianyu Wo:
Distributed graph pattern matching. WWW 2012: 949-958 - [i1]Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tianyu Wo:
Capturing Topology in Graph Pattern Matching. CoRR abs/1201.0229 (2012) - 2011
- [j1]Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tianyu Wo:
Capturing Topology in Graph Pattern Matching. Proc. VLDB Endow. 5(4): 310-321 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-27 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: