ACM SIGMOD City, Country, Year
sigmod pods logo

SIGMOD 2012: Accepted Research Papers

  • Sample-Driven Schema Mapping, Li Qian, University of Michigan, Ann Arbor; Michael Cafarella, University of Michigan, Ann Arbor; H. V. Jagadish, University of Michigan, Ann Arbor
  • Optimal Top-k Generation of Attribute Combinations Based on Ranked Lists, Jiaheng Lu, Renmin University of China; Pierre Senellart, Télécom ParisTech; Chunbin Lin, Renmin University of China; Xiaoyong Du, Renmin University of China; Shan Wang, Renmin University of China; Xinxing Chen, Renmin University of China
  • Skew-Aware Automatic Database Partitioning in Shared-Nothing, Parallel OLTP Systems, Andrew Pavlo, Brown University; Carlo Curino, Yahoo! Research; Stan Zdonik, Brown University
  • Aggregate Suppression for Enterprise Search Engines, Mingyang Zhang, George Washington University; Nan Zhang, George Washington University; Gautam Das, University of Texas at Arlington
  • Top-k Bounded Diversification, Piero Fraternali, Politecnico di Milano; Davide Martinenghi, Politecnico di Milano; Marco Tagliasacchi, Politecnico di Milano
  • Towards Effective Partition Management for Large Graphs, Shengqi Yang, University of California, Santa Barbara; Xifeng Yan, University of California, Santa Barbara; Bo Zong, University of California, Santa Barbara; Arijit Khan, University of California, Santa Barbara
  • Probase: A Probabilistic Taxonomy for Text Understanding, Wentao Wu, University of Wisconsin-Madison; Hongsong Li, Microsoft Research Asia; Haixun Wang, Microsoft Research Asia; Kenny Zhu, Shanghai Jiao Tong University
  • Interactive Regret Minimization, Danupon Nanongkai, University of Vienna; Ashwin Lall, Denison University; Atish Das Sarma, Google Research; Kazuhisa Makino, University of Tokyo
  • Prediction-Based Geometric Monitoring over Distributed Data Streams, Nikos Giatrakos, University of Piraeus; Antonios Deligiannakis, Technical University of Crete; Minos Garofalakis, Technical University of Crete; Izchak Sharfman, Technion
  • Holistic Optimization by Prefetching Query Results, Karthik Ramachandra, IIT Bombay; S. Sudarshan, IIT Bombay
  • Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach, James Cheng, Nanyang Technological University; Yiping Ke, Institute of High Performance Computing, Singapore; Shumo Chu, Nanyang Technological University; Carter Cheng, Nanyang Technological University
  • MCJoin: A Memory-Constrained Join for Column-Based Main-Memory Databases, Steven Begley, La Trobe University; Zhen He, La Trobe University; Yi-Ping Phoebe Chen, La Trobe University
  • Skimmer: Rapid Scrolling of Relational Query Results, Manish Singh, University of Michigan, Ann Arbor; Arnab Nandi, University of Michigan, Ann Arbor; H. V. Jagadish, University of Michigan, Ann Arbor
  • Temporal Alignment, Anton Dignös, University of Zürich; Michael Böhlen, University of Zürich; Johann Gamper, Free University of Bozen-Bolzano
  • Materialized View Selection for XQuery Workloads, Asterios Katsifodimos, INRIA Saclay and Université Paris XI; Ioana Manolescu, INRIA Saclay; Vasilis Vassalos, Athens University of Economics and Business
  • Efficient External-Memory Bisimulation on DAGs, Jelle Hellings, UHasselt; George Fletcher, TU/e; Herman Haverkort, TU/e
  • CrowdScreen: Algorithms for Filtering Data with Humans, Aditya Parameswaran, Stanford University; Héctor García-Molina, Stanford University; Hyunjung Park, Stanford University; Neoklis Polyzotis, University of California, Santa Cruz; Aditya Ramesh, Stanford University; Jennifer Widom, Stanford University
  • So Who Won? Dynamic Max Discovery with the Crowd, Stephen Guo, Stanford University; Aditya Parameswaran, Stanford University; Héctor García-Molina, Stanford University
  • Authenticating Location-Based Services without Compromising Location Privacy, Haibo Hu, HKBU; Jianliang Xu, HKBU; Ziwei Yang, HKBU
  • Online Windowed Subsequence Matching over Probabilistic Sequences, Tingjian Ge, University of Massachusetts, Lowell; Zheng Li, University of Kentucky
  • Divergent Physical Design Tuning, Jeff LeFevre, University of California, Santa Cruz; Mariano Consens, University of Toronto; Kleoni Ioannidou, University of California, Santa Cruz; Neoklis Polyzotis, University of California, Santa Cruz
  • SCARAB: Scaling Reachability Computation on Large Graphs, Ruoming Jin, Kent State University; Ning Ruan, Kent State University; Saikat Dey, Kent State University; Jeffrey Xu Yu, The Chinese University of Hong Kong
  • A Highway-Centric Labeling Approach for Answering Distance Queries on Large Graphs, Ruoming Jin, Kent State University; Ning Ruan, Kent State University; Yang Xiang, Ohio State University; Victor Lee, Kent State University
  • Entity Augmentation and Attribute Discovery by Holistic Matching with Web Tables, Mohamed Yakout, Purdue University; Kris Ganjam, Microsoft Research; Kaushik Chakrabarti, Microsoft Research; Surajit Chaudhuri, Microsoft Research
  • A Model-Based Approach to Attributed Graph Clustering, Zhiqiang Xu, Nanyang Technological University; Yiping Ke, Institute of High Performance Computing, Singapore; Yi Wang, National University of Singapore; Hong Cheng, The Chinese University of Hong Kong; James Cheng, Nanyang Technological University
  • Can we Beat the Prefix Filtering? An Adaptive Framework for Similarity Join and Search, Jiannan Wang, Tsinghua University; Guoliang Li, Tsinghua University; Jianhua Feng, Tsinghua University
  • Scalable Processing of Continuous Top-k Queries under User Preferences, Albert Yu, Duke University; Pankaj Agarwal, Duke University; Jun Yang, Duke University
  • Efficient Spatial Sampling of Large Geographical Tables, Anish Das Sarma, Google; Hongrae Lee, Google; Hector Gonzalez, Google Research; Jayant Madhavan, Google Research; Alon Halevy, Google Research
  • Skeleton Automata for FPGAs: Reconfiguring without Reconstructing, Jens Teubner, ETH Zürich; Louis Woods, ETH Zürich; Chongling Nie, ETH Zürich
  • Effective Caching of Shortest Paths for Location-Based Services, Man Lung Yiu, Hong Kong Polytechnic University; Jeppe Thomsen, Hong Kong Polytechnic University; Christian Jensen, Aarhus University
  • Parallel Main-Memory Indexing for Moving-Object Query and Update Workloads, Darius Sidlauskas, Aalborg University; Simonas Saltenis, Aalborg University; Christian Jensen, Aarhus University
  • Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting, Junho Gan, Sun Yat-Sen University; Jianlin Feng, Sun Yat-Sen University; Qiong Fang, HKUST; Wilfred Ng, HKUST
  • Local Structure and Determinism in Probabilistic Databases, Theodoros Rekatsinas, University of Maryland; Amol Deshpande, University of Maryland; Lise Getoor, University of Maryland
  • TreeSpan: Efficiently Computing Similarity All-Matching, Gaoping Zhu, University of New South Wales; Xuemin Lin, University of New South Wales; Ke Zhu, University of New South Wales; Wenjie Zhang, University of New South Wales; Jeffrey Xu Yu, The Chinese University of Hong Kong
  • Calvin: Fast Distributed Transactions for Partitioned Database Systems, Alexander Thomson, Yale University; Thaddeus Diamond, Yale University; Shu-Chun Weng, Yale University; Kun Ren, Yale University; Philip Shao, Yale University; Daniel J. Abadi, Yale University
  • Query Preserving Graph Compression, Wenfei Fan, University of Edinburgh; Xin Wang, University of Edinburgh; Yinghui Wu, University of Edinburgh
  • NoDB: Efficient Query Execution on Raw Data Files, Ioannis Alagiannis, EPFL; Renata Borovica, EPFL; Miguel Branco, EPFL; Stratos Idreos, CWI; Anastasia Ailamaki, EPFL
  • Advanced Partitioning Techniques for Massively Distributed Computation, Jingren Zhou, Microsoft; Nico Bruno, Microsoft; Wei Lin, Microsoft
  • MASKIT: Privately Releasing User Context Streams for Personalized Mobile Applications, Michaela Goetz, Cornell University; Suman Nath, Microsoft Research; Johannes Gehrke, Cornell University
  • Managing Large Dynamic Graphs Efficiently, Jayanta Mondal, University of Maryland; Amol Deshpande, University of Maryland
  • SkewTune: Mitigating Skew in MapReduce Applications, YongChul Kwon, University of Washington; Magdalena Balazinska, University of Washington; Bill Howe, University of Washington; Jerome Rolia, HP Labs
  • High-Performance Complex Event Processing over XML Streams, Barzan Mozafari, MIT; Kai Zeng, University of California, Los Angeles; Carlo Zaniolo, University of California, Los Angeles
  • Towards a Unified Architecture for in-RDBMS Analytics, Xixuan Feng, University of Wisconsin-Madison; Arun Kumar, University of Wisconsin-Madison; Ben Recht, University of Wisconsin-Madison; Christopher Ré, University of Wisconsin-Madison
  • Declarative Error Management for Robust Data-Intensive Applications, Carl-Christian Kanne, IBM Almaden Research Center; Vuk Ercegovac, IBM Almaden Research Center
  • Optimizing Index for Taxonomy Keyword Search, Bolin Ding, University of Illinois at Urbana Champaign; Haixun Wang, Microsoft Research Asia; Ruoming Jin, Kent State University; Jiawei Han, University of Illinois at Urbana Champaign; Zhongyuan Wang, Microsoft Research Asia
  • A General Purpose Log Structure Merge Tree, Russell Sears, Yahoo! Research; Raghu Ramakrishnan, Yahoo! Research
  • GUPT: Privacy Preserving Data Analysis Made Easy, Prashanth Mohan, University of California, Berkeley; Abhradeep Thakurta, Pennsylvania State University; Elaine Shi, University of California, Berkeley; Dawn Song, University of California, Berkeley; David Culler, University of California, Berkeley
  • Tiresias: The Database Oracle for How-To Queries, Alexandra Meliou, University of Washington; Dan Suciu, University of Washington

Credits
Follow our progress: Facebook