A counting algorithm for a cyclic binary query

DOI10.1016/0022-0000(91)90034-3zbMath0764.68027OpenAlexW2070932735MaRDI QIDQ1176288

Jeffrey F. Naughton, Ramsey W. Haddad

Publication date: 25 June 1992

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(91)90034-3

zbMATH Keywords

cyclic datadatalog programintersections of semilinear setssame generation

Mathematics Subject Classification ID

Database theory (68P15) Parallel algorithms in computer science (68W10) Logic programming (68N17)

Related Items (1)

GRAMMARS AND AUTOMATA TO OPTIMIZE CHAIN LOGIC QUERIES

Cites Work

• Unnamed Item
• Argument reduction by factoring
• On compiling queries in recursive first-order databases
• On Context-Free Languages
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A counting algorithm for a cyclic binary query