Relational queries computable in polynomial time
Information and Control
Languages that capture complexity classes
SIAM Journal on Computing
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
The magic of duplicates and aggregates
Proceedings of the sixteenth international conference on Very large databases
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Monotonic aggregation in deductive databases
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The well-founded semantics of aggregation
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Low-complexity aggregation in GraphLog and Datalog
ICDT Selected papers of the 4th international conference on Database theory
Infinitary logics and 0–1 laws
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Computing with first-order logic
Selected papers of the 23rd annual ACM symposium on Theory of computing
On a monadic NP vs monadic co-NP
Information and Computation
Principles of programming with complex objects and collection types
ICDT '92 Selected papers of the fourth international conference on Database theory
Towards an effective calculus for object query languages
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Normal forms and conservative extension properties for query languages over collection types
Journal of Computer and System Sciences
Information and Computation
Counting quantifiers, successor relations, and logarithmic space
Journal of Computer and System Sciences - special issue on complexity theory
Query languages for bags and aggregate functions
Journal of Computer and System Sciences - Special issue on principles of database systems
Foundations of aggregation constraints
Theoretical Computer Science
Information and Computation - Special issue: logic and computational complexity
Rewriting aggregate queries using views
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
Journal of the ACM (JACM)
Local properties of query languages
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Logics with counting and local properties
ACM Transactions on Computational Logic (TOCL)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Circuit Complexity before the Dawn of the New Millennium
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Aggregate Functions, Conservative Extensions, and Linear Orders
DBLP-4 Proceedings of the Fourth International Workshop on Database Programming Languages - Object Models and Languages
On the Power of Aggregation in Relational Query Languages
DBLP-6 Proceedings of the 6th International Workshop on Database Programming Languages
A Calculus for Collections and Aggregates
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
On the Forms of Locality over Finite Models
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Logics capturing local properties
ACM Transactions on Computational Logic (TOCL)
Incremental recomputation in local languages
Information and Computation
Theoretical Computer Science - Database theory
Configuration knowledge representations for Semantic Web applications
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Locally consistent transformations and query answering in data exchange
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Containment of aggregate queries
ACM SIGMOD Record
Non-linear prefixes in query languages
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Design and implementation of aggregate functions in the dlv system*
Theory and Practice of Logic Programming
The finite model theory toolbox of a database theoretician
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Locality of Queries and Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
A 25-year perspective on logic programming
Query-preserving watermarking of relational databases and Xml documents
ACM Transactions on Database Systems (TODS)
ASP at work: spin-off and applications of the DLV system
Logic programming, knowledge representation, and nonmonotonic reasoning
Database query processing using finite cursor machines
ICDT'07 Proceedings of the 11th international conference on Database Theory
Proceedings of the 32nd symposium on Principles of database systems
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
Hi-index | 0.00 |
We study adding aggregate operators, such as summing up elements of a column of a relation, to logics with counting mechanisms. The primary motivation comes from database applications, where aggregate operators are present in all real life query languages. Unlike other features of query languages, aggregates are not adequately captured by the existing logical formalisms. Consequently, all previous approaches to analyzing the expressive power of aggregation were only capable of producing partial results, depending on the allowed class of aggregate and arithmetic operations.We consider a powerful counting logic, and extend it with the set of all aggregate operators. We show that the resulting logic satisfies analogs of Hanf's and Gaifman's theorems, meaning that it can only express local properties. We consider a database query language that expresses all the standard aggregates found in commercial query languages, and show how it can be translated into the aggregate logic, thereby providing a number of expressivity bounds, that do not depend on a particular class of arithmetic functions, and that subsume all those previously known. We consider a restricted aggregate logic that gives us a tighter capture of database languages, and also use it to show that some questions on expressivity of aggregation cannot be answered without resolving some deep problems in complexity theory.