Generalization of ZYT-linearizability for bilinear datalog programs

Cited 0 time in webofscience Cited 1 time in scopus
  • Hit : 394
  • Download : 0
We propose a new type of linearizability, called right-linear-first (RLF) linearizability. The well-known ZYT-linearizability deals with only one bilinear rule. RLF-linearizability is a generalization of ZYT-linearizability since RLF-linearizability deals with general bilinear datalog programs consisting of multiple bilinear and linear rules. We identify sufficient conditions for RLF-linearizability. The test of the sufficient conditions is exponential in the size of the input datalog program, which is, however, usually very small compared with the size of the extensional database in deductive database applications. (C) 2003 Elsevier Inc. All rights reserved.
Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
Issue Date
2004-01
Language
English
Article Type
Article
Keywords

OPTIMIZATION; DATABASES

Citation

INFORMATION AND COMPUTATION, v.188, pp.77 - 98

ISSN
0890-5401
DOI
10.1016/S0890-5401(03)00172-X
URI
http://hdl.handle.net/10203/12077
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0