Efficient processing of integrity constraints in deductive databases |
| |
| Affiliation: | 1. Department of Pediatrics, University of Arkansas for Medical Sciences, Little Rock, Ark;2. Arkansas Children''s Research Institute, Little Rock, Ark;1. College of Resources and Environmental Sciences, China Agriculture University, No. 2 Yuanmingyuan West Road, Haidian District, Beijing 100193, PR China;2. Institute of Nuclear Technology and Biotechnology, Xinjiang Academy of Agricultural Science, No.403 Nanchang Road, Urumqi, Xinjiang 830091, PR China;3. Soil Biology and Plant Nutrition, University of Kassel, Nordbahnhofstr. 1a, Witzenhausen 37213, Germany;1. Division of Urogynecology, Department of Obstetrics and Gynecology, TriHealth Good Samaritan Hospital, Cincinnati, OH;2. St. Elizabeth Physicians, Division of Female Pelvic Medicine and Reconstructive Surgery, Fort Thomas, KY;3. William Beaumont Hospital/Oakland University School of Medicine, Royal Oak, MI;4. Hatton Research Institute, TriHealth Good Samaritan Hospital, Cincinnati, OH;1. Department of Physiology, Faculty of Medicine, Dokuz Eylül University, 35340 Izmir, Turkey;2. Research Laboratory, Faculty of Medicine, Dokuz Eylul University, Izmir, Turkey;3. Department of Histology and Embriyology, Medical Faculty, Celal Bayar University, Manisa, Turkey;4. Health Science Institute, Laboratory Animal Science, Dokuz Eylül University, Izmir, Turkey |
| |
| Abstract: | One major operation in a deductive database is to verify the contents of the database with integrity constraints whenever the database is changed. The number of facts and integrity constraints in a deductive database often makes the validation process the bottleneck of the system. In this paper, we describe a set of approaches to process integrity constraints efficiently on sequential computers and on massively parallel computers. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
