Low complexity aggregation in GraphLog and Datalog

DOI10.1007/3-540-53507-1_90MaRDI QIDQ4694700zbMATH OpenFDO

Authors Mariano P. Consens, Alberto O. Mendelzon

Publication date 29 June 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53507-1_90

zbMATH Keywords

computing of aggregate functionsdatalognon-recursive programsparallel complexitypaths in database graphtransitive closurevisual query language graphlogvisual query language GraphLog

Mathematics Subject Classification ID

Database theory (68P15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Low-complexity aggregation in GraphLog and Datalog
• Datalog and logic databases
• How expressive is stratified aggregation?
• Parallel complexity of logical query programs
• Inherent complexity of recursive queries

Cited in

(12)

• Fault-tolerant computation of distributed regular path queries
• Towards an efficient evaluation of recursive aggregates in deductive databases
• A logical query language for hypermedia systems
• Query languages for bags and aggregate functions
• Operational and abstract semantics of the query language G-Log
• How expressive is stratified aggregation?
• FCA in a logical programming setting for visualization-oriented graph compression
• Aggregation in functional query languages
• Merging graph-based and rule-based computation: The language G-Log
• The first-order truth behind undecidability of regular path queries determinacy
• An algebraic formulation of the aggregative closure query
• Low-complexity aggregation in GraphLog and Datalog

Describes a project that uses

Uses Software

• Datalog
• GraphLog

This page was built for publication: Low complexity aggregation in GraphLog and Datalog

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