An intelligent memory transaction engine

  • Abhaya Asthana
  • H. V. Jagadish
  • Scott C. Knauer
Memory Resident Database Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 368)


In this paper, we describe the structure and utilization of a high bandwidth, multi-ported, disk-sized memory system capable of storing, maintaining, and manipulating persistent shared data within it, independent of any external processing units. Up to thousands of active storage elements, each element having some storage and some associated processing logic, function independently or in groups to implement user-defined objects and data structures. Hundreds of transactions can concurrently be processed by mutually exclusive sets of elements. A fast response time is obtained due to the proximity of the processing with the memory, a specialized micro-architecture, and parallelism.


Memory Module Transaction Manager Store Network Main Processor Database Machine 
These 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. Agrawal and D.J. DeWitt, “Whither Hundreds of Processors in a Database Machine,” Proc. Int'l Workshop High-Level Computer Architecture 84, May 1984, 6.21–6.32.Google Scholar
  2. [2]
    R. Agrawal and H. V. Jagadish, “Recovery Algorithms for Database Machines with Non-Volatile Main Memory,” AT&T Bell Laboratories Technical Memorandum, 1989Google Scholar
  3. [3]
    Anon, et al., “A Measure of Transaction Processing Power,” Datamation, Apr. 1, 1985, 112–118.Google Scholar
  4. [4]
    B. A. Crane et al, “PEPE Computer Architecture,” in IEEE CompCon, 1972, 17–22.Google Scholar
  5. [5]
    J. A. Chandross, H. V. Jagadish, and A. Asthana, “The Trap as a Control Flow Mechanism,” Proceedings of MICRO 21, the 21st Annual Workshop on Microprogramming and Micro-Architecture, Dec. 1988.Google Scholar
  6. [6]
    G. Copeland, R. Krishnamurthy, and M. Smith, “The Case for Safe RAM,” Tech. Rept. ACA-ST-080-88, MCC, Austin, Texas, Feb. 1988Google Scholar
  7. [7]
    D.J. DeWitt, “DIRECT — A Multiprocessor Organization for Supporting Relational Database Management Systems,” IEEE Trans. Computers, C-28(6), June 1979, 395–406.Google Scholar
  8. [8]
    H. Garcia-Molina, R. J. Lipton, and P. Honeyman, “A Massive Memory Database System,” Technical Report #314, Dept. of Elec. Engg. and Comp. Sc., Princeton University, Sep. 1983Google Scholar
  9. [9]
    N.H. Gehani and W.D. Roome, “Concurrent C,” Software—Practice & Experience, 16(9), 1986, 821–844..Google Scholar
  10. [10]
    D. Hillis, The Connection Machine, MIT Press, Cambridge, Mass., 1985.Google Scholar
  11. [11]
    E. Neuhold and M. Stonebraker, “Future Directions in DBMS Research,” Technical Report-88-001, Int'l Computer Science Inst., Berkeley, California, May 1988Google Scholar
  12. [12]
    Craig Stanfill, presentation on, “Pattern Matching on the Connection Machine,” Third International Conference on Supercomputers, Boston, MA, May 1988.Google Scholar
  13. [13]
    Esen. A. Ozkarahan, Stewart A. Schuster, and K. C. Smith, “RAP — An Associative Processor for Data Base Management,” in Proceedings 1975 National Computer Conference, vol. 44, AFIPS, 370–387.Google Scholar
  14. [14]
    D. Patterson, G. Gibson, and R. H. Katz, “A Case for Redundant Arrays of Inexpensive Disks (RAID),” Proc. ACM-SIGMOD 1988 Int'l Conf. on Management of Data, Chicago, Illinois, June 1988.Google Scholar
  15. [15]
    W.D. Roome and M.D.P. Leland, “The Silicon Database Machine: Rationale, Design, and Results,” Proc. 5th Int'l Workshop on Database Machines, Karuizawa, Nagano, Japan, Oct. 1987.Google Scholar
  16. [16]
    Jack A. Rudolph, “A Production Implementation of an Associative Array Processor-STARAN,” in Proceedings of the 1972 Fall Joint Computer Conference, vol. 41, AFIPS, 229–241. Have this.Google Scholar
  17. [17]
    David Elliot Shaw, “The Non-Von Supercomputer,” Department of Computer Science, Columbia University, August 1982Google Scholar
  18. [18]
    D. L. Slotnick, “Logic Per Track Devices,” in Advances in Computers, vol. 10, Frantz Alt (ed.), Academic Press, New York, 1970, 291–296.Google Scholar
  19. [19]
    David J. Stoves, “CAFS800: Some Principles and Practices,” in Proceedings of the 5th International Online Meeting, and Learned Information, 1981. Paper Deals with CAFS.Google Scholar
  20. [20]
    B. Stroustrup, The C++ Programming Language, Addison-Wesley., 1986.Google Scholar
  21. [21]
    Stanley Y. W. Su, G. P. Copeland, and G. J. Lipovsky, “The Architectural Features of CASSM: A Cellular System for Non-Numeric Processing,” in Proceedings of the First Annual Symposium on Computer Architecture, 1983, 121–128. Paper deals with CASSM.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Abhaya Asthana
    • 1
  • H. V. Jagadish
    • 1
  • Scott C. Knauer
    • 1
  1. 1.AT&T Bell LaboratoriesMurray Hill

Personalised recommendations