Low-complexity aggregation in GraphLog and Datalog
From MaRDI portal
(Redirected from Publication:688669)
Recommendations
Cites work
- scientific article; zbMATH DE number 4147465 (Why is no real title available?)
- scientific article; zbMATH DE number 4022671 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 219224 (Why is no real title available?)
- A taxonomy of problems with fast parallel algorithms
- Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
- Expressibility and Parallel Complexity
- Languages that Capture Complexity Classes
- Nondeterministic Space is Closed under Complementation
Cited in
(12)- Query languages for bags and aggregate functions
- Expressive power of SQL.
- Aggregated search in graph databases: preliminary results
- Logics with aggregate operators
- Querying best paths in graph databases
- Aggregation in functional query languages
- Merging graph-based and rule-based computation: The language G-Log
- scientific article; zbMATH DE number 219218 (Why is no real title available?)
- Recursive rules with aggregation: a simple unified semantics
- scientific article; zbMATH DE number 7407799 (Why is no real title available?)
- How much are your geraniums? Taking graph conditions beyond first order
- Local properties of query languages
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 Q688669)