Abstract
Signatures are evolving profiles of entities extracted from streams of transactional data. For a stream of credit card transactions, for example, an entity might be a credit card number and a signature the average purchase amount. Signatures provide a high-level view of data in a transactional data warehouse and help data analysts focus their attention on interesting subsets of the data in such warehouses. Traditional databases are not designed for such applications. They impose overhead for services not necessary in such applications, such as indexing, declarative querying, and transaction support. Hancock is a C-based domain-specific programming language with an embedded domain-specific database designed for computing signatures. In this paper, we describe Hancock’s database mechanism, evaluate its performance, and compare an application written in Hancock with an equivalent application written in Daytona [5], a very efficient relational database system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
David Belanger, Kenneth Church, and Andrew Hume. Virtual data warehousing, data publishing, and call detail. In Processings of Databases in Telecommunications 1999, International Workshop., 1999. Also appears in Springer Verlag LNCS 1819 (pp. 106–117).
Corinna Cortes, Kathleen Fisher, Daryl Pregibon, Anne Rogers, and Frederick Smith. Hancock: A language for extracting signatures from data streams. In Proceedings of the Sixth International Coitnference on Knowledge Discovery and Data Mining, pages 9–17, August 2000.
Corinna Cortes and Daryl Pregibon. Giga mining. In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, 1998.
Kathleen Fisher, Karin Högstedt, Anne Rogers, and Frederick Smith. Hancock 1.1 manual. See http://www.research.att.com/projects/hancock, 2001.
Rick Greer. Daytona and the fourth-generation language Cymbal. In Alex Delis, Christos Faloutsos, and Shahram Ghandeharizadeh, editors, SIGMOD 1999, Proceedings ACM SIGMOD International Conference on Management of Data, June 1–3, 1999, Philadephia, Pennsylvania, USA. ACM Press, 1999. Also available at http://www.research.att.com/projects/daytona.
P. Gupta, S. Lin, and M. McKeown. Routing lookups in hardware and memory access speeds. In Proc. 17th Ann. Joint Conf. of the IEEE Computer and Communications Societies, volume 3, pages 1240–7, 1998.
N.-F. Huang, S.-M. Zhao, J.-Y. Pan, and C.-A. Su. A fast IP routing lookup scheme for gigabit switching routers. In Proc. 18th Ann. Joint Conf. of the IEEE Computer and Communications Societies, volume 3, pages 1429–36, 1999.
B. Lampson, V. Srinivasan, and G. Varghese. IP lookups using multiway and mul-ticolumn search. IEEE/ACM Transactions on Networking, 7(3):324–34, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fisher, K., Goodall, C., Högstedt, K., Rogers, A. (2002). An Application-Specific Database. In: Ghelli, G., Grahne, G. (eds) Database Programming Languages. DBPL 2001. Lecture Notes in Computer Science, vol 2397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46093-4_13
Download citation
DOI: https://doi.org/10.1007/3-540-46093-4_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44080-2
Online ISBN: 978-3-540-46093-0
eBook Packages: Springer Book Archive