default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSungchae Lim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c11]Junho Song
, Sungchae Lim, Sang-Wook Kim:
A novel join technique for similar-trend searches supporting normalization on time-series databases. SAC 2018: 481-486- 2017
- [j6]Kyo-Sung Jeong, Sungchae Lim, Kichun Lee, Sang-Wook Kim:
A flash-aware buffering scheme with the on-the-fly redo for efficient data management in flash storage. Comput. Sci. Inf. Syst. 14(2): 369-392 (2017) - 2015
- [j5]Chang-Sup Park, Sungchae Lim:
Efficient processing of keyword queries over graph databases for finding effective answers. Inf. Process. Manag. 51(1): 42-57 (2015) - [c10]Kyo-Sung Jeong, Sang-Wook Kim, Sungchae Lim:
A Flash-aware Buffering Scheme using On-the-fly Redo. CIKM 2015: 1683-1686 - 2014
- [j4]Chang-Sup Park, Sungchae Lim:
Effective keyword query processing with an extended answer structure in large graph databases. Int. J. Web Inf. Syst. 10(1): 65-84 (2014) - 2010
- [j3]Sang-Wook Kim, Min-Hee Jang, Sungchae Lim:
Active Adjustment: An Effective Method for Keeping the TPR*-tree Compact. J. Inf. Sci. Eng. 26(5): 1583-1600 (2010)
2000 – 2009
- 2009
- [c9]Sungchae Lim:
A New Distiributed Checkpointing Scheme for the Mobile Computing Environment. RIVF 2009: 1-4 - 2008
- [c8]Sungchae Lim, Joonseon Ahn:
A Hierarchical Cache Scheme for the Large-scale Web Search Engine. SNPD 2008: 925-930 - 2007
- [c7]Sang-Wook Kim, Min-Hee Jang, Sungchae Lim:
Active Adjustment: An Approach for Improving the Performance of the TPR*-Tree. DEXA 2007: 834-843 - 2006
- [c6]Sungchae Lim:
The Dynamic Sweep Scheme Using Slack Time in the Zoned Disk. DASFAA 2006: 404-419 - 2005
- [c5]Sungchae Lim:
A New Continuous Media Playback Scheme Using the On-Time Delivery Channel. IKE 2005: 178-184 - 2004
- [c4]Sungchae Lim:
Dynamic Expansion of Scheduling Periods in Scheme Sweep. PDPTA 2004: 1198-1203 - 2003
- [j2]Sungchae Lim, Myoung-Ho Kim:
Real-time disk scanning for timely retrieval of continuous media objects. Inf. Softw. Technol. 45(9): 547-558 (2003) - [c3]Sungchae Lim, Joonseon Ahn, Myoung-Ho Kim:
A Concurrent B-Tree Algorithm Using a Cooperative Locking Protocol. BNCOD 2003: 253-260 - 2002
- [j1]Sungchae Lim, Myoung-Ho Kim:
Restructuring the concurrent B+-tree with non-blocked search operations. Inf. Sci. 147(1-4): 123-142 (2002)
1990 – 1999
- 1999
- [c2]Sungchae Lim, Yoon-Joon Lee, Myoung-Ho Kim:
A Restructuring Method for the Concurrent B+-Tree Based on Semantic Consistency. DASFAA 1999: 229-236 - [c1]Sungchae Lim, Myoung-Ho Kim:
A Real-Time Prefetching Method for Continuous Media Playback. DEXA Workshop 1999: 889-893
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-04-25 05:58 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:
