Relational queries computable in polynomial time
Information and Control
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
A probabilistic framework for vague queries and imprecise information in databases
Proceedings of the sixteenth international conference on Very large databases
The expressive power of stratified logic programs
Information and Computation
Complex transitive closure queries on a fragmented graph
ICDT '90 Proceedings of the third international conference on database theory on Database theory
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Principles of Database Systems
Principles of Database Systems
Information Retrieval
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Iris Architecture and Implementation
IEEE Transactions on Knowledge and Data Engineering
Design of an Integrated Information Retrieval/Database Management System
IEEE Transactions on Knowledge and Data Engineering
A Foundation for Evolution from Relational to Object Databases
EDBT '88 Proceedings of the International Conference on Extending Database Technology: Advances in Database Technology
Algebraic Properties of Bag Data Types
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Currency exchange rate forecasting from news headlines
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
Research Frontiers in Object Technology
Information Systems Frontiers
IEEE Transactions on Knowledge and Data Engineering
Distributed mining of classification rules
Knowledge and Information Systems
Recursive Queries in Product Databases
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
ACM SIGMOD Record
Hi-index | 0.00 |
Two main topics are addressed. First, an algebraic approach is presented to define a general notion of expressive power. Heterogeneous algebras represent information systems and morphisms represent the correspondences between the instances of databases, the correspondences between answers, and the correspondences between queries. An important feature of this new notion of expressive power is that query languages of different types can be compared with respect to their expressive power. In the case of relational query languages, the new notion of expressive power is shown to be equivalent to the notion used by Chandra and Harel. In the case of nonrelational query languages, the versatility of the new notion of expressive power is demonstrated by comparing the fixpoint query languages with an object-oriented query language called FQL. The expressive power of the Functional Query Language FQL is the second main topic of this paper. The specifications of FQL functions can be recursive or even mutually recursive, FQL has a fixpoint semantics based on a complete lattice consisting of bag functions. The query language FQL is shown to be more expressive than the fixpoint query languages. This result implies that FQL is also more expressive than Datalog with stratified negation. Examples of recursive FQL functions are given that determine the ancestors of persons and the bill of materials.