Query languages for bags and aggregate functions

DOI10.1006/jcss.1997.1523zbMath0887.68022OpenAlexW2029138494MaRDI QIDQ1376407

Limsoon Wong, Leonid O. Libkin

Publication date: 25 May 1998

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

Full work available at URL: https://semanticscholar.org/paper/1b9651ec443eac2c2b64c19466e7bc23694e5d15

zbMATH Keywords

bagsquerying databases

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (21)

Chromar, a rule-based language of parameterised objects ⋮ Strongly-Normalizing Higher-Order Relational Queries ⋮ Unnamed Item ⋮ Modular materialisation of Datalog programs ⋮ Query languages for bags and aggregate functions ⋮ Models of approximation in databases ⋮ Iterating on multiple collections in synchrony ⋮ Expressive power of SQL. ⋮ Incremental recomputation in local languages. ⋮ Query lifting. Language-integrated query for heterogeneous nested collections ⋮ On database query languages for K-relations ⋮ Structural recursion as a query language on lists and ordered trees ⋮ Unnamed Item ⋮ Notions of locality and their logical characterizations over finite models ⋮ A technique for proving decidability of containment and equivalence of linear constraint queries ⋮ Fragments of Bag Relational Algebra: Expressiveness and Certain Answers ⋮ Verifiable properties of database transactions ⋮ Foundations of ontology-based data access under bag semantics ⋮ Local properties of query languages ⋮ Computing possible and certain answers over order-incomplete data ⋮ Lower bounds for invariant queries in logics with counting.

Uses Software

• GraphLog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The expressiveness of a family of finite set languages
• Finite-model theory -- A personal perspective
• Low-complexity aggregation in GraphLog and Datalog
• Notions of computation and monads
• The relational model with relation-valued attributes
• Using powerdomains to generalize relational databases
• The powerset algebra as a natural tool to handle nested database relations
• Classical recursion theory. Vol. II
• Conservativity of nested relational calculi with internal generic functions
• Domain independence and the relational calculus
• On representation and querying incomplete information in databases with bags
• Counting quantifiers, successor relations, and logarithmic space
• Query languages for bags and aggregate functions
• A query language for NC
• Models of approximation in databases
• Bounded fixpoints for complex objects
• Structure and complexity of relational queries
• On monadic NP vs monadic co-NP
• Semantic representations and query languages for or-sets
• Normal forms and conservative extension properties for query languages over collection types
• Towards tractable algebras for bags
• Languages that Capture Complexity Classes
• Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
• Comprehending monads

This page was built for publication: Query languages for bags and aggregate functions