default search action
Dong-Joo Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c7]Tran Van Dai, Jingi Park, Dong-Joo Park:
A Novel Recovery Data Technique on MLC NAND Flash Memory. KSE 2019: 1-5 - 2018
- [j9]Van Phi Ho
, Dong-Joo Park:
WPCB-Tree: A Novel Flash-Aware B-Tree Index Using a Write Pattern Converter. Symmetry 10(1): 18 (2018) - 2015
- [j8]Tae-Sun Chung, Dong-Joo Park, Jongik Kim:
An Efficient Flash Translation Layer for Large Block NAND Flash Devices. J. Circuits Syst. Comput. 24(9): 1550138:1-1550138:22 (2015) - 2013
- [j7]Seong-Joong Kim, Dong-Joo Park:
A Self-Calibrated Localization System using Chirp Spread Spectrum in a Wireless Sensor Network. KSII Trans. Internet Inf. Syst. 7(2): 253-270 (2013) - 2011
- [j6]Dong-Joo Park, Dong-Ho Lee:
Spy-Tec+ : an Integrated Index Structure for k-Nearest Neighbor Queries with Semantic Predicates in Multimedia Database. Int. J. Softw. Eng. Knowl. Eng. 21(7): 989-1011 (2011) - [c6]Tae-Sun Chung, Dong-Joo Park, Jongik Kim:
LSTAFF*: an efficient flash translation layer for large block flash memory. SAC 2011: 589-594 - 2010
- [c5]Sungup Moon, Sang-Phil Lim, Dong-Joo Park, Sang-Won Lee:
Crash Recovery in FAST FTL. SEUS 2010: 13-22
2000 – 2009
- 2009
- [j5]Tae-Sun Chung, Dong-Joo Park, Sangwon Park, Dong-Ho Lee, Sang-Won Lee, Ha-Joo Song:
A survey of Flash Translation Layer. J. Syst. Archit. 55(5-6): 332-343 (2009) - 2007
- [j4]Sang-Won Lee, Dong-Joo Park, Tae-Sun Chung, Dong-Ho Lee, Sangwon Park, Ha-Joo Song:
A log buffer-based flash translation layer using fully-associative sector translation. ACM Trans. Embed. Comput. Syst. 6(3): 18 (2007) - 2006
- [c4]Tae-Sun Chung, Dong-Joo Park, Sangwon Park, Dong-Ho Lee, Sang-Won Lee, Ha-Joo Song:
System Software for Flash Memory: A Survey. EUC 2006: 394-404 - [c3]Sang-Won Lee, Won-Kyoung Choi, Dong-Joo Park:
FAST: An Efficient Flash Translation Layer for Flash Memory. EUC Workshops 2006: 879-887 - 2005
- [c2]Dong-Ho Lee, Dong-Joo Park:
An Efficient Incremental Nearest Neighbor Algorithm for Processing k-Nearest Neighbor Queries with Visal and Semantic Predicates in Multimedia Information Retrieval System. AIRS 2005: 653-658 - 2004
- [c1]Tae-Sun Chung, Dong-Joo Park, Yeonseung Ryu, Sugwon Hong:
LSTAFF: System Software for Large Block Flash Memory. AsiaSim 2004: 704-712 - 2003
- [j3]Dong-Joo Park, Hyoung-Joo Kim:
An Enhanced Technique for k-Nearest Neighbor Queries with Non-Spatial Selection Predicates. Multim. Tools Appl. 19(1): 79-103 (2003) - 2001
- [j2]Dong-Joo Park, Hyoung-Joo Kim:
Prefetch policies for large objects in a Web-enabled GIS application. Data Knowl. Eng. 37(1): 65-84 (2001) - [j1]Dong-Joo Park, Shin Heu, Hyoung-Joo Kim:
The RS-tree: An efficient data structure for distance browsing queries. Inf. Process. Lett. 80(4): 195-203 (2001)
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:56 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: