default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarl Schnaitter
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c8]Gokul Nath Babu Manoharan, Stephan Ellner, Karl Schnaitter, Sridatta Chegu, Alejandro Estrella-Balderrama, Stephan Gudmundson, Apurv Gupta, Ben Handy, Bart Samwel, Chad Whipkey, Larysa Aharkava, Himani Apte, Nitin Gangahar, Jun Xu, Shivakumar Venkataraman, Divyakant Agrawal, Jeffrey D. Ullman:
Shasta: Interactive Reporting At Scale. SIGMOD Conference 2016: 1393-1404- 2014
- [j7]David E. Simmen, Karl Schnaitter, Jeff Davis, Yingjie He, Sangeet Lohariwala, Ajay Mysore, Vinayak Shenoi, Mingfeng Tan, Yu Xiao:
Large-Scale Graph Analytics in Aster 6: Bringing Context to Big Data Discovery. Proc. VLDB Endow. 7(13): 1405-1416 (2014) - 2012
- [j6]Karl Schnaitter, Neoklis Polyzotis:
Semi-Automatic Index Tuning: Keeping DBAs in the Loop. Proc. VLDB Endow. 5(5): 478-489 (2012) - 2011
- [j5]Ivo Jimenez, Jeff LeFevre, Neoklis Polyzotis, Huascar Sanchez, Karl Schnaitter:
Benchmarking Online Index-Tuning Algorithms. IEEE Data Eng. Bull. 34(4): 28-35 (2011) - 2010
- [j4]Karl Schnaitter, Neoklis Polyzotis:
Optimal algorithms for evaluating rank joins in database systems. ACM Trans. Database Syst. 35(1): 6:1-6:47 (2010) - [c7]Nilesh N. Dalvi, Karl Schnaitter, Dan Suciu
:
Computing query probability with incidence algebras. PODS 2010: 203-214 - [c6]Ioannis Alagiannis, Debabrata Dash, Karl Schnaitter, Anastasia Ailamaki, Neoklis Polyzotis:
An automated, yet interactive and portable DB designer. SIGMOD Conference 2010: 1183-1186 - [i1]Karl Schnaitter, Neoklis Polyzotis:
Semi-Automatic Index Tuning: Keeping DBAs in the Loop. CoRR abs/1004.1249 (2010)
2000 – 2009
- 2009
- [j3]Karl Schnaitter, Neoklis Polyzotis, Lise Getoor:
Index Interactions in Physical Design Tuning: Modeling, Analysis, and Applications. Proc. VLDB Endow. 2(1): 1234-1245 (2009) - [j2]Karl Schnaitter, Joshua Spiegel, Neoklis Polyzotis:
Depth estimation for ranking query optimization. VLDB J. 18(2): 521-542 (2009) - [c5]Karl Schnaitter, Neoklis Polyzotis:
A Benchmark for Online Index Selection. ICDE 2009: 1701-1708 - 2008
- [j1]Ioana Manolescu, Loredana Afanasiev, Andrei Arion, Jens Dittrich, Stefan Manegold, Neoklis Polyzotis, Karl Schnaitter, Pierre Senellart, Spyros Zoupanos, Dennis E. Shasha:
The repeatability experiment of SIGMOD 2008. SIGMOD Rec. 37(1): 39-45 (2008) - [c4]Karl Schnaitter, Neoklis Polyzotis:
Evaluating rank joins with optimal cost. PODS 2008: 43-52 - 2007
- [c3]Karl Schnaitter, Serge Abiteboul, Tova Milo, Neoklis Polyzotis:
On-Line Index Selection for Shifting Workloads. ICDE Workshops 2007: 459-468 - [c2]Karl Schnaitter, Joshua Spiegel, Neoklis Polyzotis:
Depth Estimation for Ranking Query Optimization. VLDB 2007: 902-913 - 2006
- [c1]Karl Schnaitter, Serge Abiteboul, Tova Milo, Neoklis Polyzotis:
COLT: continuous on-line tuning. SIGMOD Conference 2006: 793-795
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 2024-04-25 05:55 CEST 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:
