Conference Information

SIGMOD 2027: ACM Conference on Management of Data

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Register Login
Embed deadline badge
SIGMOD
Get this via API
Search and ranking lists need no credentials at all; full detail for this page needs a free API key. See the developer guide.
Submission Date:
2026-10-10 Due in 39 days
Notification Date:
2027-01-19
Conference Date:
2027-06-13
Location:
Huntington Beach, California, USA
Years:
54
CCF: A   ICORE: A*   QUALIS: A1   Viewed: 1321739   Tracked: 278   Attend: 41

Conference Partner Index (CP-I)

81.0 / 100
Ranked #181 of 5,645 conferences · Top 4%

#10 of 336 in Data Mining & Databases

Academic recognition (35%)
100
Submission selectivity (20%) No data - scored at the neutral baseline of 50 —
Editions held (20%)
100
Community attention (10%)
85
Public record completeness (15%)
50

Inputs used: Listed as CCF A, QUALIS A1 · Editions on record: 54 · Researchers following it here: 278 · Researchers who opened this page in the past 24 months: 61

Missing from the public record: Historical acceptance rates (+4.5) · Past editions (+3.0)
Organizers can add these from this page after claiming the conference; scores are recomputed nightly. How to raise this score

Confidence 80% - the share of the score backed by observed data rather than the neutral baseline. How this score is calculated · Browse the ranking · Algorithm version 1.1 · Computed 2026-08-31

Call For Papers

SIGMOD 2027 (ACM Conference on Management of Data) is a CCF A / ICORE A* / QUALIS A1 conference held in Huntington Beach, California, USA on 2027-06-13. The paper submission deadline is 2026-10-10. Acceptance notifications are sent on 2027-01-19.

TOPICS OF INTEREST Topics of interest include, but are not limited to: Data Management Systems Monitoring, testing, and tuning database systems Cloud, distributed, decentralized and parallel data management Database systems on emerging hardware Embedded databases, IoT, and Sensor networks Storage, indexing, and physical database design Query processing and optimization Transaction processing Data warehousing, OLAP, Analytics Data Models and Languages Data models and semantics Declarative programming languages and optimization Spatial and temporal data management Graphs, social networks, web data, and semantic web Multimedia and information retrieval Data lakes Uncertain, probabilistic, and approximate databases Streams and complex event processing Human-Centric Data Management Data exploration, visualization, query languages, and user interfaces User-centric and human-in-the-loop data management Human-data interaction Crowdsourced and collaborative data management Data Governance, Quality, and Fairness Data integration, information extraction, and schema matching Data provenance and workflows Metadata management Data security, privacy, and access control Data quality and data cleaning Responsible data management and data fairness Modern AI & Data Management Structured queries over unstructured data: images, video, natural language, etc. Natural language queries Machine learning methods for database engine internals Machine learning methods for database tuning Data management and metadata for machine learning pipelines AI & knowledge bases Data mining & prescriptive analytics in databases Systems for AI Other topics which are not listed but clearly address data management related challenges are also welcome. SIGMOD also welcomes submissions on inter-disciplinary work, as long as there are clear contributions to management of data.
Last updated by Dou Sun on

Best Papers

YearBest Papers
2025LpBound: Pessimistic Cardinality Estimation Using ℓp-Norms of Degree Sequences
2025Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt?
2024Implementation Strategies for Views over Property Graphs
2023Detecting Logic Bugs of Join Optimizations in DBMS
2023Predicate Pushdown for Data Science Pipelines
2022R2T: Instance-optimal Truncation for Differentially Private Query Evaluation with Foreign Keys
2021Bao: Making Learned Query Optimization Practical
2021DFI - The Data Flow Interface for High-Speed Networks
2020Pump Up the Volume: Processing Large Data on GPUs with Fast Interconnects
2020ShapeSearch: A Flexible and Efficient System for Shape-based Exploration of Trendlines
2019Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation
2019On the Enumeration Complexity of Unions of Conjunctive Queries
2019Interventional Fairness : Causal Database Repair for Algorithmic Fairness
2018SuRF:Practical Range Query Filtering with Fast Succinct Tries
2017Parallelizing Sequential Graph Computations
2016Wander Join: Online Aggregation via Random Walks
2015DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation
2014Materialization Optimizations for Feature Selection Workloads
2013Massive Graph Triangulation
2012High-Performance Complex Event Processing over XML Streams
2011Entangled queries: enabling declarative data-driven coordination
2010FAST: fast architecture sensitive tree search on modern CPUs and GPUs
2009An architecture for recycling intermediates in a column-store
2009Generating example data for dataflow programs
2008Serializable isolation for snapshot databases
2008Scalable network distance browsing in spatial databases
2007Compiling mappings to bridge applications and databases
2007Scalable approximate query processing with the DBO engine
2006To search or to crawl?: towards a query optimizer for text-centric tasks
2004Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
2003Spreadsheets in RDBMS for OLAP
2001Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
2000XMILL: An Efficient Compressor for XML Data
1999DynaMat: A Dynamic View Management System for Data Warehouses
1998Integrating Mining with Relational Database Systems: Alternatives and Implications
1998Efficient and Transparent Application Recovery in Client-Server Information Systems
1997Fast Parallel Similarity Search in Multimedia Databases
1996Implementing Data Cubes Efficiently
1994AlphaSort: A RISC Machine Sort
1994Fast Subsequence Matching in Time-Series Databases
1993Mining Association Rules between Sets of Items in Large Databases
1990The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles
1988A Case for Redundant Arrays of Inexpensive Disks (RAID)
1984R-Trees: A Dynamic Index Structure for Spatial Searching
1981The K-D-B-Tree: A Search Structure For Large Multidimensional Dynamic Indexes
1979Access Path Selection in a Relational Database Management System

People who viewed this also viewed

CCFICORECP-IShortFull NameSubmissionConference
AA*96.6The Web ConferenceThe ACM Web Conference2026-10-112027-05-10
AA*97.0ICDEInternational Conference on Data Engineering2026-11-112027-05-17
AA*91.5FSEACM SIGSOFT Symposium on the Foundations of Software Engineering2026-10-022027-07-12
BB74.2DASFAAInternational Conference on Database Systems for Advanced Applications2026-11-222027-05-28
CA80.0ECIREuropean Conference on Information Retrieval2026-09-212027-03-21
BB73.0EDBTInternational Conference on Extending Database Technology2026-10-072027-04-06
AA91.0EuroSysEuropean Conference on Computer Systems2026-09-172027-04-19
AA*97.7AAAIAAAI Conference on Artificial Intelligence2026-07-212027-02-16
BB60.8DCCData Compression Conference2026-10-022027-03-23
AA*88.9ICLRInternational Conference on Learning Representations2026-09-182027-04-26

Related Conferences

Related Journals

Comments 0

No comments yet.

Please Login to post a comment