A query language for NC

DOI10.1006/JCSS.1997.1525zbMATH Open0887.68024OpenAlexW2022357808MaRDI QIDQ1376409FDOQ1376409

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

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

zbMATH Keywords

relational databasesrelational algebra

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

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

Cited In (5)

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

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)