Solving Complex Database Problems in P-STAT

Roald Buhler and Shirrell Buhler
Additional contact information
Roald Buhler: P-STAT, Inc.
Shirrell Buhler: P-STAT, Inc.

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

Abstract: Abstract At the 13th Interface, six different packages submitted their solutions to four problems designed by Robert F. Teitel — two each for two different data bases. P-STAT proved to be very well suited for handling these problems. The tasks involving the first data base required only a single pass through the system data file even in the standard version of P-STAT. The problems involving the second data base were also easy to do in standard P-STAT even though they required several passes of the file. However, these problems could also be done in a single pass when the file was built using P-STAT’s new P-RADE database enhancement.

Keywords: Complex data base; aggregation; direct access retrieval; hierarchical structure; P-STAT programming language (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_19

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

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

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 ().