Towards Zero-Overhead Adaptive Indexing in Hadoop

Stefan Richter, Jorge-Arnulfo Quiane-Ruiz, Stefan Schuh, Jens DittrichInformation Systems Group

Saarland Universityhttp://infosys.cs.uni-saarland.de

ABSTRACTSeveral research works have focused on supporting index access inMapReduce systems. These works have allowed users to signifi-cantly speed up selective MapReduce jobs by orders of magnitude.However, all these proposals require users to create indexes up-front, which might be a difficult task in certain applications (suchas in scientific and social applications) where workloads are evolv-ing or hard to predict. To overcome this problem, we propose LIAH(Lazy Indexing and Adaptivity in Hadoop), a parallel, adaptive ap-proach for indexing at minimal costs for MapReduce systems. Themain idea of LIAH is to automatically and incrementally adaptto users’ workloads by creating clustered indexes on HDFS datablocks as a byproduct of executing MapReduce jobs. Besides dis-tributing indexing efforts over multiple computing nodes, LIAHalso parallelises indexing with both map tasks computation anddisk I/O. All this without any additional data copy in main memoryand with minimal synchronisation. The beauty of LIAH is that itpiggybacks index creation on map tasks, which read relevant datafrom disk to main memory anyways. Hence, LIAH does not intro-duce any additional read I/O-costs and exploit free CPU cycles. Asa result and in contrast to existing adaptive indexing works, LIAHhas a very low (or invisible) indexing overhead, usually for the veryfirst job. Still, LIAH can quickly converge to a complete index,i.e. all HDFS data blocks are indexed. Especially, LIAH can tradeearly job runtime improvements with fast complete index conver-gence. We compare LIAH with HAIL, a state-of-the-art indexingtechnique, as well as with standard Hadoop with respect to indexingoverhead and workload performance. In terms of indexing over-head, LIAH can completely index a dataset as a byproduct of onlyfour MapReduce jobs while incurring a low overhead of 11% overHAIL for the very first MapReduce job only. In terms of workloadperformance, our results show that LIAH outperforms Hadoop byup to a factor of 52 and HAIL by up to a factor of 24.

1. INTRODUCTIONIn recent years, a huge number of research works have focused

on improving the performance of Hadoop MapReduce [10, 12, 18,

22, 24]. In particular, several researchers have focused on sup-porting efficient index access in Hadoop [28, 25, 23]. Some ofthese works have improved the performance of selective MapRe-duce jobs by orders of magnitude. However, all these indexingapproaches have three main weaknesses. First, they require a highupfront cost or long idle times for index creation. Second, theycan support only one physical sort order (and hence one clusteredindex) per dataset. Third, they require users to have a good knowl-edge of the workload in order to choose the indexes to create.

Recently, we proposed HAIL [13] (Hadoop Aggressive IndexingLibrary) to solve the first two problems, i.e. high upfront index-ing costs and lack of supporting multiple sort orders. HAIL allowsusers to create multiple clustered indexes at upload time almost forfree. As a result, users can speed up their MapReduce jobs byalmost two orders of magnitude. But, this improvement only hap-pens if users create the right indexes when uploading their datasetsto HDFS. This means that, like traditional indexing techniques [15,8, 1, 6, 9, 28, 25, 12, 23], HAIL requires users to decide upfrontwhich indexes to create. Thus, HAIL as well as traditional index-ing techniques are not suitable for unpredictable or ever-evolvingworkloads [11]. In such scenarios, users often do not know whichindexes to create beforehand. Scientific applications and social net-works are a clear example of such use-cases [3].

1.1 MotivationLet us see through the eyes of a group of scientists, say Alice and

her colleagues, who want to analyse their daily experimental resultsusing Hadoop MapReduce. Basically, the experimental results arecollected in a large dataset (typically in the order of terabytes) con-taining many dozens of numeric attributes. To understand and in-terpret the experimental results, Alice and her colleagues navigatethrough the dataset according to the properties and correlations ofthe data [3]. The problem is that Alice and her colleagues typi-cally: (i) do not know the data access patterns in advance; (ii) havedifferent interests and hence cannot agree upon common selectioncriteria at data upload time; (iii) even if they agree which attributesto index at data upload time, they might end up filtering records ac-cording to values on different attributes. Therefore, HAIL (as wellas traditional indexing techniques) cannot help Alice and her col-leagues, because HAIL is still a static system that cannot adapt tochanges in query workloads.

One day Alice hears about adaptive indexing [19], where thegeneral idea is to create indexes as a side-effect of query process-ing. Adaptive indexing aims at creating indexes incrementally inorder to avoid high upfront index creation times. Alice is excitedabout the adaptive indexing idea since this could solve her (andher colleagues’) problem. However, Alice notices that she cannotapply existing adaptive indexing works [14, 19, 20, 16, 21, 17] inMapReduce systems for several reasons:

arX

iv:1

212.

3480

v1 [

cs.D

B]

14

Dec

201

2

First, these techniques aim at converging to a global index for anentire attribute, which requires sorting the attribute globally. There-fore, these techniques perform many data movements across theentire dataset. Doing this in MapReduce would hurt fault-toleranceas well as the performance of MapReduce jobs. This is because wewould have to move data across HDFS data blocks1 in sync withall their three physical data block replicas.

Second, even if Alice applied existing adaptive indexing tech-niques inside data blocks, these techniques would end up in manycostly I/O operations to move data on disk. This is because thesetechniques consider main-memory systems and thus do not factorin the I/O-cost for reading/writing data from/to disk. Only oneof these works [16] proposes an adaptive merging technique fordisk-based systems. However, applying this technique inside a datablock would not make sense in MapReduce since data blocks aretypically loaded entirely into main memory anyways when process-ing map tasks. One may think about applying adaptive mergingacross data blocks, but this would again hurt fault-tolerance andthe performance of MapReduce jobs as described above.

Third, these works focus on creating unclustered indexes inthe first place and hence it is only beneficial for highly selectivequeries. One of these works [20] introduced lazy tuple reorgan-isation in order to converge to clustered indexes. However, thistechnique needs several thousand queries to converge and its appli-cation in a disk-based system would again introduce a huge numberof expensive I/O operations.

Fourth, existing adaptive indexing approaches were mainly de-signed for single-node DBMSs. Therefore, applying these worksin a distributed parallel systems, like Hadoop MapReduce, wouldnot fully exploit the existing parallelism to distribute the indexingeffort across several computing nodes.

1.2 IdeaWe propose LIAH (Lazy Indexing and Adaptivity in Hadoop):

a lazy and adaptive indexing approach for parallel disk-based sys-tems, such as MapReduce. The main idea behind LIAH is to exploitthe existing MapReduce pipeline in order to build clustered indexesin a scalable, automatic, and almost invisible way as byproduct ofjob executions. For this, LIAH interprets incoming jobs as hintsabout what might be a worthwhile index. A salient feature of LIAHis that it piggybacks on job execution in such a way that no ad-ditional read I/O-cost is required for indexing purposes. In otherwords, LIAH only requires some additional I/O-cost for writingclustered indexes back to disk. This allows LIAH to quickly con-verge to a complete index, i.e. all HDFS data blocks are indexed,with a very low indexing overhead. Another interesting feature isthat LIAH stores a clustered index created at query processing timein an additional HDFS file, called pseudo data block replica. Infact, a pseudo data block replica is another logically indexed replicafor a given data block. Therefore, pseudo data block replicas allowus to support a different number of replicas for each data block,which is crucial for incremental indexing.

Like existing adaptive indexing works, LIAH distributes the in-dexing effort over several queries to avoid negatively impacting theperformance of an individual query. However, LIAH differs fromexisting adaptive indexing works in four major aspects:

First, LIAH focuses on block level clustered indexes. This meansthat LIAH creates one clustered index for each data block instead ofa single index per attribute. Consequently, LIAH reorders data onlyinside a data block, which preserves the fault-tolerance of Hadoop

1Henceforth, we refer to an HDFS data block simply as data block.

since data is never shuffle across data blocks. Second, LIAH paral-lelises the adaptive indexing effort across several computing nodesin order to limit the indexing overhead. Third, LIAH considersdisk-based systems and hence it factors in the cost of reading fromand writing to disk. LIAH completely sorts a data block once itreads the block from disk. This avoids future expensive I/O oper-ations for refining the index inside a data block. Still, LIAH doesnot sort all data blocks in one pass in order to avoid that a singleMapReduce job pays the high cost of index creation. Notice thatadaptive merging [16], which also considers disk based systems,is orthogonal to the focus of LIAH. While LIAH produces a set ofsorted partitions incrementally, adaptive merging aims at incremen-tally combining such sorted partitions. Fourth, LIAH creates clus-tered indexes rather than unclustered indexes. This allows LIAH tobenefit from index scans even for lowly selective jobs. Since LIAHstores datasets in PAX representation [2], creating clustered indexesalso allows LIAH to avoid expensive random read I/O operationsfor tuple reconstruction.

1.3 Research ChallengesThe approach followed by LIAH triggers a number of interesting

research challenges:

(1.) How can we change the job execution pipeline to create clus-tered indexes at job execution time? How to index big data incre-mentally in a disk-based system? How to minimise the impact ofindexing on job execution times? How to efficiently interleave dataprocessing with indexing? How to create several clustered indexesfor read-only data blocks at query time? How to support differ-ent number of replicas per data block? How will the job executionpipeline change for Alice and her colleagues?

(2.) How can we change Hadoop to exploit newly created clus-tered indexes? How to distribute the indexing effort efficiently byconsidering data-locality and index placement across computingnodes? How to schedule map tasks to efficiently process indexedand non-indexed data blocks without affecting failover? How willjobs change from the perspective of Alice and her colleagues?

1.4 ContributionsWe present LIAH, a lazy and adaptive indexing approach for

MapReduce systems. The main goal of LIAH is to minimise theimpact of indexing on job execution times. We make the followingfour contributions:(1.) We show how to effectively piggyback adaptive index creationon the existing MapReduce job execution pipeline. In particular,we show how to parallelise indexing with both the computation ofmap tasks and disk I/O. All this without any additional data copyin main memory and minimal synchronisation. A particularity ofour approach is that we always index a data block entirely, i.e. in asingle pass. As a result, LIAH not only allows map tasks of futurejobs to perform an index access, but it also frees them from costlyextra I/O operations for refining indexes.

(2.) We show how to efficiently process pseudo data block replicas,i.e. data block replicas containing a clustered index adaptively cre-ated by LIAH. The beauty of our approach is that it is completelyinvisible from the users’ perspective. LIAH takes care of perform-ing MapReduce jobs using normal data block replicas or pseudodata block replicas (or even both). Additionally, LIAH comes withits own scheduling policy, called LIAH Scheduling. The idea ofLIAH Scheduling is to balance the indexing effort across comput-ing nodes so as to limit the impact of indexing on job runtime. As aside effect of balancing the indexing effort, LIAH improves parallelindex access for future jobs as indexes are balanced across nodes.

(3.) We propose a set of indexing strategies that makes LIAH awareof the performance and the selectivity of MapReduce jobs. Wefirst present eager adaptive indexing, a technique that allows LIAHto quickly adapt to changes in users’ workloads at a low index-ing overhead. In particular, eager adaptive indexing allows LIAHto trade early job runtime improvements with fast complete indexconvergence. Next, we show how LIAH can decide which datablocks to index based on the selectivities of jobs. Then, we presentthe invisible projection technique that allows LIAH to efficientlycreate clustered indexes for jobs having different attribute projec-tions. Additionally, in Appendix A, we present a lazy projectiontechnique that allows LIAH to integrate an attribute into a clusteredindex only when the attribute is accessed by a job.

(4.) We present an extensive experimental comparison of LIAHwith Hadoop and HAIL [13]. We use two clusters, each havingdifferent types of CPU. A series of experiments shows the superi-ority of LIAH over both Hadoop and HAIL. In particular, our ex-perimental results demonstrate that LIAH quickly adapts to queryworkloads with a negligible indexing overhead. Our results alsoshow that LIAH has a low overhead over Hadoop and HAIL for thevery first job only: all the following jobs are faster in LIAH.

2. RELATED WORKOffline Indexing. Indexing is a crucial step in all majorDBMSs [15, 8, 1, 6, 9]. The overall idea behind all these ap-proaches is to analyze a query workload and decide which attributesto index based on these observations. Several research works havefocused on supporting index access in MapReduce workflows [28,25, 12, 23]. However, all these offline approaches have three bigdisadvantages. First, they incur a high upfront indexing cost thatseveral applications cannot afford (such as scientific applications).Second, they only create a single clustered index per dataset, whichis not suitable for query workloads having selection predicates ondifferent attributes. Third, they cannot adapt to changes in queryworkloads without the intervention of a DBA. Recently, we pro-posed HAIL [13] to solve the first two problems, but HAIL is anenhancement of the upload pipeline in HDFS. Therefore, HAIL stillcannot adapt to changes in the query workload. LIAH completesthe puzzle: it enhances the Hadoop MapReduce framework (andnot HDFS) in order to allow Hadoop to adapt to query workloads.Online Indexing. Tuning a database at upload time has becomeharder as query workloads become more dynamic and complex.Thus, different DBMSs started to use online tuning tools to attackthe problem of dynamic workloads [27, 4, 5, 26]. The idea is tocontinuously monitor the performance of the system and create (ordrop) indexes as soon as it is considered beneficial. Manimal [7,22] can be used as an online indexing approach for automaticallyoptimizing MapReduce jobs. The idea of Manimal is to generate aMapReduce job for index creation as soon as an incoming MapRe-duce job has a selection predicate on an unindexed attribute. Onlineindexing can then adapt to query workloads. However, online in-dexing techniques require to index a dataset completely in one pass.Therefore, online indexing techniques simply transfer the high costof index creation from upload time to query processing time.Adaptive Indexing. LIAH is inspired by database cracking [19],which aims at removing the high upfront cost barrier of index cre-ation. The main idea of database cracking is to start organisinga given attribute (i.e. to create an adaptive index on an attribute)when it receives for the first time a query with a selection predicateon that attribute. Thus, future incoming queries having predicateson the same attribute continue refining the adaptive index as longas finer granularity of key ranges is advantageous. Key ranges in

an adaptive index are disjoint, where keys in each key range areunsorted. Basically, adaptive indexing performs for each query onestep of quicksort using the selection predicates as pivot for par-titioning attributes. LIAH differs from adaptive indexing in fouraspects. First, LIAH creates a clustered index for each data blockand hence avoids any data shuffling across data blocks. This allowsLIAH to preserve Hadoop fault-tolerance. Second, LIAH consid-ers disk-based systems and thus it factors in the cost of reorganisingdata inside data blocks. Third, LIAH parallelises the indexing effortacross several computing nodes to minimise the indexing overhead.Fourth, LIAH focuses on creating clustered indexes instead of un-clustered indexes. A follow-up work [20] focuses on lazily aligningattributes to converge into a clustered index after a certain numberof queries. However, it considers a main memory system and hencedoes not factor in the I/O-cost for moving data many times on disk.Adaptive Merging. Another related work to LIAH is the adaptivemerging [16]. This approach uses standard B-trees to persist inter-mediate results during an external sort. Then, it only merges thosekey ranges that are relevant to queries. In other words, adaptivemerging incrementally performs external sort steps as a side effectof query processing. However, this approach cannot be applied di-rectly for MapReduce workflows for three reasons. First, like adap-tive indexing, this approach creates unclustered indexes. Second,merging data in MapReduce destroys Hadoop fault-tolerance andhurts the performance of MapReduce jobs. This is because adaptivemerging would require us to merge data from several data blocksinto one. Notice that, merging data inside a data block would notmake sense as a data block is typically loaded entirely into mainmemory by map tasks anyways. Third, it has an expensive initialstep to create the first sorted runs. Recently, a follow-up work usesadaptive indexing to reduce the cost of the initial step of adaptivemerging in main memory [21]. However, it considers main mem-ory systems and still has the first two problems.

To our knowledge, this work is the first research effort to proposean adaptive indexing solution suitable for MapReduce systems.

3. HAIL RECAPRecall that the main goal of LIAH is to keep the impact of index

creation on job runtime minimal. This is similar to the idea ofHAIL, which shows that indexing during HDFS upload is possiblewith basically no overhead. LIAH inherits this feature from HAILand exploits this feature for creating indexes at query processingtime. Hence, in the following, we briefly explain the data uploadand MapReduce job execution pipeline in HAIL. For details aboutHAIL or the Hadoop execution plan see [13] and [12], respectively.

3.1 Data Upload in HAILLike in Hadoop, in HAIL, the first step for a user is to upload her

dataset to HDFS. During the upload process, HAIL splits datasets(i.e. files) into data blocks (usually in the size of 64MB – 256MB).Then, for each data block, HAIL stores several replicas (three bydefault) on different nodes for fault tolerance and load balancingreasons. HAIL differs from Hadoop in two major aspects:

(1.) HAIL supports logical data block replication. In other words,HAIL can store the physical data block replicas for a given logi-cal data block in different physical layouts as long as they containlogically the same data. This follows the same principle as TrojanLayouts [24]. Notice that this is in contrast to Hadoop, which con-siders physical data block replication (i.e. all physical data blockreplicas of the same logical data block are byte-identical).

(2.) HAIL can create as many clustered indexes as data block repli-cas. This is possible as HAIL uses a logical data block replication

and thus HAIL can exploit different sort orders for each physicaldata block replica. As a result, users can configure the clustered in-dexes to create for their datasets. When uploading a dataset, HAILtransforms the dataset from textual row into binary PAX [2] rep-resentation and creates the clustered indexes as specified by users.Notice that, HAIL piggybacks index creation on the natural HDFSprocess of copying the data from disk to main memory. Since thisprocess is I/O-bound, HAIL can exploit unused CPU cycles to gen-erate the requested indexes with basically unnoticeable overhead.HAIL keeps detailed information about created indexes as indexheader of data block replicas. In particular, a HAIL data block con-tains: (i) a block header (containing the data length and attributeoffsets), (ii) an index header, (iii) the index data, and (iv) the datacontent. Additionally, HAIL establishes a mapping {block id →list<block replica info>} on the HDFS NameNode for query pro-cessing purposes. Notice that, the block replica info contains thenode storing the replica and the available indexes for that replica.

3.2 Job Execution in HAILExecuting MapReduce jobs in HAIL differs from Hadoop in

three aspects:

(1.) Users can annotate their map functions with selections andprojections in order to benefit from clustered indexes and the PAXrepresentation of data blocks.

(2.) In the splitting phase (HailSplitting), HAIL queries the HDFSNameNode to find out if there exists a matching index with respectto annotated selections of incoming MapReduce jobs. If a suitableindex exists, the HailSplitting policy forms input splits2 (HAIL In-putSplits) with several data block replicas that are stored on thesame node. This allows HAIL to schedule a single map task toone node and avoid the high overhead for initialising and finalis-ing map tasks. To not impact failover, one can limit the number ofdata blocks in a single HAIL InputSplit based on selectivities. Theidea is that processing an input split should not take longer thanperforming a full scan over a single data block. If no suitable indexexists, HAIL then falls back to Hadoop splitting by scheduling onemap task per data block.

(3.) A map task processes its HAIL InputSplit by reading only theprojected attributes. If a suitable index exists, the map task per-forms an index scan over its input split. Thus, HAIL usually dra-matically reduces the I/O-cost for selective jobs. If no suitable in-dex exists, HAIL falls back to full scan, but it still benefits from thePAX layout by reading only the required attributes.

It is worth noting that HAIL cannot benefit from its indexes if theselection predicate is on any unindexed attribute. This is becausethere is no way for HAIL to adapt to query workloads. LIAH over-comes this problem: it creates additional indexes at job runtimebased on the selection predicates of incoming jobs.

4. LIAHIn this section, we discuss the fundamentals of LIAH: an ap-

proach to efficiently support Lazy Indexing and Adaptivity inHadoop. The core idea of LIAH is to create missing but promisingindexes as byproducts of full scans in the map phase of MapReducejobs. Our concept is to piggyback on a procedure that is naturallyreading the relevant data from disk to main memory anyways. Thisallows LIAH to completely save the data read cost for adaptive in-dex creation. Another beauty of LIAH is that it builds clusteredindexes in parallel to the execution of map tasks. As map tasks are2An input split is the data unit processed by a map task.

Detail View of TaskTracker 5

Adaptive IndexerLIAH RecordReader

LIAHInputSplit

5m

Mapper

map(K, V) {...}

3

map block

process

1

Node 5 Node nNode 1

DataNode 5

Blk 42b

DataNode n

Blk 42c

DataNode 1NameNode

TaskTracker 1

...HDFS

MapReduce

...PseudoBlk 42

d

2 6

+Blk 42

a

read writeTaskTracker 5 TaskTracker n

Block 42Block MetadataIndex Metadata

Index0111010101...a0101101000...b1100101011...c0000000011...d

d

pass to indexer

Block 42Block MetadataIndex Metadata

Index a0000000101...a1101001101...b1010101101...c0111100111...d 4

7

register

Figure 1: LIAH pipeline.

usually I/O dominated, LIAH can then exploit under-utilised CPUcycles for index creation.

In the following, we first give a general overview of the LIAHpipeline in Section 4.1. Then, in Section 4.2, we focus on the in-ternal components for building and storing clustered indexes. InSection 4.3, we present how LIAH accesses the indexes created atjob runtime in a way that is transparent to the MapReduce job ex-ecution pipeline. Next, in Section 4.4, we discuss how to make theindexing overhead over MapReduce jobs almost invisible to users.Finally, in Section 4.5, we present LIAH Scheduling, which allowsus to balance index creation effort across all available nodes.

4.1 Job Execution PipelineLet us explain the job execution pipeline in LIAH with an exam-

ple. Assume Alice wants to analyse the experimental results of aset of experiments she ran. Recall that she collects the experimentalresults in a large dataset containing many numeric attributes. As-sume the fortunate case that Alice studies her dataset a little bit. Sheidentifies attributes a, b, and c as the most interesting search crite-ria for her MapReduce jobs. As HDFS uses a default replicationfactor of three, Alice decides to configure LIAH to create a clus-tered index on each of these three attributes at upload time. Thisis possible because LIAH inherits the index creation at upload timefeature from HAIL. Thus, as long as Alice sends jobs with selec-tion predicates on a, b, or c, LIAH can benefit from clustered indexscans. In these cases, LIAH behaves exactly as HAIL, i.e. maptasks perform an index scan in order to fetch only the qualifyingrecords from disk. However, as soon as Alice (or one of her col-leagues) sends a new job (say jobd) with a selection predicate on adifferent attribute (e.g. on attribute d.), LIAH cannot benefit fromindex scans anymore. In contrast to HAIL, LIAH takes this missedchances of index scans as hints on how to improve the repertoireof indexes for future jobs. LIAH piggybacks the creation of a clus-tered index over attribute d on the execution of jobd. Without anyloss of generality, we assume that jobd projects all attributes fromits input dataset. We will drop this assumption in Section 5.3.

Figure 1 illustrates the general workflow of how LIAH processesmap tasks of jobd when no suitable index is available. As soon asLIAH schedules a map task to a specific TaskTracker3, e.g. Task-Tracker 5, the LIAH RecordReader of the map task first reads themetadata (including HDFS paths, offsets, and index availability)from the LIAH InputSplit 1 . With this metadata, the LIAH Recor-dReader checks whether a suitable index is available for its inputdata block (say block42). As no index on attribute d is available,the LIAH RecordReader opens an input stream to the local replica3A Hadoop instance responsible to execute map and reduce tasks.

of block42 stored on DataNode 5. Then, the LIAH RecordReaderreads the metadata from the data block header to obtain the offsetsof the attributes required by jobd. Next, the LIAH RecordReader:(i) loads all the values of the required attributes from disk to mainmemory 2 ; (ii) reconstructs the records (as data blocks are in PAXrepresentation); (iii) feeds the map function with each record 3 .Here lies the beauty of LIAH: a data block that is a potential can-didate for indexing was completely transferred to main memory asa natural part of the job execution process. In addition to feedingthe entire block42 to the map function, LIAH can create a clusteredindex on attribute d to speed up future jobs. For this, the LIAHRecordReader passes block42 to the Adaptive Indexer as soon asthe map function finishes processing the data block 4 .4 The Adap-tive Indexer, in turn, sorts the data in block42 according to attributed, aligns other attributes through reordering, and creates a sparseclustered index as described in [13] 5 . Finally, the Adaptive In-dexer stores this index with a copy of block42 (sorted on attributed) as a pseudo data block replica 6 . Additionally, the AdaptiveIndexer registers the new created index for block42 with the HDFSNameNode 7 . In fact, the implementation of the LIAH pipeline in-volves some interesting technical challenges. We discuss the LIAHpipeline in more detail in the remainder of this section.

4.2 Adaptive IndexerSince LIAH is an automatic process that is not explicitly re-

quested by users, LIAH should not impose unexpectedly signifi-cant performance penalties on users’ jobs. Piggybacking adaptiveindexing on map tasks allows us to completely save the read I/O-cost. However, the indexing effort is shifted to query time. As aresult, any additional time involved in indexing will potentially addto the total runtime of MapReduce jobs. Therefore, the first concernof LIAH is: how to make adaptive index creation efficient?

To overcome this issue, the idea of LIAH is to run the mappingand indexing processes in parallel. However, interleaving map taskexecution with indexing bears the risk of race conditions betweenmap tasks and the Adaptive Indexer on the data block. In otherwords, the Adaptive Indexer might potentially reorder data insidea data block, while the map task is still concurrently reading thedata block. One might think about copying data blocks before in-dexing to deal with this issue. Nevertheless, this would entail theadditional runtime and memory overhead of copying such memorychunks. For this reason, LIAH does not interleave the mapping andindexing processes on the same data block. Instead, LIAH inter-leaves the indexing of a given data block (e.g. block42) with themapping phase of the succeeding data block (e.g. block43). Forthis, LIAH uses a producer-consumer pattern: a map task acts asproducer by offering a data block to the Adaptive Indexer, via abounded blocking queue, as soon as it finishes processing the datablock; in turn, the Adaptive Indexer is constantly consuming datablocks from this queue. As a result, LIAH can perfectly interleavemap tasks with indexing, except for the first and last data block toprocess in each node. It is worth noting that the queue exposed bythe Adaptive Indexer is allowed to reject data blocks in case a cer-tain limit of enqueued data blocks is exceeded. This prevents theAdaptive Indexer to run out of memory because of overload. Still,future MapReduce jobs with a selection predicate on the same at-tribute (i.e. on attribute d) can at their turn take care of indexingthe rejected data blocks. Once the Adaptive Indexer pulls a datablock from its queue, it processes the data block using two internal

4Notice that, all map tasks (even from different MapReduce jobs)running on the same node interact with the same Adaptive Indexerinstance. Hence, the Adaptive Indexer can end up by indexing datablocks from different MapReduce jobs at the same time.

Adaptive Indexer

Index Builder Daemon

Block 42

Index0111010101...a0101101000...b1100101011...c0000000011...d

d

Index Writer Daemon

Block 42Block MetadataIndex Metadata

Index a0000000101...a1101001101...b1010101101...c0111100111...d

Blocking Queue

offer take

Blocking Queue

put

1 5 7

8

1100101011...c0101101000...b0111010101...a

d 0000000011...Sort + PV

Reorder

Index d

0111100111...d

1101001101...b1010101101...c

0010011101...a

0➤23|1➤42|2➤7|…

Sparse Index

process

2

3

4

register

NameNode

Block 42Block MetadataIndex Metadata

Index0111010101...a0101101000...b1100101011...c0000000011...d

dtake

9

DataNode 5

Blk 42

aBlk 42

d

store

Pseudo

BLK 42DN1 : cDN5 : a, dDNn : b

6

Figure 2: Adaptive Indexer internals.

components: the Index Builder and the Index Writer. Figure 2 il-lustrates the pipeline of these two internal components, which wediscuss in the following.

4.2.1 Index BuilderThe Index Builder is a daemon thread that is responsible for cre-

ating sparse clustered indexes on data blocks in the data queue.With this aim, the Index Builder is constantly pulling one datablock after another from the data block queue 1 . Then, for eachdata block, the Index Builder starts with sorting the attribute col-umn to index (attribute d in our example) 2 . Additionally, theIndex Builder builds a mapping {old position→ new position}for all values as a permutation vector. After that, the Index Builderuses the permutation vector to reorder all other attributes in the of-fered data block 3 . Once the Index Builder finishes sorting theentire data block on attribute d, it builds a sparse clustered index onattribute d 4 . Then, the Index Builder passes the newly indexeddata block to the Index Writer 5 . The Index Builder also com-municates with the Index Writer via a blocking queue. This allowsLIAH to also parallelise indexing with the I/O process for storingnewly indexed data blocks.

4.2.2 Index WriterThe Index Writer is a daemon thread that is responsible for per-

sisting indexes created by the Index Builder to disk. The IndexWriter continuously pulls newly indexed data blocks from its queuein order to persist them on HDFS 6 . Once the Index Writer pulls anewly indexed data block (say block42), it creates the block meta-data and index metadata for block42 7 . Notice that a newly indexeddata block is just another replica of the logical data block, but witha different sort order. For instance, in our example of Section 4.1,creating an index on attribute d for block42 leads to having fourdata block replicas for block42: one replica for each of the first fourattributes. Therefore, the Index Writer could simply write a new in-dexed data block as another replica. However, HDFS supports datablock replication only at the file level, i.e. HDFS replicates all thedata blocks of a given dataset the same number of times. This goesagainst the incremental nature of LIAH.

To solve this problem, the Index Writer creates a pseudo datablock replica, which is a new HDFS file 8 . Therefore, althoughthe pseudo data block replica is a logical copy of block42, the Na-meNode does not recognise it as a normal data block replica. In-stead, the NameNode simply sees the pseudo data block replica asanother index available for block42. To avoid shipping data fromone node to another, the Index Writer aims at storing the pseudodata block replica locally on DataNode 5. With this aim, the In-dex Writer stores the pseudo data block replica with replication

Job

Selection

Projectiona|b|c|d

d == 23

LIAHRecordReaderOpen InputStream

Block 42a

Replica 1

Block 43a

Replica 1

Block 42b

Replica 2c

Replica 3

Block 42

Block 43b

Replica 2c

Replica 3

Block 43

/in/data1

Block 42d

Pseudo/ai/blk_42/d

Block 43d

Pseudo/ai/blk_43/d Ps

eudo

Blo

ck R

eplic

as

HDFS

Blo

ck R

eplic

as

HDFS

Index ?

HadoopInputStreamAny HDFS Replica

only Tuples 1024-2048

Matching HDFS Replica

Matching Pseudo Replica

No Yes

LIAHInputStream

Adaptive?

offset = 0offset = 4711

LIAHInputSplit

BID42

OFF4711

INDEX[a,b,c]

/in/data1PATH

PSEUDO[d]

Index MetadataBlock Metadata

dIndex

Block Metadata

all Tuples

1

3

4

6

7 map

mFilter

d == 23

8for each Tuple

01110101...a01011010...b11001010...c00000000...d

0101a1000b1010c

d 0011

2

5

Figure 3: LIAH RecordReader internals.

factor one. The Index Writer follows a naming convention, whichcontains the identifier of the block and the main index attribute, touniquely identify a pseudo data block replica. It is worth notingthat a map task can compete with a speculative map task (specu-lative execution) in a different node to create a pseudo data blockreplica. To deal with this race condition, we follow the same pat-tern used by map tasks to store their intermediate output in originalHadoop. This means that each Index Writer first stores the pseudodata block replica in a temporary file and then tries to rename itafter completion. Only the first Index Writer will succeed and thesecond one will remove its temporary pseudo data block replica.Additionally, the successful Index Writer informs the NameNodeabout the new index on attribute d 9 . This allows LIAH to takethe newly created indexes into account for processing future jobs.

4.3 Pseudo Data Block ReplicasRecall from Section 4.2.2 that a pseudo data block replica is a

logical copy of a data block (in a different sort order) that is storedby LIAH as a new HDFS file rather than as a normal data blockreplica. This allows LIAH to keep a different replication factoron a block basis rather than on a file basis. As pseudo data blockreplicas are stored in different HDFS files than normal data blockreplicas, an important question arises: how to access pseudo datablock replicas in an invisible way for users?

LIAH achieves this transparency via its RecordReader (theLIAH RecordReader). Users continue annotating their map func-tions (with selection predicates and projections) as with HAIL. TheLIAH RecordReader takes care of automatically switching fromnormal to pseudo data block replicas. For this, the LIAH Recor-dReader uses the LIAH InputStream, a wrapper of the HadoopFSInputStream. We discuss the details of both the LIAH Recor-dReader and the LIAH InputStream below.

Figure 3 illustrates the internal pipeline of the LIAH Recor-dReader when processing a given LIAH InputSplit. When a maptask starts, the LIAH RecordReader first reads the metadata of itsLIAH InputSplit in order to check if there exists a suitable indexto process the input data block (block42) 1 . If a suitable indexis available, the LIAH RecordReader initialises the LIAH Input-Stream with the selection predicate of jobd as a parameter 2 . Inter-nally, the LIAH InputStream checks if the index resides in a normalor pseudo data block replica 3 . This allows the LIAH InputStream

to open an input stream to the right HDFS file. This is because nor-mal and pseudo data block replicas are stored on different HDFSfiles. While all normal data block replicas belong to the sameHDFS file, each pseudo data block replica belongs to a differentHDFS file 4 . As in our example the index on attribute d for block42resides in a pseudo data block replica, the LIAH InputStream opensan input stream to the HDFS file /pseudo/blk 42/d 5 . As aresult, the LIAH RecordReader does not care from which file it isreading since normal and pseudo data block replicas have the sameformat. Therefore, switching between a normal and a pseudo datablock replica is not only invisible to users, but also to the LIAHRecordReader. The LIAH RecordReader just reads the block andindex metadata using the LIAH InputStream 6 . After perform-ing an index lookup for the selection predicate of jobd, the LIAHRecordReader loads only the qualifying tuples (e.g. tuples 1024 –2048) from the projected attributes (a, b, c, and d) 7 . Finally, theLIAH RecordReader forms key-value pairs and passes only quali-fying pairs to the map function 8 .

In case that no suitable index exists, the LIAH RecordReadertakes the Hadoop InputStream, which opens an input stream to anynormal data block replica, and falls back to full scan.

4.4 Lazy IndexingThe blocking queues used by the Adaptive Indexer allow us to

easily protect LIAH against CPU overloading. However, writingpseudo data block replicas can also slow down the parallel read andwrite processes of MapReduce jobs. In fact, the negative impact ofextra I/O operations can be high as MapReduce jobs are typicallyI/O-bound. As a result, LIAH as a whole might become slowereven if the Adaptive Indexer can computationally keep up with thejob execution. So, the question that arises is: how to write pseudodata block replicas efficiently?

LIAH solves this problem by making indexing incremental,i.e. LIAH spreads index creation over multiple MapReduce jobs.The goal is to balance index creation cost over multiple MapRe-duce jobs so that users perceive small (or no) overhead in theirjobs. To do so, LIAH uses an offer rate, which is a ratio that lim-its the maximum number of pseudo data block replicas (i.e. num-ber of data blocks to index) to create during a single MapReducejob. For example, using an offer rate of 10%, LIAH indexes in asingle MapReduce job at maximum one data block out of ten pro-

cessed data blocks (i.e. LIAH only indexes 10% of the total datablocks). Notice that, consecutive jobs with selections on the sameattribute benefit from pseudo data block replicas created during pre-vious jobs. This strategy brings two major advantages. First, LIAHcan reduce the additional I/O introduced by indexing to any levelthat is acceptable for the user. Second, the indexing effort done byLIAH is according to the current query workload. Another advan-tage of using an offer rate is that users can decide how fast theywant to converge to a complete index, i.e. all data blocks are in-dexed. For instance, using an offer rate of 10%, LIAH would re-quire 10 MapReduce jobs with a selection predicate on the sameattribute to converge to a complete index (i.e. all data blocks areindexed). Therefore, on the one hand, the investment in terms oftime and space for MapReduce jobs with selection predicates onunfrequent attributes is minimised. However, on the other hand,MapReduce jobs with selection predicates on frequent attributesquickly converge to a completely indexed copy. We discuss moredetails about different offer rate strategies in Section 5.

4.5 LIAH SchedulingAn interesting result we found in [13] is that the initialisation

and finalisation costs of map tasks are so high that they basicallydominate short running jobs. Thus, reducing the number of maptasks is crucial to improve the performance of MapReduce jobs.

To deal with this problem, we introduce LIAH Scheduling,an extension of the HAIL Scheduling proposed in [13]. LIAHScheduling works as follows. First, LIAH Scheduling partitionsall input data blocks into indexed data blocks and unindexed datablocks. Second, LIAH Scheduling combines several indexed datablocks into one split as described in [13]. This allows LIAH toreduce the number of map tasks to schedule, thereby reducing thetotal overhead for initialising and finalising map tasks. Notice that,after this step, LIAH can obtain the exact number of already exist-ing indexes for each computing node. Third, like original Hadoop,LIAH creates one map task per unindexed data block. For eachmap task, LIAH considers r different computing nodes as possiblelocations to schedule a map task, where r is the replication factor ofthe input dataset. However, in contrast to original Hadoop, LIAHtries to schedule a map task to the computing node with the smallestnumber of existing indexes. As a result, LIAH can: (i) better paral-lelise index access for future MapReduce jobs and (ii) increase thechances to keep both normal and pseudo data block replicas in thesame node. The last point prevents LIAH to shuffle data throughthe network when writing pseudo data block replicas.

5. ADAPTIVE INDEXING STRATEGIESWe now present three strategies that allow LIAH to improve the

performance of MapReduce jobs. We first present eager index-ing, a technique that allows LIAH to adapt its incremental index-ing mechanism to the number of already created pseudo data blockreplicas. We then discuss how LIAH can prioritise data blocks forindexing based on their selectivity. Finally, we introduce invisi-ble projection, a new technique to deal with partial projections ofusers’ MapReduce jobs.

5.1 Eager Adaptive IndexingRecall that LIAH uses an offer rate to throttle down adaptive

indexing efforts to an acceptable (or even invisible) degree for users(see Section 4.4). However, let us make two important observationsthat could make a constant offer rate not desirable for certain users:

(1.) Using a constant offer rate, the job runtime of consecutiveMapReduce jobs having a filter condition on the same attribute is

Table 1: Cost model parameters.

Notation Descriptionnslots The number of map tasks that can run in parallel

in a given Hadoop clusternblocks The number of data blocks of a given datasetnidxBlocks The number of blocks with a relevant indexnfsw The number of map waves performing a full

scantfsw The average runtime of a map wave performing

a full scan (without adaptive indexing overhead)tidxOverhead The average time overhead of adaptive indexing

in a map waveTidxOverhead The total time overhead of adaptive indexingTis The total runtime of the map waves performing

an index scanTjob The total runtime of a given jobTtarget The targeted total job runtimeρ The ratio of data blocks (w.r.t. nblocks) offered

to the Adaptive Indexer

not constant. Instead, they have an almost linearly decreasing run-time up to the point where all blocks are indexed. This is becausethe first MapReduce job is the only to perform a full scan over allthe data blocks of a given dataset. Consecutive jobs, even whenindexing and storing the same amount of blocks, are likely to runfaster as they benefit from all indexing work of their predecessors.

(2.) LIAH actually delays indexing by using an offer rate. Thetradeoff here is that using a lower offer rate leads to a lower index-ing overhead, but it requires more MapReduce jobs to index all thedata blocks in a given dataset. However, some users want to limitthe experienced indexing overhead and still desire to benefit fromcomplete indexing as soon as possible.

Therefore, we propose an eager adaptive indexing strategy todeal with this problem. The basic idea of eager adaptive indexingis to dynamically adapt the offer rate for MapReduce jobs accord-ing to the indexing work achieved by previous jobs. In other words,eager adaptive indexing tries to exploit the saved runtime and rein-vest it as much as possible into further indexing. To do so, LIAHfirst needs to estimate the runtime gain (in a given MapReduce job)from performing an index scan on the already created pseudo datablock replicas. For this, LIAH uses a cost model to estimate the to-tal runtime, Tjob, of a given MapReduce job (Equation 1). Table 1lists the parameters we use in the cost model.

Tjob = Tis + tfsw · nfsw + TidxOverhead (1)

We define the number of map waves performing a full scan, nfsw,as dnblocks−nidxBlocks

nslotse. Intuitively, the total runtime Tjob of a job

consists of three parts. First, the time required by LIAH to processthe existing pseudo data block replicas, i.e. all data blocks havinga relevant index, Tis. Second, the time required by LIAH to pro-cess the data blocks without a relevant index, tfsw · nfsw. Third,the time overhead caused by adaptive indexing, TidxOverhead.5

The adaptive indexing overhead depends on the number of datablocks that are offered to the Adaptive Indexer and the averagetime overhead observed for indexing a block. Formally, we defineTidxOverhead as follows:

TidxOverhead = tidxOverhead ·min(ρ ·⌈

nblocksnslots

⌉, nfsw

)(2)

5It is worth noting that TidxOverhead denotes only the additionalruntime that a MapReduce job has due to adaptive indexing.

We can use this model to automatically calculate the offer rateρ in order to keep the adaptive indexing overhead acceptable forusers. Formally, from Equations 1 and 2, we deduct ρ as follows:

ρ =Ttarget − Tis − tfsw · nfsw

tidxOverhead · dnblocksnslots

e

Therefore, given a target job runtime Ttarget, LIAH can auto-matically set ρ in order to fully use this time budget for creating in-dexes and use the gained runtime in the next jobs either to speed upthe jobs or to create even more indexes. Usually, we choose Ttarget

to be equal to the runtime of the very first job so that users can ob-serve a stable runtime till almost everything is indexed. However,users can set Ttarget to any time budget in order to adapt the index-ing effort to their needs. Notice that, since accessing pseudo datablock replicas is independent of ρ, LIAH first processes pseudodata block replicas and measures Tis, before deciding what offerrate to use for the unindexed blocks. The average runtimes tfsw(from Equation 1) and tidxOverhead (from Equation 2) can be mea-sured in a calibration job or given by users.

On the one hand, LIAH can now adapt the offer rates to the per-formance gains obtained from performing index scans over the al-ready indexed data blocks. On the other hand, by gradually increas-ing the offer rate, eager adaptive indexing prioritises complete in-dex convergence over early runtime improvements for users. Thus,users no longer experience an incremental and linear speed up injob performance until the index is eventually complete, but insteadthey experience a sharp improvement when LIAH approaches toa complete index. In summary, besides limiting the overhead ofadaptive indexing, the offer rate can also be considered as a tuningknob to trade early runtime improvements with faster indexing.

5.2 Selectivity-based IndexingEarlier, we saw that LIAH uses an offer rate to limit the num-

ber of data blocks to index in a single MapReduce job. For this,LIAH uses a round robin policy to select the data blocks to pass tothe Adaptive Indexer. This sounds reasonable under the assump-tion that data is uniformly distributed. However, datasets are typi-cally skewed in practice and hence some data blocks might containsmore qualifying tuples than others under a given query workload.Consequently, indexing highly selective data blocks before otherdata blocks promises higher performance benefits.

Therefore, LIAH can also use a selectivity-based data block se-lection approach for deciding which data blocks to use. The overallidea is to use available computing resources in order to maximisethe expected performance improvement for future MapReduce jobsrunning on partially indexed datasets. The big advantage of thisapproach is that users can perceive higher improvements in perfor-mance for their MapReduce jobs from the very first runs. Addition-ally, as a side-effect of using this approach, LIAH can adapt fasterto the selection predicates of MapReduce jobs. However, how canLIAH efficiently obtain the selectivities of data blocks?

For this, LIAH exploits the natural process of map tasks to pro-pose data blocks to the Adaptive Indexer. Recall that a map taskpasses a data block to the Adaptive Indexer once the map task fin-ished processing the block. Thus, LIAH can obtain the accurate se-lectivity of a data block by piggybacking on the map phase: whenthe data block is filtered according to the provided selection pred-icate. This allows LIAH to have perfect knowledge about selec-tivities for free. Given the selectivity of a data block, LIAH candecide if it is worth to index the data block or not. In our currentLIAH prototype, a map task proposes a data block to the AdaptiveIndexer if the percentage of qualifying tuples in the data block isequal or higher than 80%. However, users can adapt this threshold

to their applications. Notice that with the statistics on data blockselectivities, LIAH can also decide which indexes to drop in caseof storage limitations. However, a discussion on an index evictionstrategy is out of the scope of this paper.

5.3 Invisible ProjectionIn Section 4.1, we discussed the general flow of LIAH for creat-

ing clustered indexes in an adaptive and incremental manner. Forsimplicity, in such discussion, we implicitly assume that consec-utive MapReduce jobs (with a selection predicate on the same at-tribute) read all (or the same) attributes from disk. Indeed, this isthe simplest case for indexing data blocks, because the entire datablocks (or all required attributes) are available in main memory. Asa result, the index attribute can be sorted and all other attributes canbe reordered at the same time for alignment reasons.

However, this becomes challenging when MapReduce jobs havedifferent projections. For example, consider a dataset having fourattributes a, b, c, d. Assume that LIAH is using an offer rate of50% and that there is no index on any of these attributes yet. Now,consider a first MapReduce job (say job1) having a selection pred-icate on d and projecting attribute b. Since LIAH does not have anindex on attribute d, LIAH creates a clustered index on attribute dand aligns attribute b with respect to attribute d. As a result of run-ning job1, LIAH ends up by having a clustered index on d (and baligned) for 50% of the data blocks (one index for each block) in thedataset. Now, consider a second MapReduce job (say job2) havinga selection predicate on d and projecting attribute c. It is here thatLIAH faces a problem: LIAH cannot fully benefit from the already50% indexed data blocks in the dataset. This is because attribute cis still not aligned with respect to attribute d. Hence, performing anindex scan for these data blocks would lead LIAH to perform manyrandom I/O operations for tuple reconstruction. The same appliesfor other MapReduce jobs with different projections. For instance,a MapReduce job (say job3), having a selection predicate on at-tribute d and projecting attribute a, cannot benefit from the indexescreated neither by job1 nor by job2. Therefore, the question is:how to create clustered indexes when MapReduce jobs have filterconditions on the same attribute but have different projections?

To deal with this problem, we introduce the invisible projectiontechnique. The idea is to additionally read all missing attributesbefore passing a data block to the Adaptive Indexer. Notice that,LIAH applies the invisible projection technique only for the datablocks that map tasks propose to the Adaptive Indexer. The beautyof this technique is that it is transparent for users as map tasks stillprocess the attributes required by MapReduce jobs. For example,consider again job1 from the above example. In this case, LIAH(the HAIL RecordReader) provides only attributes d and b to themap function of map tasks, but LIAH provides all attributes (a, b,c, and d) to the Adaptive Indexer. This way LIAH ensures thatdata blocks are always completely available in main memory forthe Adaptive Indexer.

The reader might think that the invisible projection approach isnot suitable for data-intensive applications as it requires still extraI/O operations for loading unprojected attributes. However, this isfar from the truth, because the extra I/O operations are only for thedata blocks offered to the Adaptive Indexer. Furthermore, the im-pact of invisible projection also depends on the proportion of pro-jected attributes. Therefore, if the proportion of projected attributesis low, LIAH can always decrease the offer rate in order to keep anacceptable adaptive indexing overhead. Alternatively, LIAH couldalso switch to a lazy projection approach to only read the attributesrequired by MapReduce jobs. Even though the current LIAH pro-totype supports only the invisible projection technique, we discuss

the lazy projection technique in Appendix A.

6. EXPERIMENTSWe evaluate the efficiency of LIAH to adapt to query workloads

and compare it with Hadoop and HAIL. We measure the perfor-mance of LIAH with three main objectives in mind: (i) to measurethe adaptive indexing overhead that LIAH generates over the run-time of MapReduce jobs; (ii) to evaluate both how fast LIAH canadapt to workloads and how well MapReduce jobs can benefit fromLIAH; (iii) to study how well each of the adaptive indexing strate-gies of LIAH allow MapReduce jobs to improve their runtime.

6.1 SetupCluster. We use two different clusters in our experiments. Ourfirst cluster (Cluster-A), is a 10-node cluster where each node has:one 2.66GHz Quad Core Xeon processor; 4x4GB of main memory;1x750GB SATA hard disk; three one Gigabit network cards. Oursecond cluster (Cluster-B), is a 4-node cluster where each node has:one 3.46 GHz Hexa Core Xeon X5690 processors; 20GB of mainmemory; one 278GB SATA hard disk (for the OS) and one 837GBSATA hard disk (for HDFS); two one Gigabit network cards. Weuse Cluster-B to measure the influence of more efficient processorson the behavior of LIAH. For both Cluster-A and Cluster-B, we usea 64-bit openSUSE 12.1 OS and the ext3 filesystem.Datasets. We use the web log dataset (UserVisits) from theHAIL paper [13]. This dataset has nine attributes, which are mostlystrings, and has a total size of 40GB×numberOfNodes, i.e. 400GBfor Cluster-A and 160GB for Cluster-B. Additionally, we use aSynthetic dataset containing only numeric attributes as scien-tific datasets. The Synthetic dataset has six attributes and atotal size of 50GB×numberOfNodes, i.e. 500GB for Cluster-Aand 200GB for Cluster-B. We generate the values for the first at-tribute in the range [1..10] and with an exponential repetition foreach value, i.e. 10i−1 where i ∈ [1..10]. We generate the other fiveattributes at random. Then, we shuffle all tuples across the entiredataset in order to have the same distribution across data blocks.MapReduce Jobs. For the UserVisits dataset, we considereleven jobs (JobUV1 – JobUV11) with a selection predicate onattribute searchWord and with a full projection (i.e. projectingall 9 attributes). The first four jobs JobUV1 – JobUV4 have aselectivity of 0.4% (1.24 million output records) and the remainingseven jobs (JobUV5 – JobUV11) have a selectivity of 0.2% (0.62million output records). For the Synthetic dataset, we considerother eleven jobs (JobSyn1 – JobSyn11) with a full projection,but with a selection predicate on the first attribute. These jobs havea selectively of 0.2% (2.2 million output records). All MapReducejobs for both datasets select disjoint ranges to avoid caching effects.For all experiments, we report the average of three trials.Systems. We use Hadoop v0.20.203 and HAIL as baseline systemsto evaluate the benefits of LIAH. For Hadoop, we use the defaultconfiguration settings, but increase the data block size to 256MBto decrease the scheduling overhead for Hadoop. In our experi-ments using the UserVisits dataset, HAIL creates one indexfor attribute sourceIP, one for attribute visitDate, and onefor attribute adRevenue, just like in [13]. For our experimentsusing the Synthetic dataset, we simply assume that HAIL doesnot create an index on the first attribute. For LIAH we considerfour different variants according to the offer rate (ρ) we use: LIAH(ρ = 0.1), LIAH (ρ = 0.25), LIAH (ρ = 0.5), and LIAH (ρ = 1).

0

300

600

900

1200

1103

855722

637630785

Job

runt

ime

[s]

JobUV1

Hadoop HAIL LIAH (ρ=0.1)LIAH (ρ=0.25) LIAH (ρ=0.5) LIAH (ρ=1)

569479447436398

547

JobUV1

Cluster A Cluster B

Figure 4: LIAH Performance when running the first MapRe-duce job over UserVisits.

0

300

600

900

1200

990785

674624554

961

Job

runt

ime

[s]

JobSyn1

Hadoop HAIL LIAH (ρ=0.1)LIAH (ρ=0.25) LIAH (ρ=0.5) LIAH (ρ=1)

483470438430393

864

JobSyn1

Cluster A Cluster B

Figure 5: LIAH Performance when running the first MapRe-duce job over Synthetic.

6.2 Performance for the First JobSince LIAH piggybacks adaptive indexing on MapReduce jobs,

the very first question that the reader might ask is: what is the ad-ditional runtime incurred by LIAH on MapReduce jobs? We an-swer this question in this section. For this, we run job JobUV1 forthe UserVisits dataset and job JobSyn1 for the Syntheticdatasets. For these experiments, we assume that there is no blockwith a relevant index for jobs JobUV1 and JobSyn1.

Figure 4 shows the job runtime for the four variants of LIAHfor the UserVisits dataset. In Cluster-A, we observe that LIAHhas almost no overhead (only 1%) over HAIL when using an offerrate of 10% (i.e. ρ = 0.1). Interestingly, we observe that LIAH isstill faster than Hadoop with ρ = 0.1 and ρ = 0.25. Indeed, theoverhead incurred by LIAH increases along with the offer rate usedby LIAH. However, we observe that LIAH increases the executiontime of JobUV1 by less than factor of two w.r.t. both Hadoop andHAIL, even though all data blocks are indexed in a single MapRe-duce job. We especially observe that the overhead incurred byLIAH scales linearly with the ratio of indexed data blocks (i.e. withρ), except when scaling from ρ = 0.1 to ρ = 0.25. This is becauseLIAH starts to be CPU bound only when offering more than 20%of the data blocks (i.e. from ρ = 0.25). This changes when runningJobUV1 in Cluster-B. In these results, we clearly observe that theoverhead incurred by LIAH scales linearly with ρ. We especiallyobserve that LIAH benefits from using newer CPUs and have bet-ter performance than Hadoop for most offer rates. LIAH has only4% overhead over Hadoop when having ρ = 1. Additionally, wecan see that LIAH has low overheads w.r.t. HAIL: from 10% (withρ = 0.1) to 43% (with ρ = 1).

Figure 5 shows the job runtimes for Synthetic. Overall, weobserve that the overhead incurred by LIAH continues to scale lin-early with the offer rate. In particular, we observe that LIAH has nooverhead over Hadoop in both clusters, except for LIAH (ρ = 1)in Cluster-A (where LIAH incurs a negligible overhead of ∼3%).It is worth noting that when using newer CPUs (Cluster-B) LIAHhas very low overheads over HAIL as well: from 9% to only 23%.

From these results, we can conclude that LIAH can efficiently

0

300

600

900

1200

1 2 3 4 5 6 7 8 9 10 11

Job

runt

ime

[s]

JobsUV

Hadoop HAIL LIAH (ρ=1)LIAH (ρ=0.5) LIAH (ρ=0.25) LIAH (ρ=0.1)

1 2 3 4 5 6 7 8 9 10 11

JobsUV

Cluster A Cluster B

Figure 6: LIAH performance when running a sequence ofMapReduce jobs over UserVisits.

create indexes at job runtime while limiting the overhead of writ-ing pseudo data block replicas. In particular, we observe the effi-ciency of the lazy indexing mechanism of LIAH to adapt to users’requirements via different offer rates.

6.3 Performance for a Sequence of JobsWe saw in the previous section that LIAH can linearly scale the

adaptive indexing overhead with the help of the offer rate. But,which are the implications for a sequence of MapReduce jobs? Toanswer this question, we run the sequence of eleven MapReducejobs for each dataset: JobUV1 – JobUV11 for UserVisits andJobSyn1 – JobSyn11 for Synthetic.

Figures 6 and 7 show the job runtimes for the UserVisitand Synthetic datasets, respectively. Overall, we clearly seein both computing clusters that LIAH improves the performance ofMapReduce jobs linearly with the number of indexed data blocks.In particular, we observe that the higher the offer rate, the fasterLIAH converges to a complete index. However, the higher the of-fer rate, the higher the adaptive indexing overhead for the initialjob (JobUV1 and JobSyn1). Thus, users are faced with a natu-ral tradeoff between indexing overhead and the required number ofjobs to index all blocks. But, it is worth noting that users can uselow offer rates (e.g. ρ = 0.1) and still quickly converge to a com-plete index (e.g. after 10 job executions for ρ = 0.1). In particu-lar, we observe that after executing only a few jobs LIAH alreadyoutperforms Hadoop and HAIL significantly. For example, let usconsider the sequence of jobs on Synthetic using ρ = 0.25 onCluster-B. Remember that for this offer rate the overhead for thefirst job compared to HAIL is relatively small (11%) while LIAHis still able to outperform Hadoop. With the second job LIAH isslightly faster than HAIL and when running the fourth job improvesover HAIL by more than a factor of two and over Hadoop by morethan a factor of five6. As soon as LIAH converges to a complete in-dex, LIAH significantly outperforms HAIL by up to a factor of 23and Hadoop by up to a factor of 52. For the UserVisits dataset,LIAH outperforms HAIL by up to a factor of 24 and Hadoop byup to a factor of 32. Notice that, LIAH and HAIL increase the per-formance gap with Hadoop for Synthetic, because they signif-icantly reduce the size of this dataset when converting it to binaryrepresentation.

In summary, the results show that LIAH can efficiently adapt toquery workloads with a very low overhead only for the very firstjob: the following jobs always benefit from the indexes created inprevious jobs. Interestingly, an important result is that LIAH canconverge to a complete index after running only a few jobs.

6Although LIAH is still indexing further blocks.

0

300

600

900

1200

1 2 3 4 5 6 7 8 9 10 11

Job

runt

ime

[s]

JobsSyn

Hadoop HAIL LIAH (ρ=1)LIAH (ρ=0.5) LIAH (ρ=0.25) LIAH (ρ=0.1)

1 2 3 4 5 6 7 8 9 10 11

JobsSyn

Cluster A Cluster B

Figure 7: LIAH performance when running a sequence ofMapReduce jobs over Synthetic.

0

300

600

900

1200

1 2 3 4 5 6 7 8 9 10 11

Job

runt

ime

[s]

JobsUV

LIAH (eager) LIAH (ρ=0.1) LIAH (ρ=1)HAIL

Figure 8: Eager adaptive indexing vs. ρ = 0.1 and ρ = 1

6.4 Eager Adaptive Indexing for a Sequenceof Jobs

We saw in the previous section that LIAH improves the perfor-mance of MapReduce jobs linearly with the number of indexed datablocks. Now, the question that might arise in the reader’s mind is:can LIAH efficiently exploit the saved runtimes for further adaptiveindexing? To answer this question, we enable the eager adaptiveindexing strategy in LIAH and run again all UserVisits jobsusing an initial offer rate of 10%. In these experiments, we useCluster-A and consider LIAH (without eager adaptive indexing en-abled) with offer rates of 10% and 100% as baselines.

Figure 8 show the result of this experiment. As expected, weobserve that LIAH (eager) has the same performance as LIAH(ρ = 0.1) for JobUV1. However, in contrast to LIAH (ρ = 0.1),LIAH (eager) keeps its performance constant for JobUV2. This isbecause LIAH (eager) automatically increases ρ from 0.1 to 0.17in order to exploit saved runtimes. For JobUV3, LIAH (eager)still keeps its performance constant by increasing ρ from 0.17 to0.33. Now, even though LIAH (eager) increases ρ from 0.33 to 1for JobUV4, LIAH (eager) now improves the job runtime as only40% of the data blocks remain unindexed. As a result of adapt-ing its offer rate, LIAH (eager) converges to a complete index onlyafter 4 jobs while incurring almost no overhead over HAIL. FromJobUV5, LIAH (eager) ensures the same performance as LIAH(ρ = 1) since all data blocks are indexed, while LIAH (ρ = 0.1)takes 6 more jobs to converge to a complete index.

These results show that LIAH can converge even faster to a com-plete index, while still keeping a negligible indexing overhead forusers’ MapReduce jobs. Overall, these results demonstrate the highefficiency of LIAH (eager) to adapt its offer rate according to thenumber of already indexed data blocks.

6.5 Invisible Projection for the First JobSo far, we have considered MapReduce jobs that project all at-

tributes. However, this is not always the case in practice. There-fore, it is also important to answer the following question: how

0

200

400

600

800

1 2 3 4 5 6 7 80%

25%

50%

75%

100%

45%

19% 17% 15% 9% 9% 6% 4%Job

runt

ime

[s]

Number of projected attributes

Ove

rhea

d in

%

LIAHwoInvPrj LIAHwInvProj Overhead

Figure 9: Invisible projection overhead for UserVisits.

well does LIAH deal with MapReduce jobs that project only a sub-set of attributes from their input datasets? We focus on answeringthis question in this section. To do so, we now enable the invisibleprojection technique from Section 5.3 for LIAH.

In these experiments, we consider two variants of LIAH: onewithout invisible projection (LIAHwoInvPrj) and another with in-visible projection (LIAHwInvPrj). We consider a constant offer rateof 25% for these two variants of LIAH. For both UserVisitsand Synthetic, we run a MapReduce job with a selection pred-icate on the first attribute and vary the number of projected at-tributes. Overall, the main goal of these experiments is to mea-sure the overhead of LIAHwInvPrj (i.e. reading all attributes) overLIAHwoInvPrj (i.e. reading only the required attributes). To bet-ter evaluate the invisible projection technique, we assume that noindex exists in UserVisits and Synthetic. We run these ex-periments on Cluster-A.

Figure 9 shows the results for UserVisits. We observethat, when JobUV1 projects only the first attribute, LIAHwInvPrjincurs an overhead of almost 45%. Indeed, this is partiallybecause LIAHwInvPrj has to read eight attributes more thanLIAHwoInvPrj. However, most of this overhead is for readingthe second attribute (destURL), which is the largest attribute inUserVisits. As soon as LIAHwoInvPrj also reads the secondattribute, LIAHwInvPrj incurs an overhead of only ∼19% (i.e. 2xless overhead), even if LIAHwInvPrj reads seven more attributes.Then, LIAHwInvPrj lowers its overhead by ∼2% along with thenumber of projected attributes by LIAHwoInvPrj. But, as soon asLIAHwoInvPrj reads the second largest attribute (i.e. the 5th at-tribute) in UserVisits, LIAHwInvPrj again decreases its over-head by roughly a factor of 2, i.e. it now incurs an overhead of only9%. From this point, the overhead caused by LIAHwInvPrj startsto be negligible.

We saw in the results for UserVisits that LIAHwInvPrj in-curs a low overhead overall, especially as soon as LIAHwoInvPrjreads the most expensive attributes. Thus, the question that arisesis: how good is the invisible projection technique for scientific-likedatasets, where most attributes are of the same size? This is whywe run again the invisible projection over the Synthetic dataset.

Figure 10 shows the results for LIAHwInvPrj on theSyntnhetic dataset when having a very selective job (the joboutputs only one tuple). Notice that, we consider a very selectivejob for this experiment in order to clearly see the impact of writingadaptively created indexes to disk. We observe that LIAHwInvPrjhas an acceptable overhead of 18% on average and a low over-head when projecting more than the half of the total number ofattributes. What it is interesting to highlight in these results is thatthe impact of the LIAHwInvPrj over LIAHwoInvPrj is noticeable,because the MapReduce jobs outputs only a single tuple. To sup-port this claim, we additionally ran a series of experiments with a

0

175

350

525

700

1 2 3 4 50%

25%

50%

75%

100%

24% 27% 21%12% 6%Jo

b ru

ntim

e [s

]

Number of projected attributes

Ove

rhea

d in

%

LIAHwoInvPrj LIAHwInvPrj Overhead

Figure 10: Invisible projection overhead for Synthetic withvery high job selectivity.

very lowly selective job that outputs 80% of the incoming tuples. Inthose experiments, we observed that LIAHwInvPrj has a negligible6% overhead on average over LIAHwoInvPrj.

Additionally, we evaluated LIAHwInvPrj on Cluster-B using anoffer rate of 25% and the Synthetic dataset, but we do not reportthe results here because of space constraints. Overall, we observedin this additional experiment that LIAHwInvPrj incurs a negligibleoverhead of 1% on average over LIAHwoInvPrj. These results alsoshowed that LIAH significantly benefits from using newer CPUs.

In summary, the results we presented in this section demonstratethe high efficiency of the invisible projection technique to deal withpartial projections.

7. CONCLUSIONSeveral research works have improved the performance of

MapReduce jobs significantly by integrating indexing into theMapReduce framework [28, 25, 12, 23, 13]. However, none ofthese indexing techniques can adapt to changes in users’ workloadas they create indexes upfront. Therefore, these indexing tech-niques are not suitable for applications where workloads are hardto predict, such as in scientific applications and social networks.

In this paper, we proposed LIAH (for Lazy Indexing and Adap-tivity in Hadoop), a parallel, adaptive approach for indexing at min-imal costs in MapReduce systems. LIAH creates clustered indexeson data blocks as byproduct of MapReduce job execution. As aconsequence, LIAH can adapt to changes in user’s workloads. Thebeauty of LIAH is that it efficiently piggybacks index creation onthe existing Hadoop MapReduce pipeline. Hence, LIAH not onlyhas no additional read I/O-costs, but it is also completely invisi-ble for both the MapReduce system and users. A salient feature ofLIAH is that, besides distributing indexing effort across multiplecomputing nodes, it also parallelises indexing with map tasks com-putation and disk I/O. Furthermore, LIAH can adjust the maximumnumber of data blocks to index in parallel with a single MapRe-duce job. In particular, we proposed eager adaptive indexing, atechnique that allows LIAH to reinvest the runtime benefits fromindexes created by previous MapReduce jobs for further indexing.Thereby, LIAH can trade the number of jobs to complete indexing adataset with early job runtime improvements. This allows LIAH toscale indexing effort according to hardware capabilities and users’needs. As a result, in contrast to existing adaptive indexing works,LIAH incurs very low (or invisible) indexing overheads even forthe first query that triggers the creation of a new index. Still, LIAHquickly converges to a complete index, i.e. all HDFS data blocksare indexed. Additionally, we introduced the invisible projectionand lazy projection techniques, which allow LIAH to efficientlycreate clustered indexes even if incoming jobs project only a subsetof attributes from their input datasets.

We experimentally evaluated LIAH and compared it withHadoop and HAIL, using two different datasets (UserVisitsand Synthetic) and computing clusters. The results demon-strated the high superiority of LIAH: LIAH runs MapReduce jobsup to 52 times faster than Hadoop and up to 24 times fasterthan HAIL. In particular, the results showed that LIAH signifi-cantly outperforms Hadoop in almost all scenarios, except for thevery first query when using an offer rate of 100%. With respectto HAIL, LIAH has a very low indexing overhead (e.g. 1% forUserVisits when using an offer rate of 10%) only for the veryfirst job. The following jobs already run faster than HAIL, e.g. ∼2times faster from the fourth job with an offer rate of 25%. The re-sults also showed that, even for low offer rates, LIAH converges toa complete index after running only a few number of MapReducejobs. For example, LIAH converges to a complete index after 10jobs with an offer rate of 10%. All this demonstrates the high effi-ciency of LIAH to (i) balance indexing effort, (ii) create clusteredindexes at job runtime, and (iii) adapt to users’ workloads. Theresults also showed that the invisible projection technique incurs anegligible overhead (e.g. 6% on average for Synthetic dataset).Acknowledgments. Research partially supported by BMBF.

8. REFERENCES[1] S. Agrawal et al. Database Tuning Advisor for Microsoft SQL Server

2005. In VLDB, pages 1110–1121, 2004.[2] A. Ailamaki et al. Weaving Relations for Cache Performance. VLDB,

pages 169–180, 2001.[3] I. Alagiannis et al. NoDB: efficient query execution on raw data files.

In SIGMOD, pages 241–252, 2012.[4] N. Bruno and S. Chaudhuri. To Tune or not to Tune? A Lightweight

Physical Design Alerter. In VLDB, pages 499–510, 2006.[5] N. Bruno and S. Chaudhuri. An Online Approach to Physical Design

Tuning. In ICDE, pages 826–835, 2007.[6] N. Bruno and S. Chaudhuri. Physical Design Refinement: The

Merge-Reduce Approach. ACM TODS, 32(4), 2007.[7] M. J. Cafarella and C. Re. Manimal: Relational Optimization for

Data-Intensive Programs. PVDLB, 4(6):385–396, 2011.[8] S. Chaudhuri and V. R. Narasayya. An Efficient Cost-Driven Index

Selection Tool for Microsoft SQL Server. In VLDB, pages 146–155,1997.

[9] S. Chaudhuri and V. R. Narasayya. Self-Tuning Database Systems: ADecade of Progress. In VLDB, pages 3–14, 2007.

[10] S. Chen. Cheetah: A High Performance, Custom Data Warehouse onTop of MapReduce. PVLDB, 3(1-2):1459–1468, 2010.

[11] J. Dittrich and J.-A. Quiane-Ruiz. Efficient Big Data Processing inHadoop MapReduce. PVLDB, 5(12):2014–2015, 2012.

[12] J. Dittrich, J.-A. Quiane-Ruiz, A. Jindal, Y. Kargin, V. Setty, andJ. Schad. Hadoop++: Making a Yellow Elephant Run Like a Cheetah(Without It Even Noticing). PVLDB, 3(1-2):515–529, 2010.

[13] J. Dittrich, J.-A. Quiane-Ruiz, S. Richter, S. Schuh, A. Jindal, andJ. Schad. Only Aggressive Elephants are Fast Elephants. PVLDB,5(11):1591–1602, 2012.

[14] J.-P. Dittrich, P. M. Fischer, and D. Kossmann. AGILE: AdaptiveIndexing for Context-Aware Information Filters. In SIGMOD, pages215–226, 2005.

[15] S. J. Finkelstein et al. Physical Database Design for RelationalDatabases. ACM TODS, 13(1):91–128, 1988.

[16] G. Graefe and H. A. Kuno. Self-selecting, self-tuning, incrementallyoptimized indexes. In EDBT, pages 371–381, 2010.

[17] F. Halim et al. Stochastic Database Cracking: Towards RobustAdaptive Indexing in Main-Memory Column-Stores. PVLDB,5(6):502–513, 2012.

[18] H. Herodotou and S. Babu. Profiling, What-if Analysis, andCost-based Optimization of MapReduce Programs. PVLDB,4:1111–1122, 2011.

[19] S. Idreos et al. Database Cracking. In CIDR, pages 68–78, 2007.[20] S. Idreos et al. Self-organizing tuple reconstruction in column-stores.

In SIGMOD, pages 297–308, 2009.

[21] S. Idreos et al. Merging What’s Cracked, Cracking What’s Merged:Adaptive Indexing in Main-Memory Column-Stores. PVLDB,4(9):586–597, 2011.

[22] E. Jahani et al. Automatic Optimization for MapReduce Programs.PVLDB, 4(6):385–396, 2011.

[23] D. Jiang et al. The Performance of MapReduce: An In-depth Study.PVLDB, 3(1-2):472–483, 2010.

[24] A. Jindal, J.-A. Quiane-Ruiz, and J. Dittrich. Trojan Data Layouts:Right Shoes for a Running Elephant. In SOCC, 2011.

[25] J. Lin et al. Full-Text Indexing for Optimizing Selection Operationsin Large-Scale Data Analytics. In MapReduce Workshop, pages59–66, 2011.

[26] M. Luhring et al. Autonomous Management of Soft Indexes. InICDE Workshop on Self-Managing Database Systems, pages450–458, 2007.

[27] K. Schnaitter et al. COLT: Continuous On-line Tuning. In SIGMOD,pages 793–795, 2006.

[28] H.-C. Yang and D. S. Parker. Traverse: Simplified Indexing on LargeMap-Reduce-Merge Clusters. In DASFAA, pages 308–322, 2009.

APPENDIXA. LAZY PROJECTION

In Section 5.3 we presented invisible projection, a technique forefficiently creating clustered indexes even if incoming MapReducejobs projects a subset of attributes. The main idea behind invisibleprojection is to read the unprojected attributes for those data blocksthat are proposed by map tasks to the Adaptive Indexer. This waythe Adaptive Indexer can align all attributes inside a data block withrespect to the indexed attribute. Our results from Section 6.5 showsthat the invisible projection incurs a very low overhead on average.However, invisible projection might incur higher overheads whenMapReduce jobs project only a low percentage of attributes. Forexample, we observe in Figure 9 that invisible projection incur anoverhead of ∼45% when projecting only the first attribute (out ofeight) from the UserVisists dataset.

We thus propose lazy projection, a technique that allows LIAH toefficiently create clustered indexes when MapReduce jobs projectonly a small proportion of attributes. In contrast to the invisibleprojection technique, the main idea of lazy projection is to readonly the projected attributes in order to minimise the additional readI/O for partial projections. This means that, with the lazy projec-tion technique, LIAH reads exclusively the attributes requested byusers. Thus, map tasks might pass potentially incomplete blocks tothe Adaptive Indexer. The Adaptive Indexer, in turn, apply sortingand reordering only on the available subset of attributes.

Let’s consider again our job example of Section 5.3. Recallthat jobd filters records based on attribute d and projects only at-tribute b. In this example, using the lazy projection, the IndexBuilder first sorts attribute d and thereby create a permutation vec-tor as described in Section 4.2.1. Then, the Index Builder reordersthe available attribute b according to the permutation vector. Fi-nally, the Index Writer creates the corresponding metadata andstores the just created partial clustered index as a partially pseudodata block replica. In contrast to pseudo data block replica, a par-tially pseudo data block replica contains the permutation vector ofattribute d. This permutation vector indicates the Index Builderhow to reorder attributes for alignment w.r.t. the indexed attribute d.

Now, assume that another incoming job job′d, with a filter con-dition on attribute d, which also projects attributes c besides at-tribute b. In this case, the LIAH RecordReader uses the previ-ously created partially pseudo data block replicas to perform anindex access on attribute d so as to read only the qualifying val-ues from attribute b. Additionally, the LIAH RecordReader readsthe persisted permutation vector of attribute d. Then, the LIAH

RecordReader uses the normal data block replica (stored locally)to load the missing attribute c. Once attribute c is main memory,the LIAH RecordReader uses the permutation vector to pass thequalifying values from c, together with those from b, to the mapfunction. When all qualifying records are passed to the map func-tion, the LIAH RecordReader then passes the permutation vectorand all the data from attribute c, which is already in main memory,to the Adaptive Indexer. Internally, the Index Builder reorders at-tribute c according to the permutation vector and passes the resultto the Index Writer. Finally, the Index Writer locates the matchingpartially pseudo data block replica, appends the aligned attribute c,and updates the block metadata. In other words, lazy projectiontolerates missing attributes in partially pseudo data block replicas.Lazy projection incrementally completes a partially pseudo datablock replica whenever the replica (i) has the right index to per-form an incoming MapReduce job, and (ii) does not contain all theattributes projected by the incoming job. Once a partially pseudodata block replica is complete, i.e. it contains all attributes, the In-dex Writer simply deletes the permutation vector.

Therefore, the advantage of lazy projection is that it allows LIAHto fully incrementally adapt its indexes to users’ workloads. Fur-thermore, lazy projection also allows LIAH to reduce space con-sumption, because only those attributes that are actually requiredby MapReduce jobs are stored in pseudo data block replicas.