A counting algorithm for a cyclic binary query

DOI10.1016/0022-0000(91)90034-3MaRDI QIDQ1176288zbMATH OpenOpenAlexFDO

Authors Ramsey W. Haddad, Jeffrey F. Naughton

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

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

Recommendations

• Counting cyclic binary strings
• An efficient approximation algorithm for counting \(n\)-cycles in a graph
• An algorithm for counting short cycles in bipartite graphs
• Accelerating counting-based search
• New Algorithms and Applications of Cyclic Reference Counting
• An efficient approach to cyclic reference counting based on a coarse-grained search
• scientific article; zbMATH DE number 7204563
• Approximate binary search algorithms for mean cuts and cycles
• Counting Parameterized Border Arrays for a Binary Alphabet
• The generalized counting method for recursive logic queries

Cites work

• scientific article; zbMATH DE number 4049156 (Why is no real title available?)
• Argument reduction by factoring
• Depth-First Search and Linear Graph Algorithms
• On Context-Free Languages
• On compiling queries in recursive first-order databases

Cited in

(5)

• Grammars and automata to optimize chain logic queries
• Multi-way counting method
• Comparison of methods for logic-query implementation
• Counting Parameterized Border Arrays for a Binary Alphabet
• An efficient approach to cyclic reference counting based on a coarse-grained search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176288)