2009年3月11日水曜日

SIGMOD2009 Accepted Papers

SIGMOD2009採録論文が発表されました。そのうちのいくつかについて、タイトルだけから内容を推測。
  • Yahoo! Researchの"Generating Example Data for Dataflow Programs"は恐らくPig Latinのデバッグ用のサンプルデータ生成の話。Hadoopなどの上で、複雑なデータ構造を動的に組み立てていくプログラム書きながら、横に実行結果の例を「適切に」示したサンプルが表示されると、わかりやすいよね、という話。
  • ”Towards a simpler XML Schema: effortless handling of nondeterministic regular expressions”はついに来たか、という感じ。Relational styleの考えが入っていて、スキーマ(relation)から考えられるいろいろな木構造をNFAを使って同時に検証する、という流れだったら嬉しい。
  • "DDE: From Dewey to a Fully Dynamic XML Labeling" 。XMLの索引づけはもう食傷気味なのですが。。。「Fully」といいつつ挿入・削除以外の更新操作(木の移動とか)をサポートしていないと、がっくりきそう。
  • その他、multi-core CPU(Dependency-Aware Reordering for Parallelizing Query Optimization in Multi-Core CPUs)とか、SSD(Query Processing Techniques for Solid State Drives)の話もちらほら。
  • 圧巻は、64番 ”A Comparison of Approaches to Large Scale Data Analysis”。Brown, MIT, UW Madison, Yale、そしてMicrosoftって、どんだけコネクションが広いんだ、あなたたちw。日本がDBコミュニティで存在感が出せないのは、こういった人脈がないことに尽きると思います。
  • それにしても、"Why Not?"ってなんだろう?DBMSがこう検索したらどう?とでも聞いてくるのかな?"Schema-Free XQuery"のときといい、Jagadishたちのグループは、論文のネーミングが秀逸です。
全体としての印象は、シリコンバレーに集まっているラボが強い。Microsoft, Yahoo! Research, HPなどなど。もともとはMITやStanford出身だったりするのですが。Stanfordもシリコンバレーの大学。

今回のSIGMODでは、僕は勝負すらできなかったので、投稿して落とされるよりたちが悪い。大負けです。悔しい。
  • 23 
    Entity Resolution with Iterative Blocking
    Steven Whang*, Stanford University
    David Menestrina, Stanford University
    Georgia Koutrika, Stanford University
    Martin Theobald, Stanford University
    Hector Garcia-Molina, Stanford University
  • 25
    Dependency-Aware Reordering for Parallelizing Query Optimization in Multi-Core CPUs
    Wook-Shin Han*, Kyungpook National University
    Jinsoo Lee, 
  • 38
    Minimizing the Communication Cost for Continuous Skyline Maintenance
    Zhenjie Zhang*, National University of Singapo
    Reynold Cheng, 
    Dimitris Papadias, HKUST
    Anthony K. H. Tung, National University of Singapore
  • 47
    FlexRecs: Expressing and Combining Flexible Recommendations
    Georgia Koutrika*, Stanford University
    Benjamin Bercovitz, Stanford University
    Hector Garcia-Molina, Stanford University
  • 64
    A Comparison of Approaches to Large Scale Data Analysis
    Andrew Pavlo*, Brown University
    Samuel Madden, Massachusetts Institute of Technology
    David DeWitt, Microsoft
    Michael Stonebraker, Massachusetts Institute of Technology
    Alexander Rasin, Brown University
    Erik Paulson, University of Wisconsin-Madison
    Lakshmikant Shrinivas, UW-Madison
    Daniel Abadi, Yale University
  • 69
    GAMPS: Compressing Multi Sensor Data by Grouping and Amplitude Scaling
    Sorabh Gandhi, University of California, Santa Barbara
    Suman Nath*, Microsoft Research
    Subhash Suri, UCSB
    Jie Liu, 
  • 94
    Authenticated Join Processing in Outsourced Databases
    Yin Yang, HKUST
    Dimitris Papadias*, HKUST
    Stavros Papadopoulos, HKUST
    Panos Kalnis, NUS
  • 115
    Privacy Integrated Queries: An Extensible Platform for Privacy-Preserving Data Analysis
    Frank McSherry*, Microsoft
  • 118
    Query Simplification: Graceful Degradation for Join-Order Optimization
    Thomas Neumann*, Max-Planck-Institut Informatik
  • 119
    Scalable Join Processing on Very Large RDF Graphs
    Thomas Neumann*, Max-Planck-Institut Informatik
    Gerhard Weikum, Max-Planck-Institut Informatik
  • 120
    Combining Keyword Search and Forms for Ad Hoc Querying of Databases
    Eric Chu*, University of Wisconsin-Madiso
    Akanksha Baid, University of Wisconsin-Madison
    Xiaoyong Chai, University of Wisconsin-Madison
    AnHai Doan, Univ of Wisconsin
    Jeff Naughton, University of Wisconsin
  • 121
    Attacks on Privacy and deFinetti's Theorem
    Daniel Kifer*, Penn State University
  • 122
    Optimizing Complex Extraction Programs over Evolving Text Data
    Fei Chen*, UW-Madison
    AnHai Doan, Univ of Wisconsin
    Jun Yang, Duke University
    Raghu Ramakrishnan, 
    Byron Gao, 
  • 142
    DDE: From Dewey to a Fully Dynamic XML Labeling
    Liang Xu*, NUS
    Tok Wang Ling, NUS
    Huayu Wu, NUS
    Zhifeng Bao, NUS
  • 143
    Self-organizing Tuple Reconstruction in Column-stores
    Stratos Idreos*, CWI
    Martin Kersten, CWI
    Stefan Manegold, CWI
  • 151
    Ranking Queries on Distributed Probabilistic Data
    Feifei Li*, Florida State University
    Ke Yi, Department of Computer Science and Engineering, HKUST
    Jeffrey Jestes, Computer Science Department, FSU
  • 161
    Generating Example Data for Dataflow Programs
    Christopher Olston*, Yahoo! Research
    Shubham Chopra, Yahoo! Research
    Utkarsh Srivastava, Yahoo! Research
  • 165
    Secure Outsourced Aggregation via One-way Chains
    Suman Nath*, Microsoft Research
    Haifeng Yu, 
  • 166
    ZStream: A Cost-based Query Processor for Adaptively Detecting Composite Events
    Yuan Mei*, MIT
    Samuel Madden, Massachusetts Institute of Technology
  • 190
    Serial and Parallel Methods for I/O Efficient Suffix Tree Construction
    Amol Ghoting*, IBM Research
    Konstantin Makarychev, IBM Research
  • 191
    Asynchronous View Maintenance for VLSD Databases
    Parag Agrawal, Stanford University
    Adam Silberstein, Yahoo! Research
    Brian Cooper*, Yahoo! Research
    Utkarsh Srivastava, Yahoo! Research
    Raghu Ramakrishnan, 
  • 195
    Kernel-Based Skyline Cardinality Estimation
    Zhenjie Zhang*, National University of Singapo
    Yin Yang, HKUST
    Ruichu Cai, School of Computer Science and Engineering, South China University of Technology
    Dimitris Papadias, HKUST
    Anthony K. H. Tung, National University of Singapore
  • 207
    Quality and Efficiency in High Dimensional Nearest Neighbor Search
    Yufei Tao*, CUHK
    Ke Yi, Department of Computer Science and Engineering, HKUST
    Cheng Sheng, The Chinese University of Hong Kong
    Panos Kalnis, National University of Singapore
  • 224
    Continuous Obstructed Nearest Neighbor Queries in Spatial Databases
    Yunjun Gao*, Singapore Management Univ.
    Baihua Zheng, Singapore Management Univ.
  • 235
    Keyword Search in Databases: The Power of RDBMS
    Lu Qin*, CUHK
    Jeffrey Xu Yu, The Chinese Univ. of Hong Kong
    Lijun Chang, 
  • 242
    Why Not?
    Adriane Chapman*, MITRE Corporation
    H.V. Jagadish, Univ. Michigan
  • 244
    Dictionary-based Order-preserving String Compression for Main Memory Column Stores
    Carsten Binnig*, ETH Zurich
    Stefan Hildenbrand, ETH Zurich
    Franz Frber, 
  • 245
    ROX: Run-time Optimization of XQueries
    Riham Abdel Kader*, University of Twente
    Peter Boncz, CWI
    Stefan Manegold, CWI
    Maurice Van Keulen, University of Twente
  • 253
    An Architecture for Recycling Intermediates in a Column-store
    Milena Ivanova*, CWI
    Martin Kersten, CWI
    Niels Nes, CWI
    Romulo Goncalves, CWI
  • 266
    Scalable Skyline Computation Using Object-based Space Partitioning
    ZHANG Shiming, HKU
    Nikos Mamoulis*, University of Hong Kong
    David Cheung, University of Hong Kong
  • 269
    FlashLogging: Exploiting Flash Devices for Synchronous Logging Performance
    Shimin Chen*, Intel Research Pittsburgh
  • 292
    Skip-and-Prune: Cosine-based Top-K Query Processing for Efficient Context-Sensitive Document Retrieval 
    Jong wook Kim*, ASU
    K. Selcuk Candan, 
  • 293
    Robust XPath Expressions for Web Extraction
    Philip Bohannon, Yahoo! Research
    Nilesh Dalvi*, Yahoo! Research
    Fei Sha, University of Southern California
  • 301
    Incremental Maintenance of Length Normalized Indexes for Approximate String Matching
    Marios Hadjieleftheriou*, AT&T Labs - Research
    Nick Koudas, University of Toronto
    Divesh Srivastava, AT&T Labs-Research
  • 308
    Top-k Queries on Uncertain Data: On Score Distribution and Typical Answers
    Tingjian Ge*, Brown University
    Stanley Zdonik, Brown University
    Samuel Madden, Massachusetts Institute of Technology
  • 316
    Top-K Generation of Integrated Schemas Based on Directed and Weighted Correspondences
    Ahmed Radwan, University of Miami
    Lucian Popa*, IBM Almaden
    Ioana Stanoi, IBM Almaden
    Akmal Younis, University of Miami
  • 319
    E = MC3: Managing Uncertain Enterprise Data
    Peter Haas, IBM
    Fei Xu, University of Florida
    Vuk Ercegovac*, IBM
    Eugene Shekita, IBM
  • 335
    Estimating the Confidence of Conditional Functional Dependencies
    Graham Cormode, AT&T Labs - Research
    Lukasz Golab*, AT&T Research
    Flip Korn, AT&T Labs - Research
    Andrew McGregor, Microsoft Research
    Divesh Srivastava, AT&T Labs-Research
    Xi Zhang, SUNY Buffalo
  • 343
    Monitoring Path Nearest Neighbor in Road Networks
    Zaiben Chen, The University of Queensland
    Heng Tao Shen*, The University of Queensland
    Xiaofang Zhou, University of Queensland
    Jeffrey Xu Yu, The Chinese Univ. of Hong Kong
  • 347
    Uncertainty Management in Rule-based Information Extraction Systems
    Eirinaios Michelakis*, UC Berkeley
    Peter Haas, IBM
    Rajasekar Krishnamurthy, IBM
    Shivakumar Vaithyanathan, IBM
  • 359
    Approximate Entity Extraction with Edit Constraints
    Wei Wang, University of New South Wales
    Chuan Xiao*, UNSW
    Xuemin Lin, 
    Chengqi Zhang, UTS, Australia
  • 361
    Secure k-NN Computation on Encrypted Databases
    Wai Kit Wong*, The University of Hong Kong
    David Cheung, University of Hong Kong
    Ben Kao, The University of Hong Kong
    Nikos Mamoulis, University of Hong Kong
  • 364
    Query Processing Techniques for Solid State Drives
    Dimitris Tsirogiannis*, University of Toronto
    Stavros Harizopoulos, HP Labs
    Mehul Shah, HP Labs
    Janet Wiener, Hewlett-Packard Laboratories
    Goetz Graefe, HP Labs
  • 385
    Query by Output
    Quoc Trung Tran*, NUS
    Chee-Yong Chan, 
    Srinivasan Parthasarathy, Ohio State University
  • 387
    Exploiting Context Analysis for Combining Multiple Entity Resolution Systems
    Zhaoqi Chen*, UCI
  • 395
    Towards a simpler XML Schema: effortless handling of nondeterministic regular expressions
    Geert Jan Bex, Hasselt University
    Wouter Gelade*, Hasselt University
    Wim Martens, University of Dortmund
    Frank Neven, Hasselt University
  • 399
    Cost Based optimization and plan selection for XPath
    Haris Georgiadis*, AUEB
    Minas Charalambidis, AUEB
    Vasilis Vassalos, AUEB
  • 400
    Core Schema Mappings
    Giansalvatore Mecca*, Università della Basilicata
    Paolo Papotti, Università di Roma Tre
    Salvatore Raunich, Unversità della Basilicata
  • 403
    A Gauss Funtion based Approach for Unbalanced Ontology Matching
    Qian Zhong, Tsinghua University
    Hanyu Li*, IBM CRL
    Juanzi Li, 
    Guo tong Xie, ibm
    Jie Tang, 
    Lizhu Zhou, Tsinghua University
  • 407
    Efficient Type-Ahead Search on Relational Data: a TASTIER Approach
    Guoliang Li*, Tsinghua University
    Shengyue Ji, UC Irvine
    Chen Li, Univeristy of California, Irvine
    Jianhua Feng, Tsinghua University
  • 493
    A Revised R*-tree in Comparison with Related Index Structures
    Norbert Beckmann, University of Marburg
    Bernhard Seeger*, University of Marburg
  • 495
    Indexing Correlated Probabilistic databases
    Bhargav Kanagal*, University of Maryland
    Amol Deshpande, University of Maryland, college Park
  • 505
    Efficient Incorporation of User Feedback into Information Extraction and Integration Programs
    Xiaoyong Chai*, University of Wisconsin-Madison
    Ba-Quy Vuong, Univ. of Wisconsin at Madison
    AnHai Doan, Univ of Wisconsin
    Jeff Naughton, University of Wisconsin
  • 513
    Extending Autocompletion to Tolerate Errors
    Surajit Chaudhuri, Microsoft Research
    Raghav Kaushik*, Microsoft Research
  • 526
    Privacy Preservation of Aggregates in Hidden Databases: Why and How?
    Arjun Dasgupta*, University of Texas Arlington
    Nan Zhang, George Washington University
    Gautam Das, Univ of Texas at Arlington
    Surajit Chaudhuri, Microsoft Research
  • 534
    A Declarative Data Representation Framework
    Arvind Arasu*, Microsoft Research
    Raghav Kaushik, Microsoft Research
  • 553
    Secondary-Storage Confidence Computation for Conjunctive Queries with Inequalities
    Jiewen Huang, Oxford University
    Dan Olteanu*, Oxford University
  • 562
    3-HOP: A High-Compression Indexing Scheme for Reachability Query
    Ruoming Jin*, Kent State University
    Yang Xiang, Kent State University
    Ning Ruan, Kent State University
    Dave Fuhry, Kent State University
  • 565
    A Framework for Testing Query Transformation Rules
    Hicham Elmongui, Purdue University
    Vivek Narasayya*, Microsoft Research
    Ravi Ramamurthy, Microsoft Research
  • 568
    Robust and Efficient Algorithms for Rank Join Evaluation
    Jonathan Finger, University of California Santa Cruz
    Alkis Polyzotis*, UC Santa Cruz
  • 569
    Cross-tier, Label-based Security Enforcement for Web Applications
    Brian Corcoran*, University of Maryland
    Michael Hicks, University of Maryland
    Nikhil Swamy, Microsoft Research
  • 583
    Optimizing I/O-Intensive Transactions in Highly Interactive Applications
    Mohamed Sharaf*, Univ. of Toronto
    Cristiana Amza, UofT
    Panos Chrysanthis, University of Pittsburgh
    Alexandros Labrinidis, University of Pittsburgh
  • 585
    Detecting and Resolving Unsound Workflow Views for Provenance Preservation
    Peng Sun, Arizona State University
    Ziyang Liu*, Arizona State University
    Susan Davidson, University of Pennsylvania
    Yi Chen, Arizona State University

1 件のコメント:

Hideaki さんのコメント...

はじめまして木村と申します。
すぐ読みたいものはcamera readyの締め切りが過ぎたら著者に頼んでpdf送ってもらうと良いと思いますよ。
私にとっては今回Uncertain DB関連で非常に興味深い論文が多いです。

私は今回も玉砕しました。weak acceptが3つでしたがreject。今年の会場はうち(Brown)なだけに非常に悔しい結果でした。多少weak rejectがあってもstrong acceptがあった方が通るようです。その代わりその論文も含めてたった今2本VLDBに出しました。今度こそ。

License

Creative Commons LicenseLeo's Chronicle by Taro L. Saito is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 2.1 Japan License.