Aggregate operators in constraint query languages

DOI10.1006/JCSS.2001.1810zbMATH Open1052.68024OpenAlexW1986060337MaRDI QIDQ696963FDOQ696963

Leonid Libkin, Michael Benedikt

Publication date: 12 September 2002

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

Full work available at URL: https://doi.org/10.1006/jcss.2001.1810

Recommendations

• Publication:4508940
• Query languages for bags and aggregate functions
• Foundations of aggregation constraints
• Logics with aggregate operators
• Publication:4508935

zbMATH Keywords

aggregation problem

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Learnability and the Vapnik-Chervonenkis dimension
• Title not available (Why is that?)
• Geometric algorithms and combinatorial optimization.
• A random polynomial-time algorithm for approximating the volume of convex bodies
• Title not available (Why is that?)
• Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
• Definable Sets in Ordered Structures. III
• On the Complexity of Computing the Volume of a Polyhedron
• On limited nondeterminism and the complexity of the V-C dimension
• Vapnik-Chervonenkis Classes of Definable Sets
• Stability, the f.c.p., and superstability; model theoretic properties of formulas in first order theory
• Title not available (Why is that?)
• Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
• Relational queries over interpreted structures
• Title not available (Why is that?)
• Extended order-generic queries
• A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form
• Title not available (Why is that?)
• Finitely representable databases
• Queries with arithmetical constraints
• An expressive language for linear spatial database queries
• On the equivalence and rewriting of aggregate queries
• Definability by constant-depth polynomial-size circuits
• Relational expressive power of constraint query languages
• First-Order Queries on Finite Structures Over the Reals
• Title not available (Why is that?)
• Title not available (Why is that?)
• Safe Constraint Queries

Cited In (5)

• Aggregate operators in probabilistic databases
• Queries on XML streams with bounded delay and concurrency
• On the equivalence and rewriting of aggregate queries
• Title not available (Why is that?)
• Selecting and using views to compute aggregate queries

Uses Software

• DEDALE

This page was built for publication: Aggregate operators in constraint query languages

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