Counting methods for cyclic relations

Authors:
Ramsey W. Haddad;Jeffrey F. Naughton
Affiliations:
Computer Science Department, Stanford University, Stanford, CA;Computer Science Department, Princeton University, Princeton, NJ
Venue:
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Year:
1988

Citing 11
Cited 12

On compiling queries in recursive first-order databases

Journal of the ACM (JACM)
On the implementation of a simple class of logic queries for databases

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Magic sets and other strange ways to implement logic programs (extended abstract)

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
The generalized counting method for recursive logic queries

Proceedings on International conference on database theory
On the power of magic

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient evaluation for a subset of recursive queries

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Worst-case complexity analysis of methods for logic query implementation

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
One-sided recursions

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Magic counting methods

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Handling redundancy in the processing of recursive database queries

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Performance evaluation of data intensive logic programs

Foundations of deductive databases and logic programming

Efficient evaluation of right-, left-, and multi-linear rules

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
A correction of the termination conditions of the Henschen-Naqvi technique

Journal of the ACM (JACM)
On the expected size of recursive Datalog queries

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient Evaluation of Multiple Linear Recursions

IEEE Transactions on Software Engineering
Decomposition of magic rewriting

Journal of the ACM (JACM)
Graph-theoretic methods in database theory

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A data structure for arc insertion and regular path finding

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
The Branching-Time Transformation Technique for Chain Datalog Programs

Journal of Intelligent Information Systems
A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs

LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
A Value-propagating Transformation Technique for Datalog Programs Based on Non-Deterministic Constructs

Fundamenta Informaticae
Speeding up the counting method by computing heritage functions in topological order

ADBIS'97 Proceedings of the First East-European conference on Advances in Databases and Information systems
A Value-propagating Transformation Technique for Datalog Programs Based on Non-Deterministic Constructs

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider selections of the form “column = constant” on relations defined by linear recursive, two rule datalog programs. In general, counting methods perform well on such queries. However, counting methods fail in the presence of cycles in the database. We present an algorithm in the spirit of counting methods that correctly deals with cyclic data and has the same asymptotic running time as counting methods. The algorithm, which is based on reducing a query on a database to a question about intersections of semi-linear sets, works by using efficient methods to construct the appropriate semi-linear sets from the database and query constant.