Campbell Fraser

Orcid: 0009-0005-2035-4409

According to our database1, Campbell Fraser authored at least 14 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
POLAR: Adaptive and Non-invasive Join Order Selection via Plans of Least Resistance.
Proc. VLDB Endow., February, 2024

2023
Kepler: Robust Learning for Parametric Query Optimization.
Proc. ACM Manag. Data, 2023

Kepler: Robust Learning for Faster Parametric Query Optimization.
CoRR, 2023

2018
Smooth Scan: robust access path selection without cardinality estimation.
VLDB J., 2018

2017

2015
Smooth Scan: Statistics-oblivious access paths.
Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

2013
Enhancements to SQL server column stores.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013

2012
Testing cardinality estimation models in SQL server.
Proceedings of the Fifth International Workshop on Testing Database Systems, 2012

2011
E-Learning for ICT Group Work in a Blended Learning Environment.
Int. J. Qual. Assur. Eng. Technol. Educ., 2011

1996
Consistent Subsequences and Supersequences.
Theor. Comput. Sci., 1996

Maximal Common Subsequences and Minimal Common Supersequences.
Inf. Comput., 1996

1994
Maximal Common Subsequences and Minimal Common Supersequences.
Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

1993
On the Worst-Case Behaviour of Some Approximation Algorithms for the Shortest Common Supersequence of k Strings.
Proceedings of the Combinatorial Pattern Matching, 4th Annual Symposium, 1993

1992
Two Algorithms for the Longest Common Subsequence of Three (or More) Strings.
Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, 1992


  Loading...