Computable queries for relational data bases
From MaRDI portal
Publication:1151060
DOI10.1016/0022-0000(80)90032-XzbMath0456.68128OpenAlexW2161609549WikidataQ56813556 ScholiaQ56813556MaRDI QIDQ1151060
Publication date: 1980
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(80)90032-x
Analysis of algorithms and problem complexity (68Q25) Information storage and retrieval of data (68P20) Other classical set theory (including functions, relations, and set algebra) (03E20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (85)
On inflationary fix-point operators safety ⋮ Computing queries with higher-order logics ⋮ Domain independence and the relational calculus ⋮ An overview of transaction logic ⋮ Certain answers as objects and knowledge ⋮ Model checking Petri nets with names using data-centric dynamic systems ⋮ First-order queries on databases embedded in an infinite structure ⋮ On rules of abduction. ⋮ Static and dynamic aspects of goal-oriented concurrency control ⋮ Arity and alternation: a proper hierarchy in higher order logics ⋮ Non-determinism in logic-based languages ⋮ Computable functions in tabular databases ⋮ Manipulation aspect of databases: The composition approach ⋮ On the expressive power of F-logic language ⋮ Finitely representable databases ⋮ A query language for NC ⋮ The complexity of the evaluation of complex algebra expressions ⋮ Descriptive characterizations of computational complexity ⋮ An alternative way to represent the cogroup of a relation in the context of nested databases ⋮ Metafinite model theory ⋮ Circumscribing DATALOG: expressive power and complexity ⋮ How expressive is stratified aggregation? ⋮ Domain-independent queries on databases with external functions ⋮ The Kolmogorov expressive power of Boolean query languages ⋮ Queries with arithmetical constraints ⋮ Linear constraint query languages expressive power and complexity ⋮ A query language for NC (extended abstract) ⋮ Structural characterizations of the navigational expressiveness of relation algebras on a tree ⋮ Scalar aggregation in inconsistent databases. ⋮ On measuring inconsistency in definite and indefinite databases with denial constraints ⋮ Hypothetical datalog: Complexity and expressibility ⋮ Partial fixed point for finite models in second order logic ⋮ Composition aspects of programmology. I ⋮ The consequences of eliminating NP solutions ⋮ On the primitivity of operators in SPARQL ⋮ Primitive program algebras of computable functions ⋮ Datalog extensions for database queries and updates ⋮ On the expressive power of database queries with intermediate types ⋮ Computing on structures ⋮ A comparison between algebraic query languages for flat and nested databases ⋮ Expressiveness of efficient semi-deterministic choice constructs ⋮ The expressiveness of a family of finite set languages ⋮ Principles of programming with complex objects and collection types ⋮ The expressive power of cardinality-bounded set values in object-based data models ⋮ Computing with infinitary logic ⋮ A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs ⋮ A semideterministic approach to object creation and nondeterminism in database queries ⋮ On the equivalence of recursive and nonrecursive Datalog programs ⋮ Equivalence of the relational algebra and calculus for nested relations ⋮ Metafinite model theory ⋮ Pseudofinite homogeneity, isolation, and reducibility ⋮ The powerset algebra as a natural tool to handle nested database relations ⋮ Algebraic and calculus query languages for recursively typed complex objects ⋮ A closed-form evaluation for Datalog queries with integer (gap)-order constraints ⋮ Query languages for hierarchic databases ⋮ Computable Queries for Object Oriented Databases ⋮ The navigational power of web browsers ⋮ Relational completeness of query languages for annotated databases ⋮ Completeness problems in classes of computable named functions ⋮ Expressibility of Higher Order Logics ⋮ On the expressibility and the computability of untyped queries ⋮ Database Theory, Yuri, and Me ⋮ On the expressiveness of linear-constraint query languages for spatial databases ⋮ Minimal-change integrity maintenance using tuple deletions ⋮ Structural recursion as a query language on lists and ordered trees ⋮ XI Latin American Symposium on Mathematical Logic ⋮ On the expressive power of the relational algebra with partially ordered domains ⋮ A technique for proving decidability of containment and equivalence of linear constraint queries ⋮ Procedural languages for database queries and updates ⋮ Negation in rule-based database languages: A survey ⋮ An extension of fixpoint logic with a symmetry-based choice construct ⋮ Fundamental properties of deterministic and nondeterministic extensions of Datalog ⋮ Calculi for symmetric queries ⋮ Queries and computation on the web ⋮ Structure and complexity of relational queries ⋮ The Relational Polynomial-Time Hierarchy and Second-Order Logic ⋮ Extended order-generic queries ⋮ Embedding deductive capabilities in relational database systems ⋮ Complete geometric query languages ⋮ An algebra for pomsets. ⋮ Abstract state machines and computationally complete query languages ⋮ Heuristics for Safety and Security Constraints ⋮ Hereditarily-finite sets, data bases and polynomial-time computability ⋮ Functional queries in datalog ⋮ Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theory of program structures: Schemes, semantics, verification
- On the expressive power of the relational algebra
- SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control
- On the power of programming features
- Equivalences among Relational Expressions
- Algorithmic properties of structures
- A relational model of data for large shared data banks
This page was built for publication: Computable queries for relational data bases
