A functional programming-directed database machine
The paper describes a non von Neumann computer architecture and its use for database application. The architecture includes an FFP machine, a general-purpose computer as a buffer between the secondary storage of the system and the FFP machine. This machine is a small-grain, cellular tree machine that directly executes formal functional languages. After a short review of functional programming notions (Section 2), the FFP machine and its extension for relational database processing is described (Section 3). Special care is given to performance characteristics of the FFP machine. Section 4 presents a technique to embed SQL queries in FFP programs. The main Sections 5 and 6 contain implementation of selected operations of the relational algebra (projection, selection and join). The author also analyses different degrees of parallelism. In Section 7 I/O architectures and memory issues are discussed. The paper concludes by enumerating some application areas for the suggested the area of database architecture (expert database systems, CAD/CAM databases, VLSI technology). In any case, the paper offers an interesting contribution to the area of database machines.
- A network of microprocessors to execute reduction languages, part I
- Can programming be liberated from the von Neumann style?
- scientific article; zbMATH DE number 3848585 (Why is no real title available?)
- scientific article; zbMATH DE number 3963763 (Why is no real title available?)
- scientific article; zbMATH DE number 3696469 (Why is no real title available?)
- RAP.2—An Associative Processor for Databases and Its Applications
This page was built for publication: A functional programming-directed database machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750140)