Chase (algorithm)

Known as: Chase 
The Chase is a simple fixed-point algorithm testing and enforcing implication of data dependencies in database systems. It plays important roles in… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The chase is a family of algorithms used in a number of data management tasks, such as data exchange, answering queries under… (More)
  • table 1
  • table 2
  • figure 1
  • table 4
  • figure 2
Is this relevant?
2017
2017
Although sororities are often perceived as contributing to eating disordered behavior, limited research has investigated eating… (More)
Is this relevant?
2011
2011
The Chase is a fixpoint algorithm enforcing satisfaction of data dependencies in databases. Its execution involves the insertion… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2011
2011
Turbo product codes (TPC) are very suitable for applications requiring a large code length, a high code-rate, and good error… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Attribute based encryption (ABE) [13] determines decryption ability based on a user's attributes. In a multi-authority ABE scheme… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We revisit the standard chase procedure, studying its properties and applicability to classical database problems. We settle (in… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We introduce a new family of detectors for multiple-input multiple-output (MIMO) channels. These detectors are called Chase… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
After a brief description of purse seining and the other methods used to catch yellowfin tuna in the eastern Pacific Ocean, some… (More)
  • figure 1
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
1997
1997
I study the dynamics of a simple quantitative genetic model describing coevolution of two antagonistic species of the victim… (More)
  • figure 3
Is this relevant?
1982
1982
The wandering spider Cupiennius salei Keys uses idiothetic orientation, i.e., memorized information about its own previous… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?