Sharing Queries with Nonequivalent User-defined Aggregate Functions
Abstract
Supplementary Material
- Download
- 1.08 MB
References
Index Terms
- Sharing Queries with Nonequivalent User-defined Aggregate Functions
Recommendations
User-defined aggregate functions: bridging theory and practice
SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of dataThe ability to create user-defined aggregate functions (UDAs) is rapidly becoming a standard feature in relational database systems. Therefore, problems such as query optimization, query rewriting and view maintenance must take into account queries (or ...
Rewriting queries with arbitrary aggregation functions using views
The problem of rewriting aggregate queries using views is studied for conjunctive queries with arbitrary aggregation functions and built-in predicates. Two types of queries over views are introduced for rewriting aggregate queries: pure candidates and ...
Determinacy and query rewriting for conjunctive queries and views
Answering queries using views is the problem which examines how to derive the answers to a query when we only have the answers to a set of views. Constructing rewritings is a widely studied technique to derive those answers. In this paper we consider ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- French government IDEX-ISITE initiative 16-IDEX-0001
- CPER of the “Région Auvergne-Rhône-Alpes,” the French Government, and FEDER from the European community
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 295Total Downloads
- Downloads (Last 12 months)295
- Downloads (Last 6 weeks)18
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in