English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Computing n-gram Statistics in MapReduce

Berberich, K., & Bedathur, S. (2013). Computing n-gram Statistics in MapReduce. In Advances in Database Technology (pp. 101-112). New York, NY: ACM. doi:10.1145/2452376.2452389.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0015-19CE-5 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0023-C108-2
Genre: Conference Paper
Latex : Computing n-gram Statistics in {MapReduce}

Files

show Files
hide Files
:
edbt2013-final.pdf (Any fulltext), 293KB
 
File Permalink:
-
Name:
edbt2013-final.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Berberich, Klaus1, Author           
Bedathur, Srikanta2, Author
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2013-03-182013
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Berberich2013b
Other: Local-ID: 31F260D05B735433C1257B09003B1404-Berberich2013b
DOI: 10.1145/2452376.2452389
 Degree: -

Event

show
hide
Title: 16th International Conference on Extending Database Technology
Place of Event: Genova, Italy
Start-/End Date: 2013-03-18 - 2013-03-22

Legal Case

show

Project information

show

Source 1

show
hide
Title: Advances in Database Technology
  Abbreviation : EDBT 2013
  Subtitle : 16th International Conference on Extending Database Technology; Genoa, Italy, March 18-22, 2013 Proceedings
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 101 - 112 Identifier: ISBN: 978-1-4503-1597-5