Summary data structures for massive data

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Request Changes to record.

Abstract

Prompted by the need to compute holistic properties of increasingly large data sets, the notion of the “summary” data structure has emerged in recent years as an important concept. Summary structures can be built over large, distributed data, and provide guaranteed performance for a variety of data summarization tasks. Various types of summaries are known: summaries based on random sampling; summaries formed as linear sketches of the input data; and other summaries designed for a specific problem at hand.

Item Type: Book Item
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Series Name: Lecture Notes in Computer Science
Publisher: Springer Berlin Heidelberg
ISBN: 9783642390524
ISSN: 0302-9743
Book Title: The Nature of Computation. Logic, Algorithms, Applications
Editor: Bonizzoni, Paola and Brattka, Vasco and Benedikt, Löwe
Official Date: 2013
Dates:
Date
Event
2013
UNSPECIFIED
Volume: Volume 7921
Page Range: pp. 78-86
DOI: 10.1007/978-3-642-39053-1_9
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
URI: https://wrap.warwick.ac.uk/59804/

Export / Share Citation


Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item