Deductive databases for transport engineering

被引:1
|
作者
Heydecker, BG
Small, C
Poulovassilis, A
机构
[1] UNIV LONDON BIRKBECK COLL, DEPT COMP SCI, LONDON, ENGLAND
[2] UNIV LONDON KINGS COLL, DEPT COMP SCI, LONDON WC2R 2LS, ENGLAND
基金
英国工程与自然科学研究理事会;
关键词
D O I
10.1016/0968-090X(95)00011-7
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
Transport data are typical of many application areas in that they arise from a variety of sources and are used in various ways. Furthermore, important information that is required in practical applications of transport databases is often not stored explicitly, but rather has to be deduced from some that is. It is therefore natural to consider the application in this field of deductive database management systems (DBMSs). These extend traditional DBMSs by permitting the definition of inference rules, default rules, complex data structures and integrity constraints, each of which can be used to provide facilities of substantial practical value. The work described here arose from the application of a novel deductive DBMS called PFL (Persistent Functional Language) to the storage and manipulation of road accident data. Although the primary entity type in such a database is that of an accident, queries are typically based upon the concept of a site. Because site information is not stored explicitly in the database, it must be deduced from auxiliary information that provides some indication of location. The combination of large amounts of data and computationally intensive queries presents extraordinary demands for the database system and has led to the development of new software techniques of high efficiency in both computation and data manipulation.
引用
收藏
页码:277 / 292
页数:16
相关论文
共 50 条
  • [41] THE SEMANTICS OF DISJUNCTIVE DEDUCTIVE DATABASES
    VOLGER, H
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 440 : 409 - 421
  • [42] RECURSIVE AXIOMS IN DEDUCTIVE DATABASES
    GOLOVKO, AV
    SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1986, 24 (02): : 154 - 158
  • [43] Incremental view materialization in deductive databases
    Wong, WC
    Bic, LF
    COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1999, 18 (03): : 239 - 269
  • [44] CHECKING FUNCTIONAL CONSISTENCY IN DEDUCTIVE DATABASES
    LAMBRICHTS, E
    NEES, P
    PAREDAENS, J
    PEELMAN, P
    TANCA, L
    INFORMATION PROCESSING LETTERS, 1990, 35 (03) : 115 - 120
  • [45] THEORY AND ALGORITHMS FOR DISJUNCTIVE DEDUCTIVE DATABASES
    FERNANDEZ, JA
    MINKER, J
    PROGRAMMING AND COMPUTER SOFTWARE, 1993, 19 (03) : 85 - 111
  • [46] On the partial semantics for disjunctive deductive databases
    Thomas Eiter
    Nicola Leone
    Domenico Saccà
    Annals of Mathematics and Artificial Intelligence, 1997, 19 : 59 - 96
  • [47] Updating intensional predicates in deductive databases
    Laurent, D
    Luong, VP
    Spyratos, N
    DATA & KNOWLEDGE ENGINEERING, 1998, 26 (01) : 37 - 70
  • [48] Consistency preserving updates in deductive databases
    Mayol, E
    Teniente, E
    DATA & KNOWLEDGE ENGINEERING, 2003, 47 (01) : 61 - 103
  • [49] Algebraic approach to indefinite deductive databases
    Lui, K.C.
    Sunderraman, R.
    Proceedings of the International Symposium on Methodologies for Intelligent Systems, 1990,
  • [50] Efficient reasoning method in deductive databases
    Huazhong Ligong Daxue Xuebao, 6 (9-11):