A Self-Describing Data File Structure for Large Data Sets

Robert A. Burnett
Additional contact information
Robert A. Burnett: Pacific Northwest Laboratory

A chapter in Computer Science and Statistics: Proceedings of the 13th Symposium on the Interface, 1981, pp 359-362 from Springer

Abstract: Abstract A major goal of the Analysis of Large Data Sets (ALDS) research project at Pacific Northwest Laboratory (PNL) is to provide efficient data organization, storage, and access capabilities for statistical applications involving large amounts of data. As part of the effort to achieve this goal, a self-describing binary (SDB) data file structure has been designed and implemented together with a set of data manipulation functions and supporting SDB data access routines. Logical and physical data descriptors are stored in SDB files preceding the data values. SDB files thus provide a common data representation for interfacing diverse software components. This paper describes the data descriptors and data structures permitted by the file design. Data buffering, file segmentation and a segment overflow handler are also discussed.

Keywords: Data Structures; Data Description; Large Data Bases; Data Management; Statistics; Self-Describing Data Files (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-9464-8_59

Ordering information: This item can be ordered from
http://www.springer.com/9781461394648

DOI: 10.1007/978-1-4613-9464-8_59

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().