Skip to search formSkip to main contentSkip to account menu

Conjunctive query

Known as: CQ 
In database theory, a conjunctive query is a restricted form of first-order queries. Many first-order queries can be written as conjunctive queries… 
Wikipedia (opens in a new tab)

Related topics

Related topics

27 relations
AC0Aggregate functionAnalysis of algorithmsAtomic formula

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
An anion-exchange strategy for 3D hierarchical (BiO)2CO3/amorphous Bi2S3 heterostructures with increased solar absorption and enhanced visible light photocatalysis
Bismuth-based nanostructured materials have attracted great interest in a wide range of applications. In the present work, 3D… 
2008
2008
Joining the results of heterogeneous search engines
2007
2007
Conjunctive Query Entailment for SHOQ
An important reasoning task, in addition to the standard DL reasoning services, is conjunctive query answering. In this paper, we… 
Highly Cited
2006
Highly Cited
2006
Adaptive searching in succinctly encoded binary relations and tree-structured documents
Highly Cited
2005
Highly Cited
2005
Impact of bond-order loss on surface and nanosolid magnetism
Highly Cited
2001
Highly Cited
2001
Design of CT and CQ filters using approximation and optimization
  • R. LevyP. Petre
  • IEEE MTT-S International Microwave Sympsoium…
  • 2001
  • Corpus ID: 24678201
A new design technique for CT filters has been derived commencing from the well-known Chebyshev all-pole prototype filter. One or… 
Review
2000
Review
2000
AgentSheets: an Interactive Simulation Environment with End-User Programmable Agents
Current Information Technology is mostly focused on accessing information and provides little support for processing information… 
1993
1993
Towards a Formal Approach for Object Database Design
1 Introduction This paper focuses on a formal approach* for advanced database modeling and design. It is based on the IF02 model… 
1991
1991
Computing With Almost Optimal Size Threshold Circuits
-We employ results from the theory of rational approximation to obtain almost tight lower bounds on the size (i.e. number of… 
1989
1989
A decision procedure for conjunctive query disjointness
This paper presents an algorithm that decides whether two conjunctive query expressions always describe disjoint sets of tuples… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)