Abstract
This paper investigates the feasibility of using a pure functional language to implement data storage and manipulation on parallel declarative machines. A pure functional language is used to construct a data manager that allows efficient and concurrent access to shared data. The interaction between concurrent data manipulation operations is investigated. It is shown that, within certain limits, the rate of processing data manipulating operations is independent of the size of the data structure.KeywordsActive TaskGraph NodeTransaction ProcessingPrimary MemoryDisk AccessThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
