학회 정보

PODS 2027: ACM SIGMOD Conference on Principles of DB Systems

학회 웹사이트를 보려면 로그인해 주세요
무료 가입으로 공식 사이트 조회, 마감 추적, 이메일 리마인더를 이용할 수 있습니다.
회원가입 로그인
투고 마감일:
2026-12-03 27일 남음
통보일:
2027-03-01
개최일:
2027-06-13
개최지:
Huntington Beach, California, USA
개최 횟수:
46
캘린더에 추가: Google 캘린더 · Outlook / Apple (.ics)
CCF: B   ICORE: A*   QUALIS: A1   조회: 7160563   팔로우: 119   참가: 13
이 페이지에 잘못된 정보가 있나요? 알려 주세요
마감 카운트다운 배지 삽입
PODS
이 데이터를 API로 가져오기
검색과 순위 목록은 자격 증명이 전혀 필요 없습니다. 이 페이지의 상세 데이터에는 무료 API 키가 필요합니다. 자세한 내용은 개발자 안내 페이지를 참고하세요.

회반 지수 (CP-I)

79.9 / 100
전체 5,769개 중 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-05

논문 모집

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.7ICMEIEEE International Conference on Multimedia & Expo2026-12-302027-07-13
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

아직 댓글이 없습니다.

댓글을 작성하려면 로그인해 주세요