Proceedings of the 2011 ACM Sigmod International Conference on Management of Data
Bibliographic record
Abstract
Welcome to an exciting week in the city of Athens for the 2011 ACM SIGMOD Conference. Athens is a metropolitan and cosmopolitan city, with so many things to do and to see. It is also known as the birth place of Democracy, the city with the world-renown "Acropolis and Parthenon", with the famous Theater of Herodes Atticus and the "marble stadium" where the first modern time Olympic Games took place in 1896, home of Socrates, Plato, Pericles (Golden Age), and home of the very successful 2004 Olympic Games. And now the home of the 2011 ACM SIGMOD Conference! Athens is both an "ancient" and a "modern" city, in which visitors can walk safely and enjoy the rich --- almost 5,000 year old --- history it has to offer. The city offers a lot of sightseeing, museums, shopping and nightlife.\n\nWe have a program of several social events to complement an excellent technical program. The SIGMOD banquet is in the beautiful Island Restaurant by the sea, the SIGMOD reception on Monday at the Caravel Hotel (conference hotel) Roof Garden, and the PODS 30th Anniversary Colloquium and Reception on Sunday also at the hotel. Through the generous support from our sponsors (Platinum) EMC, Microsoft, and Oracle, (Gold) Google, IBM Research, SAP, Sybase, and Yahoo! Labs, (Silver) AsterData, HP, Intrasoft International, Kosmix, MarkLogic, Twitter, and VirtualTrip, and (Other Supporters) Greenplum and NEC, along with a contribution from ACM SIGMOD, we were able to keep the conference fees to a minimum with an extraordinarily low student registration that will allow many students to participate.\n\nWe had 375 research papers submitted. A research program committee provided detailed reviews and extensive discussion following SIGMOD's double-blind reviewing policy. The program committee was led by nine group leaders: Sihem Amer-Yahia (Yahoo! Labs), Michael Böhlen (University of Zurich), Bettina Kemme (McGill University), Sam Madden (MIT), Jignesh Patel (University of Wisconsin), Dan Suciu (University of Washington), Wang-Chiew Tan (IBM Research - Almaden and UC Santa Cruz), Nesime Tatbul (ETH Zurich), and Min Wang (HP Labs China). The group leaders ensured that every paper had a champion and received thorough discussion. We accepted a record number of research papers. Nonetheless, it is clear there were still papers that were rejected that would have been valuable contributions to SIGMOD. The group leaders did a great job in keeping the discussions positive and reviewers focused on finding reasons to accept papers, rather than reasons to reject. We hope that SIGMOD continues the trend of accepting more papers to accommodate all the great ideas being produced by the community. All research papers have been invited to participate in SIGMOD's Experimental Repeatability effort, the goal of which is to help to enable SIGMOD papers to stand as reliable, archival work for future research.\n\nA demonstration program committee of 35 people reviewed 81 proposals for system demonstrations and accepted 32. We will again be holding a Best Demonstration Award Competition to recognize the most innovative demonstrations. We encourage everyone to participate in the voting. An industrial program committee of 13 people reviewed 36 short presentation proposals, accepting 14. In addition, the industrial program will include two invited talks by Michael Abbot (Twitter) and Don Campbell (IBM). Rounding out the full program, we have a panel on data management issues in health and medical informatics, two invited talks by James Hamilton (Amazon) and Anastasia Ailamaki (EPFL), along with six tutorials on new applications of Datalog, flash memory, copy detection, data privacy, web data management, and statistical relational models.\n\nSIGMOD continues its commitment to undergraduate research awarding eight scholarships to undergraduate researchers who will participate in the Undergraduate Research Poster session that will be co-located with a Graduate Research Poster session. In addition, we will host the Third Annual SIGMOD Programming Contest. Student teams from degree granting institutions were invited to compete in this annual contest. This year, the task is to implement a high-throughput main-memory index that is made durable using a flash-based SSD.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".