Generalization of ZYT-linearizability for bilinear datalog programs

Authors:
Ji-Hoon Kang;Ki-Hyung Hong;Kyu-Young Whang;Jung-Wan Cho
Affiliations:
Department of Computer Science, Chungnam National University, 220 Gung-Dong, Yuseong-Gu, Daejeon 305-764, Republic of Korea;School of Media and Information, Sungshin Women's University, Republic of Korea;Department of Computer Science and Advanced Information Technology Research Center (AITrc ), Korea Advanced Institute of Science and Technology, Republic of Korea;Department of Computer Science, Korea Advanced Institute of Science and Technology, Republic of Korea
Venue:
Information and Computation
Year:
2004

Citing 18
Cited 0

An amateur's introduction to recursive query processing strategies

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Decidability and expressiveness aspects of logic queries

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimizing datalog programs

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A necessary condition for a doubly recursive rule to be equivalent to a linear recursive rule

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Linearising nonlinear recursions in polynomial time

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic programming and databases

Logic programming and databases
Necessary and sufficient conditions to linearize doubly recursive programs in logic databases

ACM Transactions on Database Systems (TODS)
Hard problems for simple logic programs

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Logical query optimization by proof-tree transformation

PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the efficiency of transforming database logic programs

Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Argument reduction by factoring

Theoretical Computer Science
Space optimization in deductive databases

ACM Transactions on Database Systems (TODS)
Dynamically ordered semi-naive evaluation of recursive queries

Information Sciences: an International Journal
Answering recursive queries using views

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Conjunctive-query containment and constraint satisfaction

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An Extended Disjunctive Normal Form Approach for Optimizing Recursive Logic Queries in Loosely Coupled Environments

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Optimal implementation of conjunctive queries in relational data bases

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.