Check out the new USENIX Web site.

Home About USENIX Events Membership Publications Students
Paper - Proceedings of the 2nd Conference on Domain-Specific Languaes, October 3-5, 1999, Austin, Texas    [Technical Program]

Pp. 163–178 of the Proceedings

Hancock:
A Language for Processing Very Large-Scale Data

Dan Bonachea 1      Kathleen Fisher      Anne Rogers      Frederick Smith2
AT&T Labs
Shannon Laboratory
180 Park Avenue
Florham Park, NJ 07932, USA
bonachea@cs.berkeley.edu
{kfisher,amr}@research.att.com
fms@cs.cornell.edu



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.



This document was tranlated from LATEX by HEVEA and HACHA.

This paper was originally published in the Proceedings of the 2nd Conference on Domain-Specific Languaes, October 3-5, 1999, Austin, Texas, USA
Last changed: 25 Feb 2002 ml
Technical Program
Conference index
USENIX home