Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Woo Lam Kang"'
Publikováno v:
Scientific Programming, Vol 2018 (2018)
Apache Hadoop has been a popular parallel processing tool in the era of big data. While practitioners have rewritten many conventional analysis algorithms to make them customized to Hadoop, the issue of inefficient I/O in Hadoop-based programs has be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::38e6329e33032766224b014ffbcd3981
https://doaj.org/article/a54558e381844bdfb7dd5bf19cd6d3f0
https://doaj.org/article/a54558e381844bdfb7dd5bf19cd6d3f0
Publikováno v:
IEICE Transactions on Information and Systems. :444-447
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aaea55d31c9dcdc660e9c466342b02cf
https://doi.org/10.1587/transinf.2014edl8143
https://doi.org/10.1587/transinf.2014edl8143
Publikováno v:
IEICE Transactions on Information and Systems. :635-638
Bursty and out-of-order tuple arrivals complicate the process of determining contents and boundaries of sliding windows. To process windows over such streams efficiently, we need to address two issues regarding fast tuple insertion and disorder contr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe332a2b8b6eaf1310b877a430f8e157
https://doi.org/10.1587/transinf.e93.d.635
https://doi.org/10.1587/transinf.e93.d.635
Publikováno v:
IEICE Transactions on Information and Systems. :1787-1790
In this paper, we propose a predicate indexing method which handles equality and inequality tests separately. Our method uses a hash table for the equality test and a balanced binary search tree for the inequality test. Such a separate structure redu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47cdb7742f3040adba3860ea7e22da68
https://doi.org/10.1587/transinf.e92.d.1787
https://doi.org/10.1587/transinf.e92.d.1787
Publikováno v:
Computer Science and its Applications ISBN: 9783662454015
As in the conventional databases, an index can be used to improve performance in MapReduce when processing OLAP queries with it. Regarding this, Hadoop++ suggested Trojan index to reduce network I/O by storing a partitioned data and its index togethe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::61b8d2cfb49ee705082d142189e4f451
https://doi.org/10.1007/978-3-662-45402-2_111
https://doi.org/10.1007/978-3-662-45402-2_111
Publikováno v:
Computer Science and its Applications ISBN: 9783662454015
Google’s MapReduce has emerged as a popular framework for data-intensive computing. It is well-known by its elastic scalability and fine-grained fault tolerance. On the other hand, there are some debates in its efficiency. Especially, local and net
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0b6f90abc507431704ef53f744c8ca8
https://doi.org/10.1007/978-3-662-45402-2_141
https://doi.org/10.1007/978-3-662-45402-2_141
Publikováno v:
eScience
There are multiple data sources storing avian influenza virus information in Korea. Research on AI requires scientists to collect, integrate, share and analyze AI virus information from the data sources. Since the sources are heterogeneous, autonomou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fed16a98615a7f51e915701d6f75bff3
https://doi.org/10.1109/escience.2008.119
https://doi.org/10.1109/escience.2008.119