Please use this identifier to cite or link to this item:
Title: Solving big data problems from sequences to tables and graphs
Keywords: Big Data Problems, Sequence Segmentation, Database Cracking, Adaptive Indexing, Maximum Flow, MapReduce
Issue Date: 20-Jun-2012
Source: FELIX HALIM (2012-06-20). Solving big data problems from sequences to tables and graphs. ScholarBank@NUS Repository.
Abstract: Big Data problems arise when the existing solutions become impractical to run because the amount of resources needed to process the ever increasing amount of data exceeds the available resources. Problems whose solutions consume more than a linear amount of resources will face the big data problem sooner. Thus, such problems that were considered solved need to be revisited in the context of big data. This thesis provides solutions to three big data problems that exists in different scales in terms of number of available resources and data size. In the limited scale such as sensor networks, we have the sequence segmentation problem. In desktop/server scale, we have database indexing problem. In cloud computing scale, we have large graph processing problem. We conclude that these seemingly unrelated problems share similar solution ideas such as the use of stochasticity, robustness property, exploitation of the inherent data properties, and algorithm-system optimizations.
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
thesis.pdf6.78 MBAdobe PDF



Page view(s)

checked on Jan 19, 2018


checked on Jan 19, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.