Hancock: a language for processing very large-scale data

  • Authors:

  • Dan Bonachea;Kathleen Fisher;Anne Rogers;Frederick Smith

  • Affiliations:

  • EECS Department at the University of California at Berkeley and AT&T Labs, Shannon Laboratory, Florham Park, NJ;AT&T Labs, Shannon Laboratory, Florham Park, NJ;AT&T Labs, Shannon Laboratory, Florham Park, NJ;CS Department at Cornell University and AT&T Labs, Shannon Laboratory, Florham Park, NJ

  • Venue:
  • DSL'99 Proceedings of the 2nd conference on Conference on Domain-Specific Languages - Volume 2
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

A signature is an evolving customer profile computed from call records. AT&T uses signatures to detect fraud and to target marketing. Code to compute signatures can be difficult to write and maintain because of the volume of data. We have designed and implemented Hancock, a C-based domain-specific programming language for describing signatures. Hancock provides data abstraction mechanisms to manage the volume of data and control abstractions to facilitate looping over records. This paper describes the design and implementation of Hancock, discusses early experiences with the language, and describes our design process.