PARALLEL DATABASE ALGORITHMS FOR SOLVING PLANNING PROBLEMS ON VERY LARGE DATABASES

作     者：OHMORI, T MATSUMOTO, Y 

作者机构：Member Faculty of Engineering Kyoto University Kyoto Japan 606 Nonmember Koukichi Matsumoto:received his B.E. and Ph.D. degrees in 1954 and 1974 respectively from the University of Tokyo. He joined Toshiba in 1954. He became a Director at Toshiba in 1985 and a Professor at Kyoto University in 1989. He has been engaged in development of control systems for engineeringcomputers development of software productivity technology research in software development support environment etc. He received awards from Japan Electric Industry Society Invention Society Science and Technology Agency etc. He is the author ofsoftware Engineering and 12 other books. He is a lifetime member of Denki Gakkai IEEE Fellow and a member of Japan Society for Software Science and Technology and the Information Processing Society of Japan. 

出 版 物：《SYSTEMS AND COMPUTERS IN JAPAN》 (Syst Comput Jpn)

年 卷 期：1995年第26卷第11期

页      面：12-25页

核心收录：

主　　题：PARALLEL DATABASE PROCESSING CONSTRAINT-SATISFYING PROBLEM COOPERATIVE DISTRIBUTED PROCESSING 

摘      要：This paper discusses cooperative distributed planning problems using multiple agents that share a very large database. It is an important framework for planning by multiple agents with incomplete information, and for evaluating behavior strategies and negotiation manners. The specific issue involves distributed constraint-satisfying problems on databases. The problem is described as concurrent execution and repetitive execution of transactions, where each agent is deemed as a transaction that operates on a very large database. Therefore, we propose a highly efficient parallel database processing algorithm for these two basic operations.