Traverse: Simplified indexing on large map-reduce-merge clusters

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5463, Issue , 2009, Pages 308-322

  Yang, Hung Chih ^a   Parker, D Stott ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS METHODS; DATA SETS; GENERAL TOOLS;

DATA PROCESSING; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; SEARCH ENGINES; WORLD WIDE WEB;

DATABASE SYSTEMS;

EID: 67650164795     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00887-0_27     Document Type: Conference Paper

References (14)

1. Apache. Hadoop (2006), http://lucene.apache.org/hadoop/
2. Bayer, R., McCreight, E.M.: Organization and Maintenance of Large Ordered Indices. Acta Inf. 1(3), 173-189 (1972)
3. Brewer, E.A.: Combining Systems and Databases: A Search Engine Retrospective. In: Hellerstein, J.M., Stonebraker, M. (eds.) Readings in Database Systems, 4th edn. MIT Press, Cambridge (2005)
4. Comer, D.: The Ubiquitous B-tree. Comp. Surveys 11(2), 121-137 (1979)
5. Dean, J., Ghemawat, S.: MapReduce: Simpli.ed Data Processing on Large Clusters.. In: OSDI, pp. 137-150 (2004)
6. Fagin, R., et al.: Extendible Hashing - A Fast Access Method for Dynamic Files. TODS 4(3), 315-344 (1979) (Pubitemid 10410579)
7. Graefe, G.: B-tree Indexes, Interpolation Search, and Skew. In: Ailamaki, A., Boncz, P.A., Manegold, S. (eds.) DaMoN, p.5. ACM, New York (2006)
8. Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Yormark, B. (ed.) SIGMOD 1984, pp. 47-57. ACM Press, New York (1984) (Pubitemid 15469534)
9. Hellerstein, J.M., et al.: Generalized Search Trees for Database Systems. In: VLDB 1995, pp. 562-573. Morgan Kaufmann, San Francisco (1995)
10. Olston, C., Reed, B., Srivastava, U., Kumar, R., Tomkins, A.: Pig Latin: a Not-So- Foreign Language for Data Processing. In: SIGMOD 2008, pp. 1099-1110. ACM, New York (2008)
11. O'Neil, P.E., Graefe, G.: Multi-Table Joins Through Bitmapped Join Indices. SIGMOD Record 24(3), 8-11 (1995)
12. Pike, R., Dorward, S., Griesemer, R., Quinlan, S.: Interpreting the Data: Parallel Analysis with Sawzall. Scienti.c Programming Journal 13(4), 227-298 (2005)
13. Yang, H.-C., Dasdan, A., Hsiao, R.-L., Parker Jr., D.S.: Map-Reduce-Merge: Simpli .ed Relational Data Processing on Large Clusters. In: Chan, C.Y., Ooi, B.C., Zhou, A. (eds.) SIGMOD Conference, pp. 1029-1040. ACM, New York (2007) (Pubitemid 47630879)
14. Yang, H.-C., Parker Jr., D.S., Hsiao, R.-L.: The Holodex: Integrating Summarization with the Index. In: SSDBM, pp. 23-32. IEEE Computer Society, Los Alamitos (2006)