会議情報

PODS 2027: ACM SIGMOD Conference on Principles of DB Systems

会議のウェブサイトを表示するにはログインしてください
無料登録で公式サイトの閲覧、締切のトラッキング、メールリマインダーが利用できます。
新規登録 ログイン
投稿締切日:
2026-12-03 残り 28 日
通知日:
2027-03-01
開催日:
2027-06-13
開催地:
Huntington Beach, California, USA
開催回数:
46
カレンダーに追加: Google カレンダー · Outlook / Apple（.ics）
CCF: B   ICORE: A*   QUALIS: A1   閲覧: 7160398   フォロー: 119   参加: 13
このページに誤りがありますか？お知らせください
締切カウントダウンバッジを埋め込む
PODS
このデータを API で取得
検索とランキング一覧は資格情報なしで利用できます。このページの詳細データには無料の API キーが必要です。詳しくは開発者向けガイドをご覧ください。

会伴インデックス (CP-I)

79.9 / 100
全 5,768 件中 第 204 位 · 上位 4%

データマイニング・データベース 分野 339 件中 第 12 位

学術的評価 (35%)
100
投稿の選択性 (20%) データなし — 中立の基準値 50 点として算入 —
開催回数 (20%)
100
コミュニティの注目度 (10%)
74
公開情報の充実度 (15%)
50

使用した入力: 収録ランク：CCF B, QUALIS A1 · 確認できる開催回数：46 · 会伴でフォローしている研究者：119 人 · 過去 24 か月にこのページを開いた研究者：42 人

公開情報で不足しているもの: 過去の採択率 (+4.5) · 過去の開催回 (+3.0)
主催者は会議を認証申請したうえで、このページから直接追加できます。スコアは毎晩再計算されます。このスコアを上げるには

信頼度 80% — スコアのうち、中立の基準値ではなく実際に観測されたデータに基づく割合。 このスコアの算出方法 · ランキングを見る · アルゴリズム版 1.2 · 算出日 2026-11-04

論文募集

PODS 2027 (ACM SIGMOD Conference on Principles of DB Systems) is a CCF B / ICORE A* / QUALIS A1 conference held in Huntington Beach, California, USA on 2027-06-13. The paper submission deadline is 2026-12-03. Acceptance notifications are sent on 2027-03-01.

The Principles of Database Systems (PODS) symposium series, held in conjunction with the SIGMOD conference series, provides a premier annual forum for the communication of new advances in the theoretical foundations of data management, traditional or nontraditional (see https://sigmod.org/pods-home/). The 2027 conference will be held in Huntington Beach, California on June 13 - 19, 2027. Mission The PODS community has a pivotal position in the research of computer science. It aims to provide a solid scientific basis for methods, techniques, and solutions for the data management challenges that continually arise in our data-driven society. It develops new ways of advancing data management to reflect the rich landscape of data requirements in applications nowadays. Our goal is to develop solutions that ensure high levels of efficiency, scalability, usability, expressiveness, robustness, security, clarity, and privacy, among others. The PODS community is an open space where researchers from various areas related to the principles of computer science can discuss, interact, and propose solutions to problems in data management. Scope PODS seeks scientific articles that present principled contributions to modeling, application and system building in the context of data management. Such articles might be based, among others, on establishing theoretical results, developing new concepts and frameworks that deserve further exploration, providing experimental work that sheds light on the scientific foundations of the discipline, or a rigorous analysis of important industry artifacts. At a time when computer science is increasingly data-centric, it is essential to promote an active exchange of tools and techniques between PODS and other communities focused on data management. PODS thus pays special attention to those papers that help in the urgent process of integrating data management techniques within broader computer science. Topics that fit the interests of the symposium include, but are not limited to: Database processing: Query evaluation, query optimization, schema management, distributed data processing, approximate data processing Database design: Data models, query languages, schemas, constraints Database access: Data structures, access methods, concurrency, transactions Data quality: Data cleaning, data discovery, data exploration Data analysis: Data mining, machine learning, information extraction, data streams Uncertainty: Incompleteness, inconsistency, ontological query answering, semi-structured data Interoperability: Mappings and views, data integration, data exchange, ontology-based data access Responsible data management: Access control, privacy, security, verification, ethical aspects of data management Connections between database principles and other disciplines
最終更新：Dou Sun（）

ベストペーパー

年ベストペーパー
2026Unbiased Insights: Optimal Streaming Algorithms for ℓp Sampling, the Forget Model, and Beyond
2025Output-Optimal Algorithms for Join-Aggregate Queries
2025Output-sensitive Conjunctive Query Evaluation
2024History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures
2024Consistency of Relations over Monoids
2023Extremal Fitting Problems for Conjunctive Queries
2022Optimal Bounds for Approximate Counting
2022Convergence of Datalog over (Pre-) Semirings
2021Relative Error Streaming Quantiles
2020A Framework for Adversarially Robust Streaming Algorithms
2019On the Enumeration Complexity of Unions of Conjunctive Queries By Nofar Carmeli, Markus Kröll
2019Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation
2019Interventional Fairness: Causal Database Repair for Algorithmic Fairness
2018SuRF: Practical Range Query Filtering with Fast Succinct Tries
2018Entity Matching with Active Monotone Classification
2017Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem
2017Dichotomies in Ontology-Mediated Querying with the Guarded Fragment
2016FAQ: Questions Asked Frequently
2015Parallel-Correctness and Transferability for Conjunctive Queries
2014Weaker Forms of Monotonicity for Declarative Networking: A More Fine-Grained Answer to the CALM-Conjecture
2013Verification of database-driven systems via amalgamation
2012Worst-case Optimal Join Algorithms
2011Data exchange beyond complete data
2010An optimal algorithm for the distinct elements problem
2009Size and treewidth bounds for conjunctive queries
2008Estimating PageRank on graph streams
2007Generalized hypertree decompositions: np-hardness and tractable variants
2006Two-variable logic on data trees and XML reasoning
2005XML data exchange: consistency and query answering
2005On the complexity of division and set joins in the relational algebra
2004Conditional XPath, the First Order Complete XPath Dialect
2003An information-theoretic approach to normal forms for relational and XML data
2002Monadic Datalog and the Expressive Power of Languages for Web Information Extraction
2001Optimal Aggregation Algorithms for Middleware
2000Auditing Boolean Attributes
1999Exact and Approximate Aggregation in Constraint Query
1998Expressiveness of Structured Document Query Languages Based on Attribute Grammars
1998A Lower Bound Theorem for Indexing Schemes and Its Application to Multidimensional Range Queries
1997On the complexity of database queries (extended abstract)

これを見た人はこちらも見ています

関連会議

CCFICORECP-I略称正式名称投稿締切開催日
AA*81.4SIGMODACM Conference on Management of Data2026-10-102027-06-13
BA*89.8ICRAInternational Conference on Robotics and Automation2026-09-152027-05-24
BA*97.7IJCAIInternational Joint Conference on Artificial Intelligence2027-01-042027-08-07
B91.2ICASSPInternational Conference on Acoustics, Speech and Signal Processing2026-09-162027-05-16
BA76.7ICMEInternational Conference on Multimedia and Expo2025-12-312026-07-05
B84.4BIBMInternational Conference on Bioinformatics & Biomedicine2026-07-052026-12-01
BA*97.3ICDMInternational Conference on Data Mining2027-06-062027-11-15
BA*89.1ECCVEuropean Conference on Computer Vision2026-03-062026-09-08
BA92.9DATEDesign, Automation and Test in Europe2026-09-072027-03-22
BA*88.0KRInternational Conference on the Principles of Knowledge Representation and Reasoning2027-04-232027-09-21

関連ジャーナル

CCF正式名称インパクトファクター出版社ISSN
CKnowledge-Based Systems7.2Elsevier0950-7051
Applied Soft Computing7.8Elsevier1568-4946
SIGMOD RecordACM0163-5808
BSoftware & Systems Modeling3.2Springer1619-1366
BPattern Recognition7.6Elsevier0031-3203
BIEEE Transactions on Neural Networks and Learning Systems8.9IEEE1045-9227
BInformation Sciences6.0Elsevier0020-0255
BComputer Networks4.7Elsevier1389-1286
BComputers & Security5.4Elsevier0167-4048
BIEEE Transactions on Intelligent Transportation Systems8.4IEEE1524-9050

コメント 0

まだコメントはありません。

コメントするにはログインしてください