default search action
Kongzhang Hao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c11]Yi Ding, Zhengyi Yang
, Shunyang Li, Liuyi Chen, Haoran Ning, Kongzhang Hao, Yongfei Liu:
FGAQ: Accelerating Graph Analytical Queries Using FPGA. APWeb/WAIM (5) 2024: 357-361 - [c10]Haoran Ning, Bocheng Han, Zhengyi Yang
Exploring Simple Architecture of Just-in-Time Compilation in Databases. APWeb/WAIM (5) 2024: 504-514 - [c9]Long Yuan, Kongzhang Hao, Xuemin Lin, Wenjie Zhang:
Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs. ICDE 2024: 2557-2569 - 2023
- [c8]Miao Ma, Zhengyi Yang
An Empirical Analysis of Just-in-Time Compilation in Modern Databases. ADC 2023: 227-240 - [c7]Kongzhang Hao, Long Yuan
Efficient and Scalable Distributed Graph Structural Clustering at Billion Scale. DASFAA (3) 2023: 234-251 - [c6]Linhan Zhang, Qian Chen, Wen Wang, Chong Deng, Xin Cao, Kongzhang Hao, Yuxin Jiang, Wei Wang:
Weighted Sampling for Masked Language Modeling. ICASSP 2023: 1-5 - [i6]Linhan Zhang, Qian Chen, Wen Wang, Chong Deng, Xin Cao, Kongzhang Hao, Yuxin Jiang, Wei Wang:
Weighted Sampling for Masked Language Modeling. CoRR abs/2302.14225 (2023) - [i5]Miao Ma, Zhengyi Yang
An Empirical Analysis of Just-in-Time Compilation in Modern Databases. CoRR abs/2311.04692 (2023) - [i4]Long Yuan
Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs. CoRR abs/2312.01424 (2023) - 2022
- [c5]Xia Li, Kongzhang Hao, Zhengyi Yang
Hop-Constrained s-t Simple Path Enumeration in Large Uncertain Graphs. ADC 2022: 115-127 - [c4]Xia Li, Kongzhang Hao, Zhengyi Yang
Hop-Constrained s-t Simple Path Enumeration in Billion-Scale Labelled Graphs. WISE 2022: 49-64 - 2021
- [j2]Kongzhang Hao, Long Yuan
Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale. Proc. VLDB Endow. 15(2): 169-182 (2021) - [c3]Zhengyi Yang
HUGE: An Efficient and Scalable Subgraph Enumeration System. SIGMOD Conference 2021: 2049-2062 - [i3]Zhengyi Yang, Longbin Lai, Xuemin Lin, Kongzhang Hao, Wenjie Zhang:
HUGE: An Efficient and Scalable Subgraph Enumeration System. CoRR abs/2103.14294 (2021) - 2020
- [c2]Kongzhang Hao, Longbin Lai:
Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query. SIGMOD Conference 2020: 2857-2859 - [i2]Lu Qin, Longbin Lai, Kongzhang Hao, Zhongxin Zhou, Yiwei Zhao, Yuxing Han, Xuemin Lin, Zhengping Qian, Jingren Zhou:
Taming the Expressiveness and Programmability of Graph Analytical Queries. CoRR abs/2004.09045 (2020)
2010 – 2019
- 2019
- [j1]Longbin Lai
Distributed Subgraph Matching on Timely Dataflow. Proc. VLDB Endow. 12(10): 1099-1112 (2019) - [c1]Kongzhang Hao, Zhengyi Yang
PatMat: A Distributed Pattern Matching Engine with Cypher. CIKM 2019: 2921-2924 - [i1]Longbin Lai, Zhu Qing, Zhengyi Yang, Xin Jin, Zhengmin Lai, Ran Wang, Kongzhang Hao, Xuemin Lin, Lu Qin, Wenjie Zhang, Ying Zhang, Zhengping Qian, Jingren Zhou:
A Survey and Experimental Analysis of Distributed Subgraph Matching. CoRR abs/1906.11518 (2019)
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-09-10 02:13 CEST 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: