default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXuemin Lin 0001
- > Home > Persons > Xuemin Lin 0001
Publications
- 2024
[c290]Yuanyuan Xu
, Wenjie Zhang, Ying Zhang, Maria E. Orlowska, Xuemin Lin:
TimeSGN: Scalable and Effective Temporal Graph Neural Network. ICDE 2024: 3297-3310- 2022
- [c255]Chenji Huang, Yixiang Fang, Xuemin Lin, Xin Cao, Wenjie Zhang, Maria E. Orlowska:
Estimating Node Importance Values in Heterogeneous Information Networks. ICDE 2022: 846-858 - 2021
- [j169]Yixing Yang, Yixiang Fang, Maria E. Orlowska, Wenjie Zhang, Xuemin Lin:
Efficient Bi-triangle Counting for Large Bipartite Networks. Proc. VLDB Endow. 14(6): 984-996 (2021) - 2003
- [j18]Chengfei Liu, Xuemin Lin, Maria E. Orlowska, Xiaofang Zhou:
Confirmation: increasing resource availability for transactional workflows. Inf. Sci. 153: 37-53 (2003) - 2001
- [c21]Chengfei Liu, Maria E. Orlowska, Xuemin Lin, Xiaofang Zhou:
Improving Backward Recovery in Workflow Systems. DASFAA 2001: 276-283 - 1999
- [c15]Chengfei Liu, Maria E. Orlowska, Xiaofang Zhou, Xuemin Lin:
Confirmation: A Solution for Non-Compensatability in Workflow Applications. ICDE 1999: 102 - [c13]Chengfei Liu, Xuemin Lin, Xiaofang Zhou, Maria E. Orlowska:
Building a Repository for Workflow Systems. TOOLS (31) 1999: 348-357 - 1996
- [j8]Xuemin Lin, Maria E. Orlowska:
An Optimal Voting Scheme for Minimizing the Overall Communication Cost in Replicated Data Management. J. Parallel Distributed Comput. 35(1): 97-103 (1996) - 1995
- [j6]Xuemin Lin, Maria E. Orlowska:
An Efficient Processing of a Chain Join with the Minimum Communication Cost in Distributed Database Systems. Distributed Parallel Databases 3(1): 69-83 (1995) - [j5]Xuemin Lin, Maria E. Orlowska:
An Integer Linear Programming Approach to Data Allocation with the Minimum Total Communication Cost in Distributed Database Systems. Inf. Sci. 85(1-3): 1-10 (1995) - [c6]Xuemin Lin, Maria E. Orlowska:
A Highly Fault-Tolerant Quorum Consensus Method for Managing Replicated Data. COCOON 1995: 171-180 - 1994
- [c5]Xuemin Lin, Maria E. Orlowska:
An Efficient Optimal Algorithm for Minimizing the Overall Communication Cost in Replicated Data Management. ISAAC 1994: 243-251 - 1993
- [j3]Xuemin Lin, Maria E. Orlowska, Yanchun Zhang:
A Graph Based Cluster Approach for Vertical Partitioning in Database Design. Data Knowl. Eng. 11(2): 151-169 (1993) - [c3]Xuemin Lin, Maria E. Orlowska, Yanchun Zhang:
On Data Allocation with the Minimum Overall Communication Costs in Distributed Database Design. ICCI 1993: 539-544
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.
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.
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.
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 2025-07-23 21:27 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:
