Location of Repository

Concurrent Automata, Database Computers, and Security: A “New ” Security Paradigm for Secure Parallel Processing

By T. Y. Lin

Abstract

Declustering has been proposed t,o speed up pa.rallel database machine. However, t,he securit#y requires clustering. In this paper, we use tempora.1 clustering to reconcile the apparent conflict. Aut.oma.ta. theory is applied to high level a.rchitecture design. Based on Petri net theory a da.ta.base ma.chine is proposed. The classical notion of clustering is esknd to tempora.1 dimension and is imported to parallel databa.se syst,ems. The proposed database ma.chine not only has t,he linear speedup, its capability (modeling power) also is increased in the order of magnitude. The computational model (in terms of automa.ta) of the total system is strictly higher than the union of t.1la.t of individua.1 machine. It also efficiently support t,he securit.y.

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.188.8801
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.nspw.org/papers/199... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.