Abstract
On the Hadoop Core mailing list, a user was wondering about the way to handle a specific style of range query with MapReduce. The application had a search space and incoming search requests. In this chapter, we’ll look at a similar setup, as follows:
-
The search space dataset has the key range begin, range end and the value search space data. For simplicity’s sake, let’s assume that ranges in the search space do not overlap.
-
The search request dataset has the key value and the value search request data.
-
The result set for a value that is between range begin and range end has the key value and the value search request data, search space data.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Rights and permissions
Copyright information
© 2009 Jason Venner
About this chapter
Cite this chapter
(2009). Solving Problems with Hadoop. In: Pro Hadoop. Apress. https://doi.org/10.1007/978-1-4302-1943-9_9
Download citation
DOI: https://doi.org/10.1007/978-1-4302-1943-9_9
Publisher Name: Apress
Print ISBN: 978-1-4302-1942-2
Online ISBN: 978-1-4302-1943-9
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)