default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBas Ketsman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Brecht Vandevoort
, Bas Ketsman, Frank Neven:
When View- and Conflict-Robustness Coincide for Multiversion Concurrency Control. Proc. ACM Manag. Data 2(2): 91 (2024)- [j17]Brecht Vandevoort, Bas Ketsman, Frank Neven:
Allocating Isolation Levels to Transactions in a Multiversion Setting. SIGMOD Rec. 53(1): 16-23 (2024) - [j16]Bart Bogaerts, Bas Ketsman, Younes Zeboudj, Heba Aamer, Ruben Taelman, Ruben Verborgh:
Distributed Subweb Specifications for Traversing the Web. Theory Pract. Log. Program. 24(2): 394-420 (2024) - [c18]Tim Baccaert, Bas Ketsman:
Cascade: Optimal Transaction Scheduling for High-Contention Workloads. ICDE 2024: 5634-5638 - [i8]Brecht Vandevoort, Bas Ketsman, Frank Neven:
When View- and Conflict-Robustness Coincide for Multiversion Concurrency Control. CoRR abs/2403.17665 (2024) - 2023
- [j15]Brecht Vandevoort, Bas Ketsman, Christoph Koch, Frank Neven:
Robustness against Read Committed for Transaction Templates with Functional Constraints. Log. Methods Comput. Sci. 19(4) (2023) - [j14]Brecht Vandevoort, Bas Ketsman, Christoph Koch, Frank Neven:
When is it safe to run a transactional workload under Read Committed? SIGMOD Rec. 52(1): 36-43 (2023) - [c17]Brecht Vandevoort, Bas Ketsman, Christoph Koch, Frank Neven:
Detecting Robustness against MVRC for Transaction Programs with Predicate Reads. EDBT 2023: 565-577 - [c16]Tim Baccaert, Bas Ketsman:
Distributed Consistency Beyond Queries. PODS 2023: 47-58 - [c15]Brecht Vandevoort, Bas Ketsman, Frank Neven:
Allocating Isolation Levels to Transactions in a Multiversion Setting. PODS 2023: 69-78 - [i7]Brecht Vandevoort, Bas Ketsman, Christoph Koch, Frank Neven:
Detecting Robustness against MVRC for Transaction Programs with Predicate Reads. CoRR abs/2302.08789 (2023) - [i6]Bart Bogaerts, Bas Ketsman, Younes Zeboudj, Heba Aamer, Ruben Taelman, Ruben Verborgh:
Distributed Subweb Specifications for Traversing the Web. CoRR abs/2302.14411 (2023) - 2022
- [j13]Bas Ketsman, Paraschos Koutris:
Modern Datalog Engines. Found. Trends Databases 12(1): 1-68 (2022) - [j12]Bas Ketsman, Dan Suciu, Yufei Tao:
A Near-Optimal Parallel Algorithm for Joining Binary Relations. Log. Methods Comput. Sci. 18(2) (2022) - [j11]Bas Ketsman, Christoph Koch, Frank Neven, Brecht Vandevoort:
Concurrency control for database theorists. SIGMOD Rec. 51(4): 6-17 (2022) - [j10]Bas Ketsman, Christoph Koch, Frank Neven, Brecht Vandevoort:
Deciding Robustness for Lower SQL Isolation Levels. ACM Trans. Database Syst. 47(4): 13:1-13:41 (2022) - [c14]Brecht Vandevoort, Bas Ketsman, Christoph Koch, Frank Neven:
Robustness Against Read Committed for Transaction Templates with Functional Constraints. ICDT 2022: 16:1-16:17 - [c13]Brecht Vandevoort, Bas Ketsman, Christoph Koch, Frank Neven:
Robustness Against Read Committed: A Free Transactional Lunch. PODS 2022: 1-14 - [i5]Brecht Vandevoort, Bas Ketsman, Christoph Koch, Frank Neven:
Robustness against Read Committed for Transaction Templates with Functional Constraints. CoRR abs/2201.05021 (2022) - 2021
- [j9]Brecht Vandevoort, Bas Ketsman, Christoph Koch, Frank Neven:
Robustness against Read Committed for Transaction Templates. Proc. VLDB Endow. 14(11): 2141-2153 (2021) - [c12]Bart Bogaerts, Bas Ketsman, Younes Zeboudj, Heba Aamer, Ruben Taelman, Ruben Verborgh:
Link Traversal with Distributed Subweb Specifications. RuleML+RR 2021: 62-79 - [i4]Brecht Vandevoort, Bas Ketsman, Christoph Koch, Frank Neven:
Robustness against Read Committed for Transaction Templates. CoRR abs/2107.12239 (2021) - 2020
- [j8]Bas Ketsman, Aws Albarghouthi, Paraschos Koutris:
Distribution Policies for Datalog. Theory Comput. Syst. 64(5): 965-998 (2020) - [c11]Bas Ketsman, Christoph Koch:
Datalog with Negation and Monotonicity. ICDT 2020: 19:1-19:18 - [c10]Bas Ketsman, Christoph Koch, Frank Neven, Brecht Vandevoort:
Deciding Robustness for Lower SQL Isolation Levels. PODS 2020: 315-330 - [i3]Bas Ketsman, Dan Suciu, Yufei Tao:
A Near-Optimal Parallel Algorithm for Joining Binary Relations. CoRR abs/2011.14482 (2020)
2010 – 2019
- 2019
- [j7]Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation. ACM Trans. Comput. Log. 20(3): 18:1-18:24 (2019) - [c9]Bas Ketsman:
Formal Approaches to Querying Big Data in Shared-Nothing Systems. SIGMOD Conference 2019: 1115-1116 - 2018
- [c8]Bas Ketsman, Aws Albarghouthi, Paraschos Koutris:
Distribution Policies for Datalog. ICDT 2018: 17:1-17:22 - [c7]Bas Ketsman, Frank Neven, Brecht Vandevoort:
Parallel-Correctness and Transferability for Conjunctive Queries under Bag Semantics. ICDT 2018: 18:1-18:16 - 2017
- [b1]Bas Ketsman:
Asynchronous Adventures: Formal Approaches to Querying Big Data in Shared-Nothing Systems. Hasselt University, Belgium, 2017 - [j6]Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Reasoning on data partitioning for single-round multi-join evaluation in massively parallel systems. Commun. ACM 60(3): 93-100 (2017) - [j5]Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Transferability for Conjunctive Queries. J. ACM 64(5): 36:1-36:38 (2017) - [j4]Bas Ketsman, Frank Neven:
Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data. Theory Comput. Syst. 61(1): 233-260 (2017) - [j3]Tom J. Ameloot, Bas Ketsman, Frank Neven, Daniel Zinn:
Datalog Queries Distributing over Components. ACM Trans. Comput. Log. 18(1): 5:1-5:35 (2017) - [c6]Bas Ketsman, Dan Suciu:
A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries. PODS 2017: 417-428 - 2016
- [j2]Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Data partitioning for single-round multi-join evaluation in massively parallel systems. SIGMOD Rec. 45(1): 33-40 (2016) - [j1]Tom J. Ameloot, Bas Ketsman, Frank Neven, Daniel Zinn:
Weaker Forms of Monotonicity for Declarative Networking: A More Fine-Grained Answer to the CALM-Conjecture. ACM Trans. Database Syst. 40(4): 21:1-21:45 (2016) - [c5]Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation. ICDT 2016: 9:1-9:17 - 2015
- [c4]Bas Ketsman, Frank Neven:
Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data. ICDT 2015: 291-307 - [c3]Tom J. Ameloot, Bas Ketsman, Frank Neven, Daniel Zinn:
Datalog Queries Distributing over Components. ICDT 2015: 308-323 - [c2]Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Transferability for Conjunctive Queries. PODS 2015: 47-58 - [i2]Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation. CoRR abs/1512.06246 (2015) - 2014
- [c1]Tom J. Ameloot, Bas Ketsman, Frank Neven, Daniel Zinn:
Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the calm-conjecture. PODS 2014: 64-75 - [i1]Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Transferability for Conjunctive Queries. CoRR abs/1412.4030 (2014)
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-08-05 20:17 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:
