20 papers:
- PODS-2015-CalauttiGP #termination
- Chase Termination for Guarded Existential Rules (MC, GG, AP), pp. 91–103.
- VLDB-2014-KonstantinidisA #constraints #integration #optimisation #scalability
- Optimizing the Chase: Scalable Data Integration under Constraints (GK, JLA), pp. 1869–1880.
- VLDB-2014-TozunAAM #named #transaction
- ADDICT: Advanced Instruction Chasing for Transactions (PT, IA, AA, AM), pp. 1893–1904.
- ICALP-v2-2014-GogaczM #decidability #termination
- All-Instances Termination of Chase is Undecidable (TG, JM), pp. 293–304.
- LICS-2013-GogaczM #convergence #finite
- Converging to the Chase — A Tool for Finite Controllability (TG, JM), pp. 540–549.
- VLDB-2011-GrecoST #termination
- Stratification Criteria and Rewriting Techniques for Checking Chase Termination (SG, FS, IT), pp. 1158–1168.
- CADE-2011-JovanovicM #integer #linear
- Cutting to the Chase Solving Linear Integer Arithmetic (DJ, LMdM), pp. 338–353.
- VLDB-2010-SpezzanoG #approach #constraints #termination
- Chase Termination: A Constraints Rewriting Approach (FS, SG), pp. 93–104.
- VLDB-2009-MeierSL #on the #termination
- On Chase Termination Beyond Stratification (MM, MS, GL), pp. 970–981.
- PODS-2008-DeutschNR #revisited
- The chase revisited (AD, AN, JBR), pp. 149–158.
- KR-2008-CaliGK #constraints #infinity #query #relational
- Taming the Infinite Chase: Query Answering under Expressive Relational Constraints (AC, GG, MK), pp. 70–80.
- ISSTA-2007-Trew #testing
- Chasing rainbows: improving software testing in the real world (TT), pp. 95–96.
- CSCW-2004-GarciaKF #effectiveness
- Cutting to the chase: improving meeting effectiveness by focusing on the agenda (ACBG, JCK, MAF), pp. 346–349.
- HT-2003-BollKW #game studies #hypermedia
- Paper chase revisited: a real world game meets hypermedia (SB, JK, CW), pp. 126–127.
- VMCAI-2003-CatanoH #ml #named #static analysis
- CHASE: A Static Checker for JML’s Assignable Clause (NC, MH), pp. 26–40.
- DAC-2002-SeryBD #question #why
- Life is CMOS: why chase the life after? (GS, SB, VD), pp. 78–83.
- SIGMOD-2000-PopaDST #question
- A Chase Too Far? (LP, AD, AS, VT), pp. 273–284.
- STOC-1999-PonzioRV #communication #complexity #pointer
- The Communication Complexity of Pointer Chasing: Applications of Entropy and Sampling (SP, JR, SV), pp. 602–611.
- PODS-1996-MaherS #dependence
- Chasing Constrained Tuple-Generating Dependencies (MJM, DS), pp. 128–138.
- SIGMOD-1984-Chan
- Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions (EPFC), pp. 149–163.