Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
skip to main content
ACM Digital Library home
ACM Association for Computing Machinery corporate logo
Advanced Search

SIGMOD Track

Author Guidelines

How to Submit

New submissions will be considered four times a year, according to the following deadlines: January 15 (Cycle A), April 15 (Cycle B), July 15 (Cycle C), October 15 (Cycle D). At this point, PACMMOD does not accept journal-only submissions. All papers that have been accepted for publication will be presented at the ACM SIGMOD conference. Current submission instructions can be found here: https://2024.sigmod.org/calls_papers_sigmod_research.shtml

Duplicate Submissions and Novelty Requirement

Following the ACM guidelines, a research paper submitted to PACMMOD cannot be under review for any other publishing forum or presentation venue, including conferences, workshops, and journals, during the time it is being considered for publication at PACMMOD. Furthermore, after you submit a research paper to PACMMOD, you must await the response from PACMMOD and only re-submit elsewhere if your paper is rejected—or withdrawn at your request—from PACMMOD. This restriction applies not only to identical papers but also to papers with a substantial overlap in scientific content and results.

To enforce this requirement, the high-level metadata of submissions (title, abstract, list of authors), may be shared with the Program Chairs / Editors of other conferences and journals.

Every submitted research paper must present substantial novel research not described in any prior publication. In this context, a prior publication is (a) a paper of five pages or more, presented, or accepted for presentation, at a refereed conference or workshop with proceedings; or (b) an article published, or accepted for publication, in a refereed journal. If a submission has overlap with a prior publication, the submission must cite the prior publication (respecting the double anonymity requirement), and clearly indicate which parts of the work appeared in prior publications and which parts are novel to the current submission.

Any violation of the policy will trigger an investigation and appropriate penalties per ACM-wide policy on Penalties for Publication Violations. 

Length, File Type, and Formatting 

Length and Format for Submitted Papers

All submitted research papers must be formatted according to the instructions below. The main content of the paper must be no more than 12 pages in length with the 2 column regular ACM SIG proceedings style (www.scomminc.com/pp/acmsig/ACM-sample-sigconf.pdf), although we allow an unlimited number of pages for the bibliography. No appendix is allowed. 

Length and Format for Revised Papers

For all papers, authors are allowed one extra page to help address reviewer comments in the revised version. Therefore, the length of camera ready papers can be up to 13 pages (+ unlimited number of pages for the bibliography).

Length and Format for Camera-Ready Papers

Camera-ready papers are to be formatted using the 1 column ACM Small Journal style (https://www.scomminc.com/pp/acmsig/ACM-sample-acmsmall.pdf). All camera-ready papers are limited to 24 pages plus an unlimited number of pages for the bibliography. No appendix is allowed. Camera-ready papers should not include any new content beyond the accepted submission version of the manuscript.

Inclusion and Diversity in Writing

We value Diversity and Inclusion in our community and professions. Both are important in our writing as well. Diversity of representation in writing is a simple but visible avenue to celebrate and ultimately help improve our community's diversity. Be mindful in your writing of not using language or examples that further the marginalization, stereotyping, or erasure of any group of people, especially historically marginalized and/or under-represented groups (URGs) in computing. Be vigilant and guard against unintentionally exclusionary examples. Please visit this page for many examples of both exclusionary writing to avoid and inclusive writing that celebrates diversity to consider adopting: https://dbdni.github.io/pages/inclusivewriting.html.

Authors are further encouraged to follow the tips and guidelines provided at: https://dbdni.github.io/#materials. 

Reviewers will be empowered to monitor and demand changes if such issues arise. Going further, also consider actively raising the representation of URGs in writing. Please see https://www.acm.org/diversity-inclusion/words-matter for inclusive alternatives for some of the terms commonly used in the computing profession.

Anonymity Requirements

Unless otherwise specified by the Managing Editors for specific journal tracks, PACMMOD papers are expected to go through a double anonymous review process, following the three principles put forward in (Snodgrass 2007): authors should not be required to go to great lengths to anonymize their submissions; comprehensiveness of the review trumps anonymizing efficacy; Associate Editors retain flexibility and authority in managing the reviewing process.

All reviewers, except the Associate Editors, who review the submission will not know the identity of the authors. To ensure anonymity of authorship from the reviewers, authors must at least do the following:

  • Authors' names and affiliations must not appear on the title page or elsewhere in the submission.
  • Funding sources must not be acknowledged anywhere in the submission.
  • Research group members, or other colleagues or collaborators, must not be acknowledged anywhere in the submission.
  • The paper’s file name must not identify the authors of the submission.
  • Source file naming must also be done with care, to avoid identifying the authors' names in the submission's associated metadata. For example, if your name is Jane Smith and you submit a PDF file generated from a .dvi file called Jane-Smith.dvi, your authorship could be inferred by looking into the PDF file.

To avoid compromising the double-anonymity requirement, we request that the authors refrain from publicizing their submissions. In addition, we encourage the authors to refrain from uploading versions of their submitted manuscripts to pre-publication servers, such as arXiv, and other online forums during the reviewing period (if a version of a submission already resides on a pre-publication server, such as arXiv, the authors do not need to remove it before submitting to PACMMOD).  As of today, ACM Policy on Authorship states that venues must continue to allow authors to deposit their manuscripts on arXiv, other non-commercial and legally mandated repositories, their personal home page, or institutional repository.  Consequently, we expect reviewers to make reasonable efforts not to discover authors' identities, and no preferential treatment will be given to authors who have refrained from uploading their submitted manuscript to pre-publication servers and other online forums. The challenge of upholding double-anonymous peer review while also allowing authors to upload preprint versions of their manuscripts is an ongoing discussion with the ACM Publications Board and this policy may change in the future. You must also use care in referring to related past work, particularly your own, in the paper. For example, if you are Jane Smith, the following text gives away the authorship of the submitted paper:

In our previous work [1, 2], we presented two algorithms for ... In this paper, we build on that work by ...

Bibliography

[1] Jane Smith, "A Simple Algorithm for ...," Proceedings of ACM SIGMOD 1997, pp. 1 - 10. 

[2] Jane Smith, "A More Complicated Algorithm for ...," Proceedings of ACM SIGMOD 1998, pp. 34 - 44.

The solution is to reference one's past work in the third person. This allows setting the context for your submission, while at the same time preserving anonymity:

In previous work [1, 2], algorithms were presented for ... In this paper, we build on that work by ...

Bibliography

[1] Jane Smith, "A Simple Algorithm for ...," Proceedings of ACM SIGMOD 1997, pp. 1 - 10.

[2] Jane Smith, "A More Complicated Algorithm for ...," Proceedings of ACM SIGMOD 1998, pp. 34 - 44.

Despite the anonymity requirements, you should still include all relevant work of your own in the references, using the above style; omitting them could potentially reveal your identity by negation. However, self-references should be limited to the essential ones, and extended versions of the submitted paper (e.g., technical reports or URLs for downloadable versions) must not be referenced.

Common sense and careful writing can go a long way toward preserving anonymity without diminishing the quality or impact of a paper. The goal is to preserve anonymity while still allowing the reader to fully grasp the context (related past work, including your own) of the submitted paper. In past years, this goal has been achieved successfully by thousands of papers.

It is the responsibility of authors to do their very best to preserve anonymity. Papers that do not follow the guidelines here, or otherwise potentially reveal the identity of the authors, are subject to immediate rejection.

Artifacts and Reproducibility

PACMMOD strives to establish a culture where sharing research artifacts (data, results, code, and scripts) is the norm rather than an exception. PACMMOD reproducibility has three goals: (a) Highlighting the impact of database research papers; (b) enabling easy dissemination of research results; and (c) enabling easy sharing of code and experimentation set-ups. In this context, we expect all papers to make their code, data, scripts, and notebooks available if this is possible. Although it is not mandatory for acceptance, providing this extra material can help reviewers evaluate your work more thoroughly. Papers published at PACMMOD which have been successfully reproduced are also recognized and highlighted as such in the ACM Digital Library.

Please include a link with your materials in the text box provided in the submission form at the time of submission. For submissions, the link and materials should preserve anonymity. For example this may be an anonymous GitHub repository. You may want to make sure that the link you provide is not indexed by search engines. On GitHub, you can do so by adding the following to the page head:

<meta name="robots" content="noindex">

We recognize that at the time of submission authors focus on fine-tuning the paper, and so we expect this link to be live within two weeks from submission. Reviewers that may need to look at the materials will not do so earlier than that. We do not expect a fully polished submission in terms of automatically reproducing results, but rather a reasonably clean version of the state of the code when submitting the paper. Please, do not use a shortened link which traces who accesses it.

In the event that you are not able to submit your code, data, scripts, and notebooks please explain in the text box provided in the submission form why this is the case.

Conflicts of Interest

During submission of a research paper, the submission site will request information about conflicts of interest of the paper’s authors with program committee (PC) members. It is the full responsibility of all authors of a paper to identify all and only their potential conflict-of-interest PC members, according to the definition below. Papers with incorrect or incomplete conflict of interest information as of the submission closing time are subject to immediate rejection.

 A paper author has a conflict of interest with a PC member when, and only when, one or more of the following conditions holds:

  • The PC member is a co-author of the paper.
  • The PC member has been a co-worker in the same company or university within the past ten years.
  • The PC member has been a collaborator within the past ten years. Collaborations are indicated by prior co-authorships, shared grant funding, and close research relationships, even if those have not yet resulted in common publications. Publications (typically with a large set of authors) that fall outside the traditional sense of research collaborations (e.g., “The Seattle Report on Database Research”, “ Diversity and Inclusion Activities in Database Conferences: A 2021 Report”, etc.) do not in themselves constitute a COI.
  • The PC member is or was the author's primary thesis advisor, no matter how long ago.
  • The author is or was the PC member's primary thesis advisor, no matter how long ago.
  • The PC member is a relative or close personal friend of the author.

To identify any potentially spurious conflicts, PC members may be asked to confirm declared conflicts with submitting authors.

ORCID Requirements

ACM requires that all accepted journal authors register and provide ACM with valid ORCIDs prior to paper publication. Corresponding authors are responsible for collecting these ORCIDs from co-authors and for providing them to ACM as part of the ACM eRights selection process. For journals using the ScholarOne submission system, the submitting author will be required to provide their own ORCID upon submission. Authors are strongly encouraged, but not required, to include ORCIDs for all authors in their source files.  Please note: ACM only requires you to complete the initial ORCID registration process. However, ACM encourages you to take the additional step to claim ownership of all your published works via the ORCID site.

ORCID provides a persistent digital identifier that distinguishes you from every other researcher through integration in key research workflows such as manuscript and grant submission and supports automated linkages between you and your professional activities - ensuring that your work receives proper recognition. This requirement will also enable ACM to provide improvements to the normalization process of ACM Digital Library author profile data, aid in the detection of undeclared conflicts of interest and other publications-related misconduct in ACM Publications, assist with the implementation of ACM Open, and offer a host of other researcher benefits to ACM authors and the scientific community.

Before submission, the corresponding author should register for an ORCID.  Your co-authors should also create their individual ORCIDs at that time and add them to their accounts in the manuscript submission system. Otherwise, you will need to enter them manually into the ACM rights system upon paper acceptance and before publication in the ACM Digital Library. Simple instructions for complying with this mandate are provided inside the ACM eRights system.

ORCID information for all authors will appear on the article’s page in the ACM Digital Library. If ORCIDs are included in an article’s source files, they will also be linked in the published output.

The ACM ORCID FAQ should answer many of your questions.

ACM Policies

ACM Publications Policy on Research Involving Human Participants and Subjects

As a published ACM author, you and your co-authors are subject to all ACM Publications Policies, including ACM's new Publications Policy on Research Involving Human Participants and Subjects.

ACM Conflict of Interest (COI) Policy

The ACM Conflict of Interest (COI) Policy describes what a COI is, who is responsible for being aware of such conflicts, how to manage COIs, and how to report violations.

ACM Peer Review Policy

ACM recognizes that the quality of a refereed publication rests primarily on the impartial judgment of their volunteer reviewers. Expectations of reviewers and ACM can be found in the Reviewer section of the Policy on Roles and Responsibilities in ACM Publishing page.

Templates

Manuscripts accepted for publication in any ACM publication must be formatted using the ACM authoring template. Submissions must also use the ACM authoring templates. ACM style files will closely approximate the final output, enabling authors to judge the page-length of their published articles.

ACM authoring templates and detailed instructions on formatting can be found at http://www.acm.org/publications/authors/submissions. For both Word and Latex technical support, contact [email protected].

ACM Computing Classification System (CCS)

If your paper has been accepted, please read the HOW TO CLASSIFY WORKS USING ACM'S COMPUTING CLASSIFICATION SYSTEM for instructions on how to classify your document using the CCS and insert the index terms into your LaTeX or Microsoft Word source file. Providing the proper indexing and retrieval information from the CCS provides the reader with quick content reference, facilitating the search for related literature, as well as searches for your work in ACM's Digital Library and on other online resources.

Author Rights

ACM authors can manage their publication rights in either of the following ways:

  • A license granting ACM non-exclusive permission to publish—allowing authors to self-manage all rights to their work by choosing to pay for perpetual open access from the ACM Digital Library.
  • A publishing license agreement granting ACM exclusive publication rights—by granting ACM the right to serve as the exclusive publisher of a work and to manage ongoing rights and permissions associated with the work, including the right to defend it against improper use by third parties. (This license is roughly the equivalent of ACM’s traditional Copyright Transfer Agreement except that the author continues to hold copyright.)

As of January 2023, per decision of the ACM Publications Board, the traditional Copyright Transfer Agreement option is no longer available for ACM authors.  ACM will continue to defend all ACM-published works against improper use when allegations of publication-related misconduct are brought to light.  For more information please refer to this article in The Blue Diamond.

Additionally, ACM authors may post all versions of their work, with the exception of the final published "Version of Record", to non-commercial repositories such as ArXiv. See the ACM Author Rights page for additional information.

Learn more, including about posting to pre-print servers and institutional repositories, by visiting the ACM Author Rights page.

Open Access

ACM has made a commitment to become a fully sustainable and Plan S compliant Open Access (OA) scholarly publisher within approximately five years. ACM offers a number of ways to achieve this goal, including Hybrid OA, Gold OA, and the ACM OPEN program.

Most ACM journals, with the following exceptions, are Hybrid OA.  ACM Gold OA journals are:

Click here to view the Article Processing Charges (APCs) to publish your article Open Access.

Additionally, all corresponding authors from an institution participating in ACM OPEN will have their research articles published OA at the time of publication at no cost to the authors.  Click here for a list of participating institutions. To ensure eligibility for the program, corresponding authors from participating institutions must use their institutional email address upon submission.

Language Services

ACM has partnered with International Science Editing (ISE) to provide language editing services to ACM authors. ISE offers a comprehensive range of services for authors including standard and premium English language editing, as well as illustration and translation services, and also has significant outreach in China. Editing is available for both Word and LaTeX files. As an ACM author, you will receive a generous discount on ISE editing services. To take advantage of this partnership, visit the Dedicated ACM Editing Service. (Editing services are at author expense and do not guarantee publication of a manuscript.)

Author-izer Service

Once your manuscript is published, this service allows you to generate and post a link on your home page or institutional repository to your published article. This link will let any visitors to your personal bibliography pages download the definitive version of the articles for free from the ACM DL. These downloads will be recorded as part of your DL usage statistics. A detailed description of the service and instructions for its use may be found at the ACM Author-Izer Service page.

LaTeX Collaborative Authoring Tool on Overleaf Platform

ACM has partnered with https://www.overleaf.com/, a free cloud-based, authoring tool, to provide an ACM LaTeX authoring template. Authors can easily invite colleagues to collaborate on their document. Among other features, the platform automatically compiles the document while an author writes, so the author can see what the finished file will look like in real time. Further information can be found at https://www.acm.org/publications/authors/submissions. The ACM LaTeX template on Overleaf platform is available to all ACM authors https://www.overleaf.com/gallery/tagged/acm-official#.WOuOk2e1taQ.

Kudos Article Sharing Platform

Kudos is a free service that you can use to promote your work more effectively. After your paper has been accepted and uploaded to the ACM Digital Library, you'll receive an invitation from Kudos to create an account and add a plain-language description. The Kudos “Shareable PDF” allows you to generate a PDF to upload to websites, such as your homepage, institutional repository, preprint services, and social media. This PDF contains a link to the full-text version of your article in the ACM DL, adding to download and citation counts.

Author Gateway

Please be sure to visit the ACM Author Portal for additional important author information.

Contact Us

For further assistance and questions regarding the journal editorial review process and paper assignment to an issue, contact the journal administrator ([email protected]).

Reviewer Guidelines

The editorial board manages all submissions to PACMMOD:

  • Editor-in-Chief and Managing Editors whose primary role is to assign new submissions to appropriate Associate Editors and ensure that reviewing processes run smoothly.
  • Associate Editors whose responsibility is to oversee review discussions, help ensure review quality, and provide meta-reviews and initial recommendations.
  • Reviewer Board members (referred to as reviewers) whose primary responsibility is to review individual submissions.

PACMMOD follows a two phase review process. Papers that do not conform to the submission requirements (e.g., violation of  double anonymity requirement, text formatting) will receive a desk-reject and will not be reviewed. An early notification will be sent to the authors within two weeks from the submission deadline. The remaining papers will go through a two-phase reviewing process. After the first phase, if there is already a consensus on rejecting a paper, the paper will be rejected and the authors will receive an early-reject notification. The remaining papers will receive a second round of reviews, as outlined below:

  • Conflict-of-interest check and Associate Editor and reviewer assignment ~ 5 Days
  • Review period ~ 1 Month
  • Review quality check ~ 5 days
  • Authors feedback ~ 2 days
  • Reviewer discussion ~ 2 weeks
  • Associate Editors provide meta-reviews and recommendations ~ 3 days
  • Notification (accept subject to revisions; reject) ~ 3 days
  • Revised paper submission (including written response) ~ 1 month
  • Second round of reviews of revised papers  ~ 10 days
  • Associate Editors’ final meta-reviews and recommendations (reject, shepherding, accept) ~ 3 days
  • Final notification accept/reject ~ 3 days

Each submission will first receive at least three reviews. At the discretion of the Managing and Associate Editors, additional reviewers may be assigned.

Before the discussion phase starts between reviewers and decisions are made, authors will have an opportunity to read the reviews and submit optional brief feedback. The sole purpose of the author feedback is to clarify misunderstandings and factual errors through pointers to specific text in the submitted paper. As an example, a reviewer may have overlooked a part of the discussion in the paper and state that the paper fails to compare with a certain method; an example feedback will be of the form "see Section 2.4, paragraph 3". If no factual errors exist in the reviews, author feedback is not needed.

Some authors will be invited to submit a revised version of their paper. Authors will have one month to implement the revision items. The revision process is intended to be a constructive partnership between reviewers and authors. To this end, reviewers will be instructed to request revisions only in constructive scenarios with specific requests. In turn, authors bear the responsibility of attempting to meet those requests within the stated time frame, or of withdrawing the paper from submission. Common revision requests can include ''justify a crucial assumption'', ''present a real(istic) scenario where the defined problem occurs'', ''clean up notation'', ''tighten presentation'', ''compare against some relevant previous system'', ''show experimental results with better data, such as at larger scale or from a real system''. Revisions will not be requested to address lack of technical depth or novelty or where the revised paper will address a substantially different problem from the original. In certain cases, rejected papers may be encouraged to "resubmit".

One extra content page is allowed after the first review to accommodate the requested revision items. The revised submission should include a cover letter (up to 4 pages) to summarize how the authors have addressed the requested revisions. Authors are expected to highlight parts of their revised manuscripts that are edited in a different color to ease their identification by the reviewers.

Review Board

  • Ziawasch Abedjan, Leibniz Universität Hannover
  • Azza Abouzied, New York University Abu Dhabi
  • Foto Afrati, National Technical University of Athens, Greece
  • Massimiliano Albanese, George Mason University
  • Rana Alotaibi, Microsoft Gray Systems Lab
  • Yael Amsterdamer, Bar-Ilan University
  • Walid Aref, Purdue
  • Jorge Arnulfo Quiane Ruiz, IT University of Copenhagen
  • Joy Arulraj, Georgia Tech
  • Abolfazl Asudeh, University of Illinois Chicago, USA
  • Manos Athanassoulis, Boston University
  • Oana Balmau, McGill, Canada
  • Farnoush Banaei-Kashani, University of Colorado Denver
  • Prithu Banerjee, UBC
  • Senjuti Basu Roy, NJIT
  • Kaustubh Beedkar, Technische Universität Berlin
  • Sonia Bergamaschi, Università di Modena e Reggio Emilia
  • Spyros Blanas, The Ohio State University
  • Alexander Boehm, SAP SE
  • Matthias Boehm, Technische Universität Berlin
  • Philippe Bonnet, IT Univ Copenhagen, Denmark
  • Pierre Bourhis, CNRS, UMR 9189 Cristal, Inria
  • Yang Cao, Hokkaido University
  • Paris Carbone, KTH Royal Institute of Technology
  • Barbara Carminati, University of Insubria
  • Raul Castro Fernandez, The University of Chicago
  • Chee-Yong Chan, National University of Singapore
  • Subarna Chatterjee, Harvard University, USA
  • Surajit Chaudhuri, Microsoft
  • Shimin Chen, Chinese Academy of Sciences
  • Byron Choi, Hong Kong Baptist University
  • Theodoros Chondrogiannis, University of Konstanz
  • Farhana Choudhury, The University of Melbourne
  • Omar Chowdhury, Stony Brook University
  • Vassilis Christophides, ENSEA
  • Gao Cong, Nanyang Technological University
  • Natacha Crooks, University of California Berkeley
  • Andrew Crotty, Northwestern University
  • Sudipto Das, Amazon Web Services
  • Niv Dayan, University of Toronto
  • Sabrina De Capitani di Vimercati, Università degli Studi di Milano
  • Shaleen Deep, Microsoft Gray Systems Lab
  • Ioannis Demertzis, University of California Santa Cruz
  • Çağatay Demiralp, Sigma Computing
  • Amol Deshpande, University of Maryland
  • Bailu Ding, Microsoft Research
  • Dujian Ding, University of British Columbia
  • Jens Dittrich, Saarland University
  • Eduard Dragut, Temple University
  • Stefania Dumbrava, ENSIIE, France
  • Karima Echihabi, Mohammed VI Polytechnic University
  • Ahmed El-Roby, Carleton University
  • Ahmed Eldawy, University of California Riverside, USA
  • Venkatesh Emani, Microsoft
  • Anna Fariha, University of Utah
  • Hakan Ferhatosmanoglu, University of Warwick and Amazon Web Services
  • Elena Ferrari, University of Insubria Varese
  • Donatella Firmani, Sapienza University
  • Sara Foresti, Università degli Studi di Milano
  • Avigdor Gal, Technion - Israel Institute of Technology
  • Sainyam Galhotra, University of Chicago
  • Junhao Gan, University of Melbourne
  • Tingjian Ge, University of Massachusetts Lowell
  • Johannes Gehrke, Microsoft
  • Rainer Gemulla, Universität Mannheim
  • Gabriel Ghinita Hamad, Bin Khalifa University
  • Amir Gilad, Duke University
  • Boris Glavic, Illinois Institute of Technology
  • Lukasz Golab, University of Waterloo
  • Todd Green, Amazon Web Services
  • Anja Gruenheid, Microsoft
  • Francesco Gullo, UniCredit
  • Wook-Shin Han, POSTECH
  • Bingsheng He, National University of Singapore
  • Yeye He, Microsoft Research
  • Thomas Heinis, Imperial College
  • Brian Hentschel, Harvard University
  • Melanie Herschel, Universität Stuttgart
  • Aidan Hogan, Universidad de Chile
  • Allison Holloway, Oracle
  • Katja Hose, Aalborg University
  • Vagelis Hristidis, University of California Riverside
  • Silu Huang, Microsoft Research
  • Zsolt István, IT University of Copenhagen
  • Theodore Johnson, AT&T Labs Research
  • Panos Kalnis, King Abdullah University of Science and Technology
  • Eser Kandogan, Megagon Labs
  • Zoi Kaoudi, IT University of Copenhagen
  • Ghassan Karame, Ruhr-Universität Bochum
  • Konstantinos Karanasos, Meta
  • Asterios Katsifodimos, Technische Universität Delft
  • Raghav Kaushik, Microsoft
  • Anastasios Kementsietsidis, Google Research
  • Bettina Kemme, McGill University
  • Alfons Kemper, Technische Universität München
  • Oliver Kennedy, University at Buffalo SUNY
  • Florian Kerschbaum, University of Waterloo
  • Arijit Khan, Aalborg University
  • Hideaki Kimura, HP Labs
  • Andreas Kipf, Amazon Web Services
  • George Kollios, Boston University
  • Haridimos Kondylakis, FORTH-ICS
  • Paraschos Koutris, University of Wisconsin-Madison
  • Chuan Lei, Amazon Web Services
  • Alberto Lerner, University of Fribourg, Switzerland
  • Chengkai Li, University of Texas Arlington
  • Yifan Li, York University
  • Sebastian Link, University of Auckland
  • Matteo Lissandrini, Aalborg University
  • Eric Lo Chinese, University of Hong Kong
  • Cheng Long, Nanyang Technological University
  • Bertram Ludaescher, University of Illinois
  • Man Lung Yiu, Hong Kong Polytechnic University
  • Lin Ma, University of Michigan
  • Amr Magdy, University of California Riverside
  • Nikos Mamoulis, University of Ioannina
  • Ioana Manolescu, INRIA and Institut Polytechnique de Paris
  • Michael Mathioudakis, University of Helsinki
  • Norman May, SAP SE
  • Sharad Mehrotra, University of California Irvine
  • Sergey Melnik, Google, USA
  • Paolo Merialdo, University Roma Tre
  • Zhengjie Miao, Duke University
  • Mostafa Milani, The University of Western Ontario
  • Umar Farooq Minhas, Apple
  • Supun Nakandala, Databricks
  • Fatemeh Nargesian, University of Rochester
  • Felix Naumann, Hasso Plattner Institute
  • Anisoara Nica, SAP SE Waterloo Canada
  • Milos Nikolic, University of Edinburgh
  • Nikos Ntarmos, Huawei Technologies R&D (UK) Ltd
  • Ismail Oukid, Snowflake Computing
  • Prashant Pandey, University of Utah
  • Varun Pandey, Technische Universität Berlin
  • John Paparrizos, The Ohio State University
  • Paolo Papotti, Eurecom
  • Peter Pietzuch, Imperial College London
  • Holger Pirk, Imperial College
  • Orestis Polychroniou, Amazon
  • Olga Poppe, Microsoft
  • Danica Porobic, Oracle
  • Tilmann Rabl, HPI, University of Potsdam
  • Karthik Ramachandra, Microsoft Azure SQL India
  • Suprio Ray, University of New Brunswick
  • Theodoros Rekatsinas, ETH Zurich
  • Mirek Riedewald, Northeastern University
  • Uwe Roehm, The University of Sydney
  • Jennie Rogers, Northwestern University
  • Kexin Rong, Georgia Institute of Technology
  • Sudip Roy, Google
  • Florin Rusu, University of California Merced
  • Ibrahim Sabek, MIT
  • Mohammad Sadoghi, University of California Davis
  • Kenneth Salem, University of Waterloo
  • Babak Salimi, University of California at San Diego
  • Maria Luisa Sapino, U. Torino Italy
  • Kai-Uwe Sattler, Technische Universität Ilmenau
  • Sebastian Schelter, University of Amsterdam
  • Stefanie Scherzinger, University of Passau
  • Russell Sears, Apple
  • Marco Serafini, University of Massachusetts Amherst
  • Vraj Shah, IBM Research
  • Shantanu Sharma, New Jersey Institute of Technology
  • Kyuseok Shim, Seoul National University
  • Alexander Shraer, Cockroach Labs
  • Tarique Siddiqui, Microsoft Research
  • Alkis Simitsis, Athena Research Center
  • Michael Simpson, University of British Columbia
  • Stavros Sintos, University of Illinois Chicago
  • Jie Song, ByteDance
  • Divesh Srivastava, AT&T Labs Research
  • Kostas Stefanidis, Tampere University
  • Kurt Stockinger, Zurich University of Applied Sciences
  • Rebecca Taft, Cockroach Labs
  • Jian Tan, Alibaba
  • Nan Tang, Qatar Computing Research Institute HBKU
  • Yufei Tao, The Chinese University of Hong Kong
  • Sandeep Tata, Google, USA
  • Yongxin Tong, Beihang University
  • Riccardo Torlone, Roma Tre University
  • Pinar Tozun, IT University of Copenhagen
  • Goce Trajcevski, Iowa State University
  • Peter Triantafillou, University of Warwick
  • Nikolaos Tziavelis, Northeastern University
  • Jan Van den Bussche, Hasselt University
  • Daisy Zhe Wang, University of Florida
  • Fusheng Wang, Stony Brook University
  • Hongzhi Wang, Harbin Institute of Technology
  • Jianguo Wang, Purdue University
  • Jin Wang, Megagon Labs
  • Sheng Wang, Alibaba Group
  • Tianzheng Wang, Simon Fraser University
  • Wendy Hui Wang, Stevens Institute of Technology
  • Matthias Weidlich, Humboldt-Universität zu Berlin
  • Steven Whang, KAIST
  • You Wu, Google
  • Xiaokui Xiao, National University of Singapore
  • Dong Xie, Penn State University
  • Cong Yan, Microsoft Research
  • Da Yan, University of Alabama at Birmingham
  • Bin Yang, Aalborg University
  • Yin Yang, Hamad bin Khalifa University
  • Ke Yi, Hong Kong Univ. of Science and Technology
  • Brit Youngmann, MIT
  • Jia Yu, Washington State University
  • Ting Yu, Qatar Computing Research Institute
  • Xiangyao Yu, University of Wisconsin-Madison
  • Xiaohui Yu, York University
  • Eleni Tzirita Zacharatou, IT University of Copenhagen
  • Demetrios Zeinalipour-Yazti, University of Cyprus
  • Steffen Zeuch, DFKI Berlin
  • Chao Zhang, University of Waterloo
  • Chao Zhang, Tsinghua University
  • Qizhen Zhang, University of Toronto
  • Yuhao Zhang, University of California San Diego
  • Zhuoyue Zhao, University at Buffalo-SUNY
  • Wenchao Zhou, Georgetown University
  • Erkang Zhu, Microsoft Research
  • Danyang Zhuo, Duke University
  • Andreas Züfle, Emory University
  • Calisto Zuzarte, IBM