default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCampbell Fraser
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]David Justen, Daniel Ritter, Campbell Fraser, Andrew Lamb, Nga Tran, Allison Lee, Thomas Bodner, Mhd Yamen Haddad, Steffen Zeuch, Volker Markl, Matthias Boehm:
POLAR: Adaptive and Non-invasive Join Order Selection via Plans of Least Resistance. Proc. VLDB Endow. 17(6): 1350-1363 (2024)- 2023
- [j5]Lyric Doshi
, Vincent Zhuang, Gaurav Jain, Ryan Marcus, Haoyu Huang, Deniz Altinbüken, Eugene Brevdo, Campbell Fraser:
Kepler: Robust Learning for Parametric Query Optimization. Proc. ACM Manag. Data 1(1): 109:1-109:25 (2023) - [i1]Lyric Doshi, Vincent Zhuang, Gaurav Jain, Ryan Marcus, Haoyu Huang, Deniz Altinbüken, Eugene Brevdo, Campbell Fraser:
Kepler: Robust Learning for Faster Parametric Query Optimization. CoRR abs/2306.06798 (2023)
2010 – 2019
- 2018
- [j4]Renata Borovica-Gajic, Stratos Idreos, Anastasia Ailamaki, Marcin Zukowski, Campbell Fraser:
Smooth Scan: robust access path selection without cardinality estimation. VLDB J. 27(4): 521-545 (2018) - 2017
- [c7]David F. Bacon, Nathan Bales, Nicolas Bruno, Brian F. Cooper, Adam Dickinson, Andrew Fikes, Campbell Fraser, Andrey Gubarev, Milind Joshi, Eugene Kogan, Alexander Lloyd, Sergey Melnik, Rajesh Rao, David Shue, Christopher Taylor, Marcel van der Holst, Dale Woodford:
Spanner: Becoming a SQL System. SIGMOD Conference 2017: 331-343 - 2015
- [c6]Renata Borovica-Gajic, Stratos Idreos, Anastasia Ailamaki, Marcin Zukowski, Campbell Fraser:
Smooth Scan: Statistics-oblivious access paths. ICDE 2015: 315-326 - 2013
- [c5]Per-Åke Larson, Cipri Clinciu, Campbell Fraser, Eric N. Hanson, Mostafa Mokhtar, Michal Nowakiewicz, Vassilis Papadimos, Susan L. Price, Srikumar Rangarajan, Remus Rusanu, Mayukh Saubhasik:
Enhancements to SQL server column stores. SIGMOD Conference 2013: 1159-1168 - 2012
- [c4]Campbell Fraser, Leo Giakoumakis, Vikas Hamine, Katherine F. Moore-Smith:
Testing cardinality estimation models in SQL server. DBTest 2012: 12 - 2011
- [j3]Lisa Soon, Campbell Fraser:
E-Learning for ICT Group Work in a Blended Learning Environment. Int. J. Qual. Assur. Eng. Technol. Educ. 1(2): 50-60 (2011)
1990 – 1999
- 1996
- [j2]Campbell Fraser, Robert W. Irving, Martin Middendorf:
Maximal Common Subsequences and Minimal Common Supersequences. Inf. Comput. 124(2): 145-153 (1996) - [j1]Campbell Fraser:
Consistent Subsequences and Supersequences. Theor. Comput. Sci. 165(2): 233-246 (1996) - 1994
- [c3]Robert W. Irving, Campbell Fraser:
Maximal Common Subsequences and Minimal Common Supersequences. CPM 1994: 173-183 - 1993
- [c2]Robert W. Irving, Campbell Fraser:
On the Worst-Case Behaviour of Some Approximation Algorithms for the Shortest Common Supersequence of k Strings. CPM 1993: 63-73 - 1992
- [c1]Robert W. Irving, Campbell Fraser:
Two Algorithms for the Longest Common Subsequence of Three (or More) Strings. CPM 1992: 214-229
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
