| |||||||||||||||
SiMoD 2023 : Workshop on Simplicity in Management of Data | |||||||||||||||
Link: https://sfu-dis.github.io/simod/ | |||||||||||||||
| |||||||||||||||
Call For Papers | |||||||||||||||
ACM SIGMOD Workshop on Simplicity in Management of Data (SiMoD)
Co-located with ACM SIGMOD 2023, Seattle, WA. June 23, 2023. Workshop Chairs --------------- * Danica Porobic, Oracle, Switzerland, danica.porobic@oracle.com * Tianzheng Wang, Simon Fraser University, Canada, tzwang@sfu.ca Overview -------- The Workshop on Simplicity in Management of Data (SiMoD) aims to promote simple but non-trivial and effective ideas. SiMoD gathers researchers and practitioners to share their perspectives, new ideas, and experience on building practical data systems. The workshop is open to basically all data systems topics, including but not limited to both classic database systems topics and data applications, such as query processing, transaction processing, query optimization, storage management, networked and distributed database systems, data management in the cloud and self-driving database systems. Submission Tracks ----------------- We invite two types of contributions: (1) novel ideas and (2) experience. * Novel Ideas (up to 4 pages): Papers in this track should present early-stage, original ideas that were not proposed in the past. The submission should be concise and distill the core idea on specific problems being solved, with reasonable evidence (e.g., preliminary experimental results) showing the idea's applicability. We also encourage the authors to include the limitations of the proposed ideas. Submissions in this track should not exceed four pages, including everything, such as references. * Experience (up to 10 pages): This track focuses on "war stories" and experience reports - existing ideas but with a focus on the process and results. That is, how the idea came into its final/current form. We especially encourage the submissions to reason about the possible tradeoffs that were made during the process. For example, some surprisingly simple, elegant designs were in fact complex initially and/or came with many restrictions, but got "simplified" and refined through iterations. Submissions in this track can be up to ten pages (including everything) to give the full picture. Submission Instructions ----------------------- Manuscripts should follow the latest ACM proceedings format and be submitted as PDF files at: https://cmt3.research.microsoft.com/SiMoD2023. SiMoD is a single-anonymous workshop. Authors are expected to include their names and affiliations on the first page of the manuscript. Accepted papers will appear in the ACM International Conference Proceedings Series and be included in the ACM digital library. Evaluation Criteria and Reviewing Process Determining whether an idea is "simple but effective" is generally subjective and difficult (if not impossible) to quantify precisely. When evaluating submissions, the PC will consider several helpful (although imperfect) metrics, including but not limited to: * Whether the gist of the idea can be explained in few pages and does not require a long list of prerequisites. * Whether empirical evaluation shows good performance results. * Whether the amount of effort needed to implement the idea is small (e.g., as demonstrated by low lines of code); authors are encourged to summarize the implementation and include source code in the submission. As an example, the B-link tree by Lehman and Yao is a classic that would fit the above evaluation criteria. The reviewing process will also include a live PC meeting to discuss the submissions and determine the final program. Important Dates --------------- * Paper submission: March 15, 2023, 5pm Pacific Time * Notification of acceptance: April 18, 2023 * Camera-ready copies: May 18, 2023 * Workshop: June 23, 2023 Program Committee ----------------- Co-Chairs * Danica Porobic, Oracle, Switzerland * Tianzheng Wang, Simon Fraser University, Canada PC Members * Alberto Lerner, University of Fribourg, Switzerland * Allison Holloway, Oracle, USA * Dong Xie, Penn State University, USA * Ismail Oukid, Snowflake Computing, Germany * Jana Giceva, Technical University of Munich, Germany * Khuzaima Daudjee, University of Waterloo, Canada * Renata Borovica-Gajic, University of Melbourne, Australia * Sang-Won Lee, Sungkyunkwan University, South Korea * Xiangyao Yu, University of Wisconsin - Madison, USA * Yannis Chronis, Google, USA |
|