A query language for NC

DOI10.1006/JCSS.1997.1525MaRDI QIDQ1376409zbMATHOpenAlexFDO

Authors Dan Suciu, Val Tannen

Publication date 17 December 1997

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

Full work available at URL https://semanticscholar.org/paper/05c4803c54775be1de33aa4e9cde64679f17d840

zbMATH Keywords

relational databasesrelational algebra

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• A query language for NC (extended abstract)
• scientific article; zbMATH DE number 1903404
• scientific article; zbMATH DE number 1629811
• Query languages for hierarchic databases
• Towards a semantic query language
• A query language for logic architectures
• A query language based on term matching and rewriting
• scientific article; zbMATH DE number 1319352

Cites work

• scientific article; zbMATH DE number 176199 (Why is no real title available?)
• scientific article; zbMATH DE number 176725 (Why is no real title available?)
• scientific article; zbMATH DE number 1142303 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• A taxonomy of problems with fast parallel algorithms
• An optimal lower bound on the number of variables for graph identification
• Bounded fixpoints for complex objects
• Computable queries for relational data bases
• Datalog extensions for database queries and updates
• Elementary induction on abstract structures
• Expressibility and Parallel Complexity
• Finite-model theory -- A personal perspective
• Fixpoint logics, relational machines, and computational complexity
• Hereditarily-finite sets, data bases and polynomial-time computability
• Infinitary logic and inductive definability over finite structures
• Languages that Capture Complexity Classes
• On uniformity within \(NC^ 1\)
• Principles of programming with complex objects and collection types
• Relational queries computable in polynomial time
• Simulation of Parallel Random Access Machines by Circuits
• The expressiveness of a family of finite set languages
• The relational model with relation-valued attributes
• Tractable query languages for complex object databases
• Upper and lower bounds for first order expressibility

Cited in

(5)

• Query languages for bags and aggregate functions
• The complexity of the evaluation of complex algebra expressions
• Bounded fixpoints for complex objects
• Separating NC along the \(\delta\) axis
• A query language for NC (extended abstract)

This page was built for publication: A query language for NC

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